Complex indeterminates in Prolog and its application to discourse models
New Generation Computing
Login: A logic programming language with built-in inheritance
Journal of Logic Programming
Natural Language Processing in LISP: An Introduction to Computational Linguistics
Natural Language Processing in LISP: An Introduction to Computational Linguistics
ProFIT: prolog with features, inheritance and templates
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
The design of a computer language for linguistic information
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
A unification method for disjunctive feature descriptions
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Constraint projection: an efficient treatment of disjunctive feature descriptions
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Unification of disjunctive feature descriptions
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Conditioned unification for natural language processing
COLING '86 Proceedings of the 11th coference on Computational linguistics
Feature logic with disjunctive unification
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
| Hi-index | 0.00 |
This paper proposes a method for generating a logical constraint-based internal representation from a unification grammar formalism with disjunctive information. Unification grammar formalisms based on path equations and lists of pairs of labels and values are better than those based on first-order terms in that the former is easier to describe and to understand. Parsing with term-based internal representations is more efficient than parsing with graph-based representations. Therefore, it is effective to translate unification grammar formalism based on path equations and lists of pairs of labels and values into a term-based internal representation. Previous translation methods cannot deal with disjunctive feature descriptions, which reduce redundancies in the grammar and make parsing efficient. Since the proposed method translates a formalism without expanding disjunctions, parsing with the resulting representation is efficient.