Publication | Closed Access
Applications of finite automata representing large vocabularies
78
Citations
6
References
1993
Year
EngineeringPushdown AutomatonFinite AutomataSemanticsNatural Language ProcessingLanguage DocumentationMinimal Perfect HashingComputational LinguisticsTree AutomatonGrammarLanguage StudiesMachine TranslationComputational LexicologyComputer ScienceLexical ResourceAutomated ReasoningFormal MethodsMultilanguage DictionariesAutomaton OperationSuch AutomataLinguisticsComputational Semantics
Abstract The construction of minimal acyclic deterministic partial finite automata to represent large natural language vocabularies is described. Applications of such automata include spelling checkers and advisers, multilanguage dictionaries, thesauri, minimal perfect hashing and text compression.
| Year | Citations | |
|---|---|---|
Page 1
Page 1