Add to ORKGContains reports on one research project.National Science FoundationEastman Kodak Company (Grant
A language is considered here as a finite set of symbols (words of the language) together with a set...
Our programme is to use the model of W. Woods 1970 to attempt a full scale analysis of the language....
In this article, we approach finite-state description practices that must be instilled in the develo...
A grammar can be regarded as a device that enumerates the sentences of a language. We study a sequen...
We describe the use of finite state automata for the description of natural languages. We demonstrat...
Contains research objectives and reports on one research project.National Science Foundatio
A finite state language is a finite or infinite set of strings (sentences) of symbols (words) genera...
Proceeding volume: 1A language-independent framework for syntactic finlte-state parsing is discussed...
A language-independent framework for syntactic finlte-state parsing is discussed. The article presen...
Our programme is to use the model of W. Woods 1970 to attempt a full scale analysis of the language....
It has been pointed out that context-free grammars of a certain class have the property that a one-o...
Finite State Automata (FSA) and their variants are natural tools adapted to the description of vario...
This dissertation is a theoretical study of finite-state based grammars used in natural language pro...
Chomsky (1955), The Logical Structure of Linguistic Theory (henceforth LSLT), laid out in great deta...
Proceeding volume: 140Sequential Constraint Grammar (SCG) (Karlsson, 1990) and its extensions have l...
A language is considered here as a finite set of symbols (words of the language) together with a set...
Our programme is to use the model of W. Woods 1970 to attempt a full scale analysis of the language....
In this article, we approach finite-state description practices that must be instilled in the develo...
A grammar can be regarded as a device that enumerates the sentences of a language. We study a sequen...
We describe the use of finite state automata for the description of natural languages. We demonstrat...
Contains research objectives and reports on one research project.National Science Foundatio
A finite state language is a finite or infinite set of strings (sentences) of symbols (words) genera...
Proceeding volume: 1A language-independent framework for syntactic finlte-state parsing is discussed...
A language-independent framework for syntactic finlte-state parsing is discussed. The article presen...
Our programme is to use the model of W. Woods 1970 to attempt a full scale analysis of the language....
It has been pointed out that context-free grammars of a certain class have the property that a one-o...
Finite State Automata (FSA) and their variants are natural tools adapted to the description of vario...
This dissertation is a theoretical study of finite-state based grammars used in natural language pro...
Chomsky (1955), The Logical Structure of Linguistic Theory (henceforth LSLT), laid out in great deta...
Proceeding volume: 140Sequential Constraint Grammar (SCG) (Karlsson, 1990) and its extensions have l...
A language is considered here as a finite set of symbols (words of the language) together with a set...
Our programme is to use the model of W. Woods 1970 to attempt a full scale analysis of the language....
In this article, we approach finite-state description practices that must be instilled in the develo...