A Testing Framework for Finite-State Morphology - Archive ouverte HAL Access content directly
Conference Papers Year : 2009

A Testing Framework for Finite-State Morphology

(1, 2)


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.

Dates and versions

inria-00602871 , version 1 (23-06-2011)



François Barthélemy. A Testing Framework for Finite-State Morphology. CIAA 2009 - 14th International Conference on Implementation and Application of Automata (CIAA), Sebastian Maneth, Jul 2009, Sydney, Australia. pp.75-83, ⟨10.1007/978-3-642-02979-0_11⟩. ⟨inria-00602871⟩
47 View
0 Download



Gmail Facebook Twitter LinkedIn More