Add to ORKGInternational audienceThis paper deals with linguistic constraints encoded in the form of (binary) tables, generally called lexicon-grammar tables. We describe a unified method to compile sets of tables of linguistic constraints into Finite State Automata. This method has been practically implemented in the linguistic platform Unitex
Finite-state methods have been adopted widely in computational morphology and related linguistic app...
Proceedings of the NODALIDA 2011 Workshop Constraint Grammar Applications. Editors: Eckhard Bick, ...
Our programme is to use the model of W. Woods 1970 to attempt a full scale analysis of the language....
International audienceThis paper deals with linguistic constraints encoded in the form of (binary) t...
This note describes a new type of automaton that has been developed at CIS Munich for efficient reco...
This dissertation is a theoretical study of finite-state based grammars used in natural language pro...
This dissertation is concerned with finite state machine-based technology for modeling natural langu...
Finite State Automata (FSA) and their variants are natural tools adapted to the description of vario...
We describe the use of finite state automata for the description of natural languages. We demonstrat...
Proceeding volume: 1A language-independent framework for syntactic finlte-state parsing is discussed...
Proceeding volume: 140Sequential Constraint Grammar (SCG) (Karlsson, 1990) and its extensions have l...
This paper describes the conversion of a set of feature grammar rules into a deterministic finite st...
Proceedings of the NODALIDA 2011 Workshop Constraint Grammar Applications. Editors: Eckhard Bick, ...
International audienceWe describe the use of finite state automata for the description of natural la...
Master's thesis is dealing with translation based on coupled finite automaton model. Coupled finite ...
Finite-state methods have been adopted widely in computational morphology and related linguistic app...
Proceedings of the NODALIDA 2011 Workshop Constraint Grammar Applications. Editors: Eckhard Bick, ...
Our programme is to use the model of W. Woods 1970 to attempt a full scale analysis of the language....
International audienceThis paper deals with linguistic constraints encoded in the form of (binary) t...
This note describes a new type of automaton that has been developed at CIS Munich for efficient reco...
This dissertation is a theoretical study of finite-state based grammars used in natural language pro...
This dissertation is concerned with finite state machine-based technology for modeling natural langu...
Finite State Automata (FSA) and their variants are natural tools adapted to the description of vario...
We describe the use of finite state automata for the description of natural languages. We demonstrat...
Proceeding volume: 1A language-independent framework for syntactic finlte-state parsing is discussed...
Proceeding volume: 140Sequential Constraint Grammar (SCG) (Karlsson, 1990) and its extensions have l...
This paper describes the conversion of a set of feature grammar rules into a deterministic finite st...
Proceedings of the NODALIDA 2011 Workshop Constraint Grammar Applications. Editors: Eckhard Bick, ...
International audienceWe describe the use of finite state automata for the description of natural la...
Master's thesis is dealing with translation based on coupled finite automaton model. Coupled finite ...
Finite-state methods have been adopted widely in computational morphology and related linguistic app...
Proceedings of the NODALIDA 2011 Workshop Constraint Grammar Applications. Editors: Eckhard Bick, ...
Our programme is to use the model of W. Woods 1970 to attempt a full scale analysis of the language....