Synchronized rational relations of finite and infinite words
Theoretical Computer Science - Selected papers of the International Colloquium on Words, Languages and Combinatorics, Kyoto, Japan, August 1990
Regular models of phonological rule systems
Computational Linguistics - Special issue on computational phonology
Automata, Languages, and Machines
Automata, Languages, and Machines
Extreme Programming Explained: Embrace Change (2nd Edition)
Extreme Programming Explained: Embrace Change (2nd Edition)
The Karamel system and semitic languages: structured multi-tiered morphology
Semitic '09 Proceedings of the EACL 2009 Workshop on Computational Approaches to Semitic Languages
Two-level model for morphological analysis
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
OpenFst: a general and efficient weighted finite-state transducer library
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
FSMNLP '11 Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing
| Hi-index | 0.00 |
This paper describes a unit testing framework for the languages which rely on rational relations to describe Natural Language Morphology. A test is divided into two parts: firstly compute a finite-state machine; secondly inspect this machine to compute its cardinality. The first part involves the finite-state machines to be tested and finite-state machines encoding the inputs of the test. A dependency relation is used to relate tests and the components of the description.