engleski

NLP Dictionaries Implemented as FSAs

Dictionaries form the basis of most natural language applications. The most efficient implementations use finite automata. We describe functions implemented with automata and transducers -- including perfect hashing and its applications, morphological analysis and synthesis, and spelling correction -- construction algorithms, and compression.

Finite state automata, natural language processing, dictionaries

nije evidentirano