Local grammars are finite-state grammars or finite-state automata that represent sets of utterances of a natural language.Local grammars have been used to describe a wide variety of sets of strings, ranging from finite sets of words related by prefixation and suffixation to sets of sentences syntactically and semantically related. Formal representations of finite-state grammars are quite varied, although equivalent. We have chosen a particular representation by graphs which is well-adapted to the syntax of natural languages. Using a particular example, we will present in detail a method for constructing local grammars using large corpora
This dissertation is concerned with finite state machine-based technology for modeling natural langu...
An algorithm that infers a finite state grammar from a language specified by simple erumeration of l...
Rcccnt mathcmatical and algorithmic rcsults in thc field of fmite-state tcchnology, as well as thc i...
Local grammars are finite-state grammars or finite-state automata that represent sets of utterances ...
Local grammars are finite-state grammars or finite-state automata that represent sets of utterances ...
Our programme is to use the model of W. Woods 1970 to attempt a full scale analysis of the language....
Our programme is to use the model of W. Woods 1970 to attempt a full scale analysis of the language....
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 ...
Our programme is to use the model of W. Woods 1970 to attempt a full scale analysis of the language....
A finite state language is a finite or infinite set of strings (sentences) of symbols (words) genera...
International audienceWe describe the use of finite state automata for the description of natural la...
In the study of collocations and of frozen sentences (idioms, clichés, collocations, many metaphors ...
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...
This dissertation is concerned with finite state machine-based technology for modeling natural langu...
An algorithm that infers a finite state grammar from a language specified by simple erumeration of l...
Rcccnt mathcmatical and algorithmic rcsults in thc field of fmite-state tcchnology, as well as thc i...
Local grammars are finite-state grammars or finite-state automata that represent sets of utterances ...
Local grammars are finite-state grammars or finite-state automata that represent sets of utterances ...
Our programme is to use the model of W. Woods 1970 to attempt a full scale analysis of the language....
Our programme is to use the model of W. Woods 1970 to attempt a full scale analysis of the language....
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 ...
Our programme is to use the model of W. Woods 1970 to attempt a full scale analysis of the language....
A finite state language is a finite or infinite set of strings (sentences) of symbols (words) genera...
International audienceWe describe the use of finite state automata for the description of natural la...
In the study of collocations and of frozen sentences (idioms, clichés, collocations, many metaphors ...
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...
This dissertation is concerned with finite state machine-based technology for modeling natural langu...
An algorithm that infers a finite state grammar from a language specified by simple erumeration of l...
Rcccnt mathcmatical and algorithmic rcsults in thc field of fmite-state tcchnology, as well as thc i...