Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Automi, linguaggi, probabilità / Alberto Artosi
| Automi, linguaggi, probabilità / Alberto Artosi |
| Autore | Artosi, Alberto |
| Pubbl/distr/stampa | Bologna : CLUEB, 1986 |
| Descrizione fisica | 246 p. ; 22 cm |
| Disciplina | 401.51 |
| Collana | Saggi di filosofia del linguaggio e della scienza ; 7 |
| Soggetto topico | Linguistica matematica |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | ita |
| Record Nr. | UNISALENTO-991002096069707536 |
Artosi, Alberto
|
||
| Bologna : CLUEB, 1986 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Enriquecimiento de la competencia léxica : análisis estadístico / María Josefa Reyes Díaz
| Enriquecimiento de la competencia léxica : análisis estadístico / María Josefa Reyes Díaz |
| Autore | REYES DIAZ, María Josefa |
| Pubbl/distr/stampa | Las Palmas : Universidad de Las Palmas de Gran Canaria, 2000 |
| Descrizione fisica | 98 p. ; 24 cm. |
| Disciplina | 401.51 |
| Soggetto topico | Linguistica matematica |
| ISBN | 84-95286-45-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | spa |
| Record Nr. | UNISA-990002888180203316 |
|
REYES DIAZ, María Josefa
|
||
| Las Palmas : Universidad de Las Palmas de Gran Canaria, 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Formalizing natural languages : the NooJ approach / / Max Silberztein
| Formalizing natural languages : the NooJ approach / / Max Silberztein |
| Autore | Silberztein Max |
| Pubbl/distr/stampa | London, England ; ; Hoboken, New Jersey : , : ISTE : , : Wiley, , 2016 |
| Descrizione fisica | 1 online resource (273 p.) |
| Disciplina | 401.51 |
| Collana | Cognitive Science Series |
| Soggetto topico |
Formalization (Linguistics)
Natural language processing (Computer science) |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-119-26414-6
1-119-26413-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Table of Contents; Dedication; Title; Copyright; Acknowledgments; 1: Introduction: the Project; 1.1. Characterizing a set of infinite size; 1.2. Computers and linguistics; 1.3. Levels of formalization; 1.4. Not applicable; 1.5. NLP applications; 1.6. Linguistic formalisms: NooJ; 1.7. Conclusion and structure of this book; 1.8. Exercises; 1.9. Internet links; PART 1: Linguistic Units; 2: Formalizing the Alphabet; 2.1. Bits and bytes; 2.2. Digitizing information; 2.3. Representing natural numbers; 2.4. Encoding characters; 2.5. Alphabetical order; 2.6. Classification of characters
2.7. Conclusion2.8. Exercises; 2.9. Internet links; 3: Defining Vocabulary; 3.1. Multiple vocabularies and the evolution of vocabulary; 3.2. Derivation; 3.3. Atomic linguistic units (ALUs); 3.4. Multiword units versus analyzable sequences of simple words; 3.5. Conclusion; 3.6. Exercises; 3.7. Internet links; 4: Electronic Dictionaries; 4.1. Could editorial dictionaries be reused?; 4.2. LADL electronic dictionaries; 4.3. Dubois and Dubois-Charlier electronic dictionaries; 4.4. Specifications for the construction of an electronic dictionary; 4.5. Conclusion; 4.6. Exercises; 4.7. Internet links PART 2: Languages, Grammars and Machines5: Languages, Grammars, and Machines; 5.1. Definitions; 5.2. Generative grammars; 5.3. Chomsky-Schützenberger hierarchy; 5.4. The NooJ approach; 5.5. Conclusion; 5.6. Exercises; 5.7. Internet links; 6: Regular Grammars; 6.1. Regular expressions; 6.2. Finite-state graphs; 6.3. Non-deterministic and deterministic graphs; 6.4. Minimal deterministic graphs; 6.5. Kleene's theorem; 6.6. Regular expressions with outputs and finite-state transducers; 6.7. Extensions of regular grammars; 6.8. Conclusion; 6.9. Exercises; 6.10. Internet links 7: Context-Free Grammars7.1. Recursion; 7.2. Parse trees; 7.3. Conclusion; 7.4. Exercises; 7.5. Internet links; 8: Context-Sensitive Grammars; 8.1. The NooJ approach; 8.2. NooJ contextual constraints; 8.3. NooJ variables; 8.4. Conclusion; 8.5. Exercises; 8.6. Internet links; 9: Unrestricted Grammars; 9.1. Linguistic adequacy; 9.2. Conclusion; 9.3. Exercise; 9.4. Internet links; PART 3: Automatic Linguistic Parsing; 10: Text Annotation Structure; 10.1. Parsing a text; 10.2. Annotations; 10.3. Text annotation structure (TAS); 10.4. Exercise; 10.5. Internet links; 11: Lexical Analysis 11.1. Tokenization11.2. Word forms; 11.3. Morphological analyses; 11.4. Multiword unit recognition; 11.5. Recognizing expressions; 11.6. Conclusion; 11.7. Exercise; 12: Syntactic Analysis; 12.1. Local grammars; 12.2. Structural grammars; 12.3. Conclusion; 12.4. Exercises; 12.5. Internet links; 13: Transformational Analysis; 13.1. Implementing transformations; 13.2. Theoretical problems; 13.3. Transformational analysis with NooJ; 13.4. Question answering; 13.5. Semantic analysis; 13.6. Machine translation; 13.7. Conclusion; 13.8. Exercises; 13.9. Internet links; Conclusion; Bibliography; Index End User License Agreement |
| Record Nr. | UNINA-9910137526803321 |
|
Silberztein Max
|
||
| London, England ; ; Hoboken, New Jersey : , : ISTE : , : Wiley, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Formalizing natural languages : the NooJ approach / / Max Silberztein
| Formalizing natural languages : the NooJ approach / / Max Silberztein |
| Autore | Silberztein Max |
| Pubbl/distr/stampa | London, England ; ; Hoboken, New Jersey : , : ISTE : , : Wiley, , 2016 |
| Descrizione fisica | 1 online resource (273 p.) |
| Disciplina | 401.51 |
| Collana | Cognitive Science Series |
| Soggetto topico |
Formalization (Linguistics)
Natural language processing (Computer science) |
| ISBN |
1-119-26414-6
1-119-26413-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Table of Contents; Dedication; Title; Copyright; Acknowledgments; 1: Introduction: the Project; 1.1. Characterizing a set of infinite size; 1.2. Computers and linguistics; 1.3. Levels of formalization; 1.4. Not applicable; 1.5. NLP applications; 1.6. Linguistic formalisms: NooJ; 1.7. Conclusion and structure of this book; 1.8. Exercises; 1.9. Internet links; PART 1: Linguistic Units; 2: Formalizing the Alphabet; 2.1. Bits and bytes; 2.2. Digitizing information; 2.3. Representing natural numbers; 2.4. Encoding characters; 2.5. Alphabetical order; 2.6. Classification of characters
2.7. Conclusion2.8. Exercises; 2.9. Internet links; 3: Defining Vocabulary; 3.1. Multiple vocabularies and the evolution of vocabulary; 3.2. Derivation; 3.3. Atomic linguistic units (ALUs); 3.4. Multiword units versus analyzable sequences of simple words; 3.5. Conclusion; 3.6. Exercises; 3.7. Internet links; 4: Electronic Dictionaries; 4.1. Could editorial dictionaries be reused?; 4.2. LADL electronic dictionaries; 4.3. Dubois and Dubois-Charlier electronic dictionaries; 4.4. Specifications for the construction of an electronic dictionary; 4.5. Conclusion; 4.6. Exercises; 4.7. Internet links PART 2: Languages, Grammars and Machines5: Languages, Grammars, and Machines; 5.1. Definitions; 5.2. Generative grammars; 5.3. Chomsky-Schützenberger hierarchy; 5.4. The NooJ approach; 5.5. Conclusion; 5.6. Exercises; 5.7. Internet links; 6: Regular Grammars; 6.1. Regular expressions; 6.2. Finite-state graphs; 6.3. Non-deterministic and deterministic graphs; 6.4. Minimal deterministic graphs; 6.5. Kleene's theorem; 6.6. Regular expressions with outputs and finite-state transducers; 6.7. Extensions of regular grammars; 6.8. Conclusion; 6.9. Exercises; 6.10. Internet links 7: Context-Free Grammars7.1. Recursion; 7.2. Parse trees; 7.3. Conclusion; 7.4. Exercises; 7.5. Internet links; 8: Context-Sensitive Grammars; 8.1. The NooJ approach; 8.2. NooJ contextual constraints; 8.3. NooJ variables; 8.4. Conclusion; 8.5. Exercises; 8.6. Internet links; 9: Unrestricted Grammars; 9.1. Linguistic adequacy; 9.2. Conclusion; 9.3. Exercise; 9.4. Internet links; PART 3: Automatic Linguistic Parsing; 10: Text Annotation Structure; 10.1. Parsing a text; 10.2. Annotations; 10.3. Text annotation structure (TAS); 10.4. Exercise; 10.5. Internet links; 11: Lexical Analysis 11.1. Tokenization11.2. Word forms; 11.3. Morphological analyses; 11.4. Multiword unit recognition; 11.5. Recognizing expressions; 11.6. Conclusion; 11.7. Exercise; 12: Syntactic Analysis; 12.1. Local grammars; 12.2. Structural grammars; 12.3. Conclusion; 12.4. Exercises; 12.5. Internet links; 13: Transformational Analysis; 13.1. Implementing transformations; 13.2. Theoretical problems; 13.3. Transformational analysis with NooJ; 13.4. Question answering; 13.5. Semantic analysis; 13.6. Machine translation; 13.7. Conclusion; 13.8. Exercises; 13.9. Internet links; Conclusion; Bibliography; Index End User License Agreement |
| Record Nr. | UNINA-9910810673003321 |
|
Silberztein Max
|
||
| London, England ; ; Hoboken, New Jersey : , : ISTE : , : Wiley, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Introduzione alle grammatiche formali / Jean Baudot ; edizione italiana a cura di Lucio Costa ; traduzione di Lucio Costa
| Introduzione alle grammatiche formali / Jean Baudot ; edizione italiana a cura di Lucio Costa ; traduzione di Lucio Costa |
| Autore | BAUDOT, Jean |
| Pubbl/distr/stampa | Napoli : Liguori, 1987 |
| Descrizione fisica | 260 p. ; 24 cm |
| Disciplina | 401.51 |
| Soggetto topico |
Linguistica - Matematica
Logica formale - Studi |
| ISBN | 88-207-1428-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | ita |
| Record Nr. | UNISA-990000422090203316 |
|
BAUDOT, Jean
|
||
| Napoli : Liguori, 1987 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Issues in mathematical linguistics : workshop on mathematical linguistics, State College, PA, april 1998 / edited by Carlos Martin-Vide
| Issues in mathematical linguistics : workshop on mathematical linguistics, State College, PA, april 1998 / edited by Carlos Martin-Vide |
| Autore | Workshop on Mathematical Linguistics : 1998 |
| Pubbl/distr/stampa | Amsterdam, Philadelphia, : Benjamins, 1999 |
| Descrizione fisica | XI, 214 p. ; 23 cm |
| Disciplina | 401.51 |
| Collana | Studies in functional and structural linguistics |
| Soggetto non controllato | Linguistica matematica |
| ISBN | 90-272-1556-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-990004255080403321 |
|
Workshop on Mathematical Linguistics : 1998
|
||
| Amsterdam, Philadelphia, : Benjamins, 1999 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Language and Automata Theory and Applications [[electronic resource] ] : Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008, Revised Papers / / edited by Carlos Martin-Vide, Friedrich Otto, Henning Fernau
| Language and Automata Theory and Applications [[electronic resource] ] : Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008, Revised Papers / / edited by Carlos Martin-Vide, Friedrich Otto, Henning Fernau |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XIV, 500 p.) |
| Disciplina | 401.51 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Compilers (Computer programs) Computer programming Computer science Computer science—Mathematics Formal Languages and Automata Theory Compilers and Interpreters Programming Techniques Theory of Computation Symbolic and Algebraic Manipulation Computer Science Logic and Foundations of Programming |
| ISBN | 3-540-88282-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Tree-Walking Automata -- Formal Language Tools for Template-Guided DNA Recombination -- Subsequence Counting, Matrix Representations and a Theorem of Eilenberg -- Synchronizing Automata and the ?erný Conjecture -- Contributed Papers -- About Universal Hybrid Networks of Evolutionary Processors of Small Size -- On Bifix Systems and Generalizations -- Finite Automata, Palindromes, Powers, and Patterns -- One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations -- The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions -- Optional and Iterated Types for Pregroup Grammars -- Transformations and Preservation of Self-assembly Dynamics through Homotheties -- Deterministic Input-Reversal and Input-Revolving Finite Automata -- Random Context in Regulated Rewriting Versus Cooperating Distributed Grammar Systems -- Extending the Overlap Graph for Gene Assembly in Ciliates -- Automatic Presentations for Cancellative Semigroups -- Induced Subshifts and Cellular Automata -- Hopcroft’s Algorithm and Cyclic Automata -- Efficient Inclusion Checking for Deterministic Tree Automata and DTDs -- Consensual Definition of Languages by Regular Sets -- k-Petri Net Controlled Grammars -- 2-Synchronizing Words -- Not So Many Runs in Strings -- A Hybrid Approach to Word Segmentation of Vietnamese Texts -- On Linear Logic Planning and Concurrency -- On the Relation between Multicomponent Tree Adjoining Grammars with Tree Tuples (TT-MCTAG) and Range Concatenation Grammars (RCG) -- Anti-pattern Matching Modulo -- Counting Ordered Patterns in Words Generated by Morphisms -- Literal Varieties of Languages Induced by Homomorphisms onto Nilpotent Groups -- Characterization of Star-Connected Languages Using Finite Automata -- Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems -- Further Results on Insertion-Deletion Systems with One-Sided Contexts -- On Regularity-Preservation by String-Rewriting Systems -- Minimizing Deterministic Weighted Tree Automata -- Lower Bounds for Generalized Quantum Finite Automata -- How Many Figure Sets Are Codes? -- On Alternating Phrase-Structure Grammars -- A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata -- Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard -- Sorting and Element Distinctness on One-Way Turing Machines -- On Periodicity of Generalized Two-Dimensional Words -- On the Analysis of “Simple” 2D Stochastic Cellular Automata -- Polycyclic and Bicyclic Valence Automata -- Length Codes, Products of Languages and Primality -- An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs. |
| Record Nr. | UNISA-996465588803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Language and Automata Theory and Applications : Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008, Revised Papers / / edited by Carlos Martin-Vide, Friedrich Otto, Henning Fernau
| Language and Automata Theory and Applications : Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008, Revised Papers / / edited by Carlos Martin-Vide, Friedrich Otto, Henning Fernau |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XIV, 500 p.) |
| Disciplina | 401.51 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Compilers (Computer programs) Computer programming Computer science Computer science—Mathematics Formal Languages and Automata Theory Compilers and Interpreters Programming Techniques Theory of Computation Symbolic and Algebraic Manipulation Computer Science Logic and Foundations of Programming |
| ISBN | 3-540-88282-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Tree-Walking Automata -- Formal Language Tools for Template-Guided DNA Recombination -- Subsequence Counting, Matrix Representations and a Theorem of Eilenberg -- Synchronizing Automata and the ?erný Conjecture -- Contributed Papers -- About Universal Hybrid Networks of Evolutionary Processors of Small Size -- On Bifix Systems and Generalizations -- Finite Automata, Palindromes, Powers, and Patterns -- One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations -- The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions -- Optional and Iterated Types for Pregroup Grammars -- Transformations and Preservation of Self-assembly Dynamics through Homotheties -- Deterministic Input-Reversal and Input-Revolving Finite Automata -- Random Context in Regulated Rewriting Versus Cooperating Distributed Grammar Systems -- Extending the Overlap Graph for Gene Assembly in Ciliates -- Automatic Presentations for Cancellative Semigroups -- Induced Subshifts and Cellular Automata -- Hopcroft’s Algorithm and Cyclic Automata -- Efficient Inclusion Checking for Deterministic Tree Automata and DTDs -- Consensual Definition of Languages by Regular Sets -- k-Petri Net Controlled Grammars -- 2-Synchronizing Words -- Not So Many Runs in Strings -- A Hybrid Approach to Word Segmentation of Vietnamese Texts -- On Linear Logic Planning and Concurrency -- On the Relation between Multicomponent Tree Adjoining Grammars with Tree Tuples (TT-MCTAG) and Range Concatenation Grammars (RCG) -- Anti-pattern Matching Modulo -- Counting Ordered Patterns in Words Generated by Morphisms -- Literal Varieties of Languages Induced by Homomorphisms onto Nilpotent Groups -- Characterization of Star-Connected Languages Using Finite Automata -- Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems -- Further Results on Insertion-Deletion Systems with One-Sided Contexts -- On Regularity-Preservation by String-Rewriting Systems -- Minimizing Deterministic Weighted Tree Automata -- Lower Bounds for Generalized Quantum Finite Automata -- How Many Figure Sets Are Codes? -- On Alternating Phrase-Structure Grammars -- A Two-Dimensional Taxonomy of Proper Languages of Lexicalized FRR-Automata -- Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard -- Sorting and Element Distinctness on One-Way Turing Machines -- On Periodicity of Generalized Two-Dimensional Words -- On the Analysis of “Simple” 2D Stochastic Cellular Automata -- Polycyclic and Bicyclic Valence Automata -- Length Codes, Products of Languages and Primality -- An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs. |
| Record Nr. | UNINA-9910484243403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Les modèles linguistiques / I. I. Revzin ; traduit et adapté par Y. Gentilhomme
| Les modèles linguistiques / I. I. Revzin ; traduit et adapté par Y. Gentilhomme |
| Autore | Revzin, Isaac Iosifovic |
| Pubbl/distr/stampa | Paris, : Dunod, 1968 |
| Descrizione fisica | X, 201 p. ; 24 cm |
| Disciplina |
410
401.51 |
| Collana | Monographies de linguistique mathématique |
| Soggetto non controllato | Linguistica |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | fre |
| Record Nr. | UNINA-990000852850403321 |
|
Revzin, Isaac Iosifovic
|
||
| Paris, : Dunod, 1968 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Linguaggio e logica / Günther Patzig
| Linguaggio e logica / Günther Patzig |
| Autore | Patzig, Günther |
| Pubbl/distr/stampa | Torino : Boringhieri, 1973 |
| Descrizione fisica | 114 p. ; 20 cm |
| Disciplina | 401.51 |
| Collana | Universsale scientifica |
| Soggetto topico | Logica |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | ita |
| Record Nr. | UNIBAS-000033907 |
|
Patzig, Günther
|
||
| Torino : Boringhieri, 1973 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. della Basilicata | ||
| ||
