Finite-State Methods and Natural Language Processing
Springer Berlin (Verlag)
9783642146831 (ISBN)
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.
| Erscheint lt. Verlag | 5.8.2010 |
|---|---|
| Reihe/Serie | Lecture Notes in Artificial Intelligence | Lecture Notes in Computer Science |
| Zusatzinfo | X, 147 p. 44 illus. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Themenwelt | Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik |
| Schlagworte | Computational Linguistics • Finite Automata • finite state machines • morphological analysis • NATURAL • natural language • Processing • SAT solvers |
| ISBN-13 | 9783642146831 / 9783642146831 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich