The finite-state paradigm is increasingly popular, and natural-language applications based on the theory are elegant, robust and efficient. This book is a practical guide to finite-state theory and to the use of the Xerox finite-state programming languages LexC and xfst. The text provides graded introductions, examples, and exercises that are suitable for individual study or formal courses. Finite-state morphology assumes that both the word-formation rules morphotactics and the morpho-phonological alternation rules can be modeled as finite-state machines.
|Published (Last):||28 November 2012|
|PDF File Size:||20.68 Mb|
|ePub File Size:||6.21 Mb|
|Price:||Free* [*Free Regsitration Required]|
Skip to search form Skip to main content You are currently offline. Some features of the site may not work correctly. 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.
View Paper. Save to Library. Create Alert. Launch Research Feed. Share This Paper. Supplemental Presentations. Finite State Morphology. Explore Further Discover more papers related to the topics discussed in this paper. Figures and Topics from this paper. Natural language processing Computational linguistics Mathematical morphology Language technology Software documentation Relevance Book.
Citations Publications citing this paper. Tyers Computer Science Krishna B. Singha , Kh. Constructing a morphophonological analyzer for Lushootseed Joshua Crowgey Finite-state relations between two historically closely related languages Kimmo Koskenniemi Computer Science References Publications referenced by this paper. CA Stanford Multitext grammars. Melamed , I. Dan Lexical disambiguation using simulated annealing James R. Cowie , Joe A. Guthrie , Louise Guthrie Computer Science Linguistics Related Papers.
Finite State Morphology