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.
Finite-State Methods and Natural Language Processing [[electronic resource] ] : 8th International Workshop, FSMNLP 2009, Pretoria, South Africa, July 21-24, 2009, Revised Selected Papers / / edited by Anssi Yli-Jyrä, Andras Kornai, Jacques Sakarovitch, Bruce Watson
| Finite-State Methods and Natural Language Processing [[electronic resource] ] : 8th International Workshop, FSMNLP 2009, Pretoria, South Africa, July 21-24, 2009, Revised Selected Papers / / edited by Anssi Yli-Jyrä, Andras Kornai, Jacques Sakarovitch, Bruce Watson |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (X, 147 p. 44 illus.) |
| Disciplina | 006.3/5 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Natural language processing (Computer science)
Computer programming Programming languages (Electronic computers) Artificial intelligence Mathematical logic Computer logic Natural Language Processing (NLP) Programming Techniques Programming Languages, Compilers, Interpreters Artificial Intelligence Mathematical Logic and Formal Languages Logics and Meanings of Programs |
| ISBN | 3-642-14684-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Tutorials -- Learning Finite State Machines -- Special Theme Tutorials -- Developing Computational Morphology for Low- and Middle-Density Languages -- Invited Papers -- fsm2 – A Scripting Language Interpreter for Manipulating Weighted Finite-State Automata -- Selected Operations and Applications of n-Tape Weighted Finite-State Machines -- OpenFst -- Special Theme Invited Talks -- Morphological Analysis of Tone Marked Kinyarwanda Text -- Regular Papers -- Minimizing Weighted Tree Grammars Using Simulation -- Compositions of Top-Down Tree Transducers with ?-Rules -- Reducing Nondeterministic Finite Automata with SAT Solvers -- Joining Composition and Trimming of Finite-State Transducers -- Special Theme Extended Abstracts -- Porting Basque Morphological Grammars to foma, an Open-Source Tool -- Describing Georgian Morphology with a Finite-State System -- Finite State Morphology of the Nguni Language Cluster: Modelling and Implementation Issues -- A Finite State Approach to Setswana Verb Morphology -- Competition Announcements -- Zulu: An Interactive Learning Competition. |
| Record Nr. | UNISA-996466215903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Implementation and Application of Automata [[electronic resource] ] : 6th International Conference, CIAA 2001, Pretoria, South Africa, July 23-25, 2001. Revised Papers / / edited by Bruce Watson, Derick Wood
| Implementation and Application of Automata [[electronic resource] ] : 6th International Conference, CIAA 2001, Pretoria, South Africa, July 23-25, 2001. Revised Papers / / edited by Bruce Watson, Derick Wood |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (X, 294 p.) |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Artificial intelligence
Computers Algorithms Computer logic Mathematical logic Artificial Intelligence Computation by Abstract Devices Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Mathematical Logic and Formal Languages |
| ISBN | 3-540-36390-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Using Finite State Technology in Natural Language Processing of Basque -- Cascade Decompositions are Bit-Vector Algorithms -- Submodule Construction and Supervisory Control: A Generalization -- Counting the Solutions of Presburger Equations without Enumerating Them -- Brzozowski’s Derivatives Extended to Multiplicities -- Finite Automata for Compact Representation of Language Models in NLP -- Past Pushdown Timed Automata -- Scheduling Hard Sporadic Tasks by Means of Finite Automata and Generating Functions -- Bounded-Graph Construction for Noncanonical Discriminating-Reverse Parsers -- Finite-State Transducer Cascade to Extract Proper Names in Texts -- Is this Finite-State Transducer Sequentiable? -- Compilation Methods of Minimal Acyclic Finite-State Automata for Large Dictionaries -- Bit Parallelism - NFA Simulation -- Improving Raster Image Run-Length Encoding Using Data Order -- Enhancements of Partitioning Techniques for Image Compression Using Weighted Finite Automata -- Extraction of ?-Cycles from Finite-State Transducers -- On the Size of Deterministic Finite Automata -- Crystal Lattice Automata -- Minimal Adaptive Pattern-Matching Automata for Efficient Term Rewriting -- Adaptive Rule-Driven Devices - General Formulation and Case Study -- Typographical Nearest-Neighbor Search in a Finite-State Lexicon and Its Application to Spelling Correction -- On the Software Design of Cellular Automata Simulators for Ecological Modeling -- Random Number Generation with ?-NFAs -- Supernondeterministic Finite Automata. |
| Record Nr. | UNISA-996465544603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Implementation and Application of Automata : 6th International Conference, CIAA 2001, Pretoria, South Africa, July 23-25, 2001. Revised Papers / / edited by Bruce Watson, Derick Wood
| Implementation and Application of Automata : 6th International Conference, CIAA 2001, Pretoria, South Africa, July 23-25, 2001. Revised Papers / / edited by Bruce Watson, Derick Wood |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (X, 294 p.) |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Artificial intelligence
Computers Algorithms Computer logic Mathematical logic Artificial Intelligence Computation by Abstract Devices Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Mathematical Logic and Formal Languages |
| ISBN | 3-540-36390-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Using Finite State Technology in Natural Language Processing of Basque -- Cascade Decompositions are Bit-Vector Algorithms -- Submodule Construction and Supervisory Control: A Generalization -- Counting the Solutions of Presburger Equations without Enumerating Them -- Brzozowski’s Derivatives Extended to Multiplicities -- Finite Automata for Compact Representation of Language Models in NLP -- Past Pushdown Timed Automata -- Scheduling Hard Sporadic Tasks by Means of Finite Automata and Generating Functions -- Bounded-Graph Construction for Noncanonical Discriminating-Reverse Parsers -- Finite-State Transducer Cascade to Extract Proper Names in Texts -- Is this Finite-State Transducer Sequentiable? -- Compilation Methods of Minimal Acyclic Finite-State Automata for Large Dictionaries -- Bit Parallelism - NFA Simulation -- Improving Raster Image Run-Length Encoding Using Data Order -- Enhancements of Partitioning Techniques for Image Compression Using Weighted Finite Automata -- Extraction of ?-Cycles from Finite-State Transducers -- On the Size of Deterministic Finite Automata -- Crystal Lattice Automata -- Minimal Adaptive Pattern-Matching Automata for Efficient Term Rewriting -- Adaptive Rule-Driven Devices - General Formulation and Case Study -- Typographical Nearest-Neighbor Search in a Finite-State Lexicon and Its Application to Spelling Correction -- On the Software Design of Cellular Automata Simulators for Ecological Modeling -- Random Number Generation with ?-NFAs -- Supernondeterministic Finite Automata. |
| Record Nr. | UNINA-9910143897703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||