Finite-State Morphology
Distributed for Center for the Study of Language and Information
503 pages
|
6 x 9
|
© 2003
The finite-state paradigm of computer science 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.
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.
Contents
1 A Gentle Introduction
2 A Systematic Introduction
3 The xfst Interface
4 The lexc Language
5 Planning and Managing Finite-State Projects
6 Testing and Debugging
7 Flag Diacritics
8 Non-Concatenative Morphotactics
9 Finite-State Linguistic Applications
A Graphing Quiz
B Solutions to Exercises
For more information, or to order this book, please visit http://www.press.uchicago.edu
Google preview here
You may purchase this title at these fine bookstores. Outside the USA, see our international sales information.
