Finite State Morphology

The finite-state paradigm of computer sciences has provided a basis for natural-language applications that are efficient, elegant and robust. This volume is a practical guide to finite-state theory and the affiliated programming languages lexc and xfst. Readers will learn how to write tokenizers, spelling checkers, and especially morphological analyzer/generators for words in English, French, Finnish, Hungarian and other languages. Included are graded introductions, examples, and exercises suitable for individual study as well as formal courses. These take advantage of widely tested lexc and xfst applications that are just becoming available for noncommercial use via the Internet.

[1]  C. Douglas Johnson,et al.  Formal Aspects of Phonological Description , 1972 .

[2]  Kimmo Koskenniemi,et al.  A General Computational Model for Word-Form Recognition and Production , 1984, ACL.

[3]  David Yarowsky,et al.  Word-Sense Disambiguation Using Statistical Models of Roget’s Categories Trained on Large Corpora , 2010, COLING.

[4]  Susan McRoy,et al.  Using Multiple Knowledge Sources for Word Sense Discrimination , 1992, Comput. Linguistics.

[5]  Lexical Disambiguation using Simulated Annealing , 1992, HLT.

[6]  Kevin Knight,et al.  Building a Large-Scale Knowledge Base for Machine Translation , 1994, AAAI.

[7]  Martin Kay,et al.  Regular Models of Phonological Rule Systems , 1994, CL.

[8]  Yves Schabes,et al.  On the Use of Sequential Transducers in Natural Language Processing , 1997 .

[9]  Mehryar Mohri,et al.  A Rational Design for a Weighted Finite-State Transducer Library , 1997, Workshop on Implementing Automata.

[10]  S.W.K. Chan.  Semantic parsing as an energy minimization problem , 1997, 1997 IEEE International Conference on Intelligent Processing Systems (Cat. No.97TH8335).

[11]  Gertjan van Noord,et al.  An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing , 1999, WIA.

[12]  Bruce W. Watson,et al.  Incremental construction of minimal acyclic finite state automata , 2000, CL.

[13]  James H. Martin,et al.  Speech and language processing: an introduction to natural language processing, computational linguistics, and speech recognition, 2nd Edition , 2000, Prentice Hall series in artificial intelligence.

[14]  Mark Steedman,et al.  The syntactic process , 2004, Language, speech, and communication.