Add to ORKGFinite-state methods are finding ever increasing use among linguists as a way of modeling phonology and morphology and as a method for manipulating and modeling text. This paper describes a suite of very simple finite-state tools written by the author that can be used to investigate this area and that can be used for simple analysis
Wide-coverage natural language parsers are typically not very efficient. Finite-state techniques are...
This paper reports on the design and implementation of a morphological analyzer for Wolof. The main ...
Wide-coverage natural language parsers are typically not very efficient. Finite-state techniques are...
Finite-state methods are finding ever increasing use among linguists as a way of modeling phonology ...
Recent mathematical and algorithmic results in the field of finite-state technology, as well the inc...
This dissertation is concerned with finite state machine-based technology for modeling natural langu...
Finite-state methods have been adopted widely in computational morphology and related linguistic app...
Rcccnt mathcmatical and algorithmic rcsults in thc field of fmite-state tcchnology, as well as thc i...
Finite-state methods have been adopted widely in computational morphology and related linguistic app...
Finite-state methods have been adopted widely in computational morphology and related linguistic app...
We propose DFSM's as an extension of finite state machines, explore some of their properties, a...
Finite State Automata (FSA) and their variants are natural tools adapted to the description of vario...
A finite state language is a finite or infinite set of strings (sentences) of symbols (words) genera...
Wide-coverage natural language parsers are typically not very efficient. Finite-state techniques are...
Wide-coverage natural language parsers are typically not very efficient. Finite-state techniques are...
Wide-coverage natural language parsers are typically not very efficient. Finite-state techniques are...
This paper reports on the design and implementation of a morphological analyzer for Wolof. The main ...
Wide-coverage natural language parsers are typically not very efficient. Finite-state techniques are...
Finite-state methods are finding ever increasing use among linguists as a way of modeling phonology ...
Recent mathematical and algorithmic results in the field of finite-state technology, as well the inc...
This dissertation is concerned with finite state machine-based technology for modeling natural langu...
Finite-state methods have been adopted widely in computational morphology and related linguistic app...
Rcccnt mathcmatical and algorithmic rcsults in thc field of fmite-state tcchnology, as well as thc i...
Finite-state methods have been adopted widely in computational morphology and related linguistic app...
Finite-state methods have been adopted widely in computational morphology and related linguistic app...
We propose DFSM's as an extension of finite state machines, explore some of their properties, a...
Finite State Automata (FSA) and their variants are natural tools adapted to the description of vario...
A finite state language is a finite or infinite set of strings (sentences) of symbols (words) genera...
Wide-coverage natural language parsers are typically not very efficient. Finite-state techniques are...
Wide-coverage natural language parsers are typically not very efficient. Finite-state techniques are...
Wide-coverage natural language parsers are typically not very efficient. Finite-state techniques are...
This paper reports on the design and implementation of a morphological analyzer for Wolof. The main ...
Wide-coverage natural language parsers are typically not very efficient. Finite-state techniques are...