Sciweavers

IPL
2008
79views more  IPL 2008»
13 years 11 months ago
On the efficient construction of quasi-reversible automata for reversible languages
Quasi-reversible automata is a suitable representation for reversible languages. In this work a method is proposed to obtain such an automaton for any given reversible language re...
Pedro García, Manuel Vazquez de Parga, Dami...
NAACL
2003
14 years 11 days ago
Unsupervised Learning of Morphology for English and Inuktitut
We describe a simple unsupervised technique for learning morphology by identifying hubs in an automaton. For our purposes, a hub is a node in a graph with in-degree greater than o...
Howard Johnson, Joel D. Martin