Add to ORKGInternational audienceWe describe the use of finite state automata for the description of natural languages. We demonstrate the use of this model of grammar through linguistically varied examples, from time adverbials and sentential determiners to elementary sentences of a lexicon-grammar
The construction of minimal acyclic deterministic partial finite automata to represent large natural...
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...
International audienceWe describe the use of finite state automata for the description of natural la...
We describe the use of finite state automata for the description of natural languages. We demonstrat...
Finite State Automata (FSA) and their variants are natural tools adapted to the description of vario...
This dissertation is concerned with finite state machine-based technology for modeling natural langu...
In this diploma work the concept of formal language is presented, introducing the ideas related to ...
A finite state language is a finite or infinite set of strings (sentences) of symbols (words) genera...
In the study of collocations and of frozen sentences (idioms, clichés, collocations, many metaphors ...
In the study of collocations and of frozen sentences (idioms, clichés, collocations, many metaphors ...
Rcccnt mathcmatical and algorithmic rcsults in thc field of fmite-state tcchnology, as well as thc i...
Recent mathematical and algorithmic results in the field of finite-state technology, as well the inc...
this paper we present a finite-state model of phonology in which automata are the descriptions and t...
Wide-coverage natural language parsers are typically not very efficient. Finite-state techniques are...
The construction of minimal acyclic deterministic partial finite automata to represent large natural...
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...
International audienceWe describe the use of finite state automata for the description of natural la...
We describe the use of finite state automata for the description of natural languages. We demonstrat...
Finite State Automata (FSA) and their variants are natural tools adapted to the description of vario...
This dissertation is concerned with finite state machine-based technology for modeling natural langu...
In this diploma work the concept of formal language is presented, introducing the ideas related to ...
A finite state language is a finite or infinite set of strings (sentences) of symbols (words) genera...
In the study of collocations and of frozen sentences (idioms, clichés, collocations, many metaphors ...
In the study of collocations and of frozen sentences (idioms, clichés, collocations, many metaphors ...
Rcccnt mathcmatical and algorithmic rcsults in thc field of fmite-state tcchnology, as well as thc i...
Recent mathematical and algorithmic results in the field of finite-state technology, as well the inc...
this paper we present a finite-state model of phonology in which automata are the descriptions and t...
Wide-coverage natural language parsers are typically not very efficient. Finite-state techniques are...
The construction of minimal acyclic deterministic partial finite automata to represent large natural...
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...