Finite State tools for Natural Language Processing
Jan Daciuk, R Zajac · University of Groningen research database (University of Groningen / Centre for Information Technology) · 2000
We describe a set of tools using deterministic, acyclic, finite-state automata for natural language processing applications. The core of the tool set consists of two programs constructing finite-state automata (using two different, but related algorithms). Other programs from the set interpret the contents of those automata. Preprocessing scripts and user interfaces complete the set. The tools are available for research purposes in source form in the Internet.