Конечные Автоматы
Related Papers
Reversible Automata and Induction of the English Auxiliary System
In this paper we apply some recent work of Angluin (1982) to the induction of the English auxiliary verb system. In general, the induction of finite automata is computation- ally …...
Typed feature formalisms as a common basis for linguistic specification
AbstractTyped feature formalisms (TFF) play an increasingly important role in NLP and, in particular, in MT. Many of these systems are inspired by Pollard and Sag’s work on Head-Driven Phrase …...
Terminology Finite-state Preprocessing for Computational LFG
This paper presents a technique to deal with multiword nominal terminology in a compu- tational Lexical Functional Grammar. This method treats multiword terms as single to- kens by modifying the …...
Hierarchical Phrase-based Translation Representations
This paper compares several translation rep- resentations for a synchronous context-free grammar parse including CFGs/hypergraphs, finite-state automata (FSA), and pushdown automata (PDA). The representation choice is shown to determine the …...
Pair Language Models for Deriving Alternative Pronunciations and Spellings from Pronunciation Dictionaries
Pronunciation dictionaries provide a readily available parallel corpus for learning to trans- duce between character strings and phoneme strings or vice versa. Translation models can be used to derive character-level …...