Finite state tools for natural language processing

Authors:
Jan Daciuk
Affiliations:
Alfa Informatica, Rijksuniversiteit Groningen, AS Groningen, the Netherlands
Venue:
Proceedings of the COLING-2000 Workshop on Using Toolsets and Architectures To Build NLP Systems
Year:
2000

Citing 5
Cited 5

Applications of finite automata representing large vocabularies

Software—Practice & Experience
Error-tolerant finite-state recognition with applications to morphological analysis and spelling correction

Computational Linguistics
Incremental construction of minimal acyclic finite-state automata

Computational Linguistics - Special issue on finite-state methods in NLP
Spelling correction in agglutinative languages

ANLC '94 Proceedings of the fourth conference on Applied natural language processing
Incremental construction of minimal acyclic finite state automata and transducers

FSMNLP '09 Proceedings of the International Workshop on Finite State Methods in Natural Language Processing

Using Finite State Technology in Natural Language Processing of Basque

CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Finite Automata for Compact Representation of Language Models in NLP

CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Finite automata for compact representation of tuple dictionaries

Theoretical Computer Science - Implementation and application automata
A lemma-based approach to a maximum entropy word sense disambiguation system for Dutch

COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Developing an open-source, rule-based proofreading tool

Software—Practice & Experience

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.