AbstractAn algorithm that inverses a unification parser written in PROLOG into a generator for natural language is presented. Some aspects of applicability of the algorithm are discussed
AbstractA simple, novel, and efficient computational model for a graph unification method for NL par...
This paper describes new and improved techniques which help a unification-based parser to process in...
Unification grammars (UG) are a grammatical formalism that underlies several contemporary lin-guisti...
AbstractAn algorithm that inverses a unification parser written in PROLOG into a generator for natur...
The use of a single grammar in natural anguage pars-ing and generation is most desirable for variety...
In this dissertation, it is shown that declarative, feature-based, unification grammars can be used ...
We provide simple conditions which allow us to conclude that in case of several well-known Prolog pr...
In this paper, we present an efficient algorithm for parsing natural language using unification gram...
The unification problem and several variants are presented. Various algorithms and data structures a...
Parsing natural language is an attempt to discover some structure in a text (or textual representati...
Typescript (photocopy).Unification, which has applications in databases, expert and knowledge-based ...
AbstractThe deductive approach is a formal program construction method in which the derivation of a ...
Contemporary linguistic formalisms such as LFG or HPSG have become so rigorous that it is now possib...
In this note we present the basic theory of substitutions and a unification algorithm expressed in a...
MACHINE Evgeniy Gabrilovich and Nissim Francez Shuly Wintner Computer Science Department Seminar fu...
AbstractA simple, novel, and efficient computational model for a graph unification method for NL par...
This paper describes new and improved techniques which help a unification-based parser to process in...
Unification grammars (UG) are a grammatical formalism that underlies several contemporary lin-guisti...
AbstractAn algorithm that inverses a unification parser written in PROLOG into a generator for natur...
The use of a single grammar in natural anguage pars-ing and generation is most desirable for variety...
In this dissertation, it is shown that declarative, feature-based, unification grammars can be used ...
We provide simple conditions which allow us to conclude that in case of several well-known Prolog pr...
In this paper, we present an efficient algorithm for parsing natural language using unification gram...
The unification problem and several variants are presented. Various algorithms and data structures a...
Parsing natural language is an attempt to discover some structure in a text (or textual representati...
Typescript (photocopy).Unification, which has applications in databases, expert and knowledge-based ...
AbstractThe deductive approach is a formal program construction method in which the derivation of a ...
Contemporary linguistic formalisms such as LFG or HPSG have become so rigorous that it is now possib...
In this note we present the basic theory of substitutions and a unification algorithm expressed in a...
MACHINE Evgeniy Gabrilovich and Nissim Francez Shuly Wintner Computer Science Department Seminar fu...
AbstractA simple, novel, and efficient computational model for a graph unification method for NL par...
This paper describes new and improved techniques which help a unification-based parser to process in...
Unification grammars (UG) are a grammatical formalism that underlies several contemporary lin-guisti...
DOI
Add to ORKG