Applications of finite automata representing large vocabularies
Software—Practice & Experience
Regional Least-Cost Error Repair
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Compilation Methods of Minimal Acyclic Finite-State Automata for Large Dictionaries
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Incremental construction of minimal acyclic finite-state automata
Computational Linguistics - Special issue on finite-state methods in NLP
Searching for asymptotic error repair
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Hi-index | 0.00 |
We focus on the domain of a regional least-cost strategy in order to illustrate the viability of non-global repair models over finite-state architectures. Our interest is justified by the difficulty, shared by all repair proposals, to determine how far to validate. A short validation may fail to gather sufficient information, and in a long one most of the effort can be wasted. The goal is to prove that our approach can provide, in practice, a performance and quality comparable to that attained by global criteria, with a significant saving in time and space. To the best of our knowledge, this is the first discussion of its kind.