Finite-State Methods and Natural Language Processing 8th International Workshop, FSMNLP 2009, Pretoria, South Africa, July 21-24, 2009, Revised Selected Papers /
Finite-State Methods and Natural Language Processing 8th International Workshop, FSMNLP 2009, Pretoria, South Africa, July 21-24, 2009, Revised Selected Papers / [electronic resource] :
edited by Anssi Yli-Jyrä, Andras Kornai, Jacques Sakarovitch, Bruce Watson.
- 1st ed. 2010.
- X, 147 p. 44 illus. online resource.
- Lecture Notes in Artificial Intelligence, 6062 2945-9141 ; .
- Lecture Notes in Artificial Intelligence, 6062 .
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.
9783642146848
10.1007/978-3-642-14684-8 doi
Natural language processing (Computer science).
Computer programming.
Compilers (Computer programs).
Artificial intelligence.
Machine theory.
Computer science.
Natural Language Processing (NLP).
Programming Techniques.
Compilers and Interpreters.
Artificial Intelligence.
Formal Languages and Automata Theory.
Computer Science Logic and Foundations of Programming.
QA76.9.N38
006.35
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.
9783642146848
10.1007/978-3-642-14684-8 doi
Natural language processing (Computer science).
Computer programming.
Compilers (Computer programs).
Artificial intelligence.
Machine theory.
Computer science.
Natural Language Processing (NLP).
Programming Techniques.
Compilers and Interpreters.
Artificial Intelligence.
Formal Languages and Automata Theory.
Computer Science Logic and Foundations of Programming.
QA76.9.N38
006.35