Sciweavers

ACL
1998

Transforming Lattices into Non-deterministic Automata with Optional Null Arcs

13 years 5 months ago
Transforming Lattices into Non-deterministic Automata with Optional Null Arcs
The problem of transforming a lattice into a non-deterministic finite state automaton is non-trivial. We present a transformation algorithm which tracks, for each node of an automaton under construction, the lares which it reflects and the lattice nodes at their origins and extremities. An extension of the algorithm permits the inclusion of null, or epsilon, arcs in the output automaton. The algorithm has been successfully applied to lattices derived from dictionaries, i.e. very large corpora of strings.
Mark Seligman, Christian Boitet, Boubaker Meddeb-H
Added 01 Nov 2010
Updated 01 Nov 2010
Type Conference
Year 1998
Where ACL
Authors Mark Seligman, Christian Boitet, Boubaker Meddeb-Hamrouni
Comments (0)