A Testing Framework for Finite-State Morphology

Abstract : 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.
Type de document :
Communication dans un congrès
CIAA 2009 - 14th International Conference on Implementation and Application of Automata (CIAA), Jul 2009, Sydney, Australia. Springer, 5642, pp.75-83, 2009, Lecture Notes in Computer Science. 〈http://www.springerlink.com/content/y741111787224684/〉. 〈10.1007/978-3-642-02979-0_11〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00602871
Contributeur : François Barthélemy <>
Soumis le : jeudi 23 juin 2011 - 15:43:03
Dernière modification le : mercredi 12 octobre 2016 - 01:23:21

Identifiants

Collections

Citation

François Barthélemy. A Testing Framework for Finite-State Morphology. CIAA 2009 - 14th International Conference on Implementation and Application of Automata (CIAA), Jul 2009, Sydney, Australia. Springer, 5642, pp.75-83, 2009, Lecture Notes in Computer Science. 〈http://www.springerlink.com/content/y741111787224684/〉. 〈10.1007/978-3-642-02979-0_11〉. 〈inria-00602871〉

Partager

Métriques

Consultations de la notice

67