Languages generated by two-level morphological rules
Computational Linguistics
Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
Computational nonlinear morphology: with emphasis on semitic languages
Computational nonlinear morphology: with emphasis on semitic languages
Formalisms for morphographemic description
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
Formalisms for morphographemic description
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
Constructing lexical transducers
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Two-level morphology with composition
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Compiling a partition-based two-level formalism
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
Logical specification of finite-state transductions for natural language processing
Logical specification of finite-state transductions for natural language processing
OpenFst: a general and efficient weighted finite-state transducer library
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Compiling generalized two-level rules and grammars
FinTAL'06 Proceedings of the 5th international conference on Advances in Natural Language Processing
Compiling simple context restrictions with nondeterministic automata
FSMNLP '11 Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing
| Hi-index | 0.00 |
A novel method is presented for compiling two-level rules which have multiple context parts. The same method can also be applied to the resolution of so-called right-arrow rule conflicts. The method makes use of the fact that one can efficiently compose sets of two-level rules with a lexicon transducer. By introducing variant characters and using simple pre-processing of multi-context rules, all rules can be reduced into single-context rules. After the modified rules have been combined with the lexicon transducer, the variant characters may be reverted back to the original surface characters. The proposed method appears to be efficient but only partial evidence is presented yet.