We present Generalised Reduction (GR), a learning technique for generalising attribute/feature values in typed-unification grammars. GR eliminates as many as possible of the feature constraints (FCs) from the type feature structures (FSs) while applying a criterion of preserving the parsing results on a given, training corpus. For parsing with GR-restricted rule FSs, and for checking the correctness of obtained parses on other corpora, one may use a new form FS unification which we call two-step unication to speed up parsing. We report results on a large-scale HPSG grammar for English
In HPSG the grammar consist of a type hierarchy and a set of principIes. In fact, principIes of the ...
AbstractThis paper studies feature-description languages that have been developed for use in unifica...
This thesis addresses the issue of how Natural Language Processing (nlp) systems using `constraint-b...
Gated attribute grammars and error-tolerant unification expand upon the usual views of attribute gr...
This book develops the theory of typed feature structures, a new form of data structure that general...
Unification- and constraint-based unification formalisms have been used widely to write natural-lang...
LIGHT, the parsing system for typed-unification grammars [3], was recently extended so to allow the ...
This paper describes new default unification, lenient default unification. It works efficiently, and...
In this dissertation, it is shown that declarative, feature-based, unification grammars can be used ...
Abstract. This work is aiming to show that inductive logic programming (ILP) is a suitable tool to l...
Abstract We specialize an efficient while linguistically savvy constraint solving model of grammar i...
An efficient algorithm is described for parsing a dialect of generalised phrase structure grammar (G...
Feature structures are used for the representation of linguistic information in several grammar form...
Many current grammar formalisms used in computational linguistics take a unification-based approach ...
: 110 words Article: 3050 words Keywords: Unification, FUGs, Types, Generation Abstract Function...
In HPSG the grammar consist of a type hierarchy and a set of principIes. In fact, principIes of the ...
AbstractThis paper studies feature-description languages that have been developed for use in unifica...
This thesis addresses the issue of how Natural Language Processing (nlp) systems using `constraint-b...
Gated attribute grammars and error-tolerant unification expand upon the usual views of attribute gr...
This book develops the theory of typed feature structures, a new form of data structure that general...
Unification- and constraint-based unification formalisms have been used widely to write natural-lang...
LIGHT, the parsing system for typed-unification grammars [3], was recently extended so to allow the ...
This paper describes new default unification, lenient default unification. It works efficiently, and...
In this dissertation, it is shown that declarative, feature-based, unification grammars can be used ...
Abstract. This work is aiming to show that inductive logic programming (ILP) is a suitable tool to l...
Abstract We specialize an efficient while linguistically savvy constraint solving model of grammar i...
An efficient algorithm is described for parsing a dialect of generalised phrase structure grammar (G...
Feature structures are used for the representation of linguistic information in several grammar form...
Many current grammar formalisms used in computational linguistics take a unification-based approach ...
: 110 words Article: 3050 words Keywords: Unification, FUGs, Types, Generation Abstract Function...
In HPSG the grammar consist of a type hierarchy and a set of principIes. In fact, principIes of the ...
AbstractThis paper studies feature-description languages that have been developed for use in unifica...
This thesis addresses the issue of how Natural Language Processing (nlp) systems using `constraint-b...