Login: A logic programming language with built-in inheritance
Journal of Logic Programming
An algebraic semantics approach to the effective resolution of type equations
Theoretical Computer Science
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Information-based syntax and semantics: Vol. 1: fundamentals
Information-based syntax and semantics: Vol. 1: fundamentals
The logic of typed feature structures
The logic of typed feature structures
Feature-constraint logics for unification grammars
Journal of Logic Programming
Inheritance and constraint-based grammar formalisms
Computational Linguistics - Special issue on inheritance: I
An introduction to LIFE-programming with logic, inheritance, functions, and equations
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
Order-sorted feature theory unification
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
A logical version of functional grammar
ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Strategies for adding control information to declarative grammars
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
TDL: a type description language for constraint-based grammars
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
DISCO: an HPSG-based NLP system and its application for appointment scheduling
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
A compact architecture for dialogue management based on scripts and meta-outputs
ANLC '00 Proceedings of the sixth conference on Applied natural language processing
Modularizing codescriptive grammars for efficient parsing
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
| Hi-index | 0.00 |
Over the last few years, constraint-based grammar formalisms have become the predominant paradigm in natural language processing and computational linguistics From the viewpoint of computer science typed feature structures can be seen as data structures that allow the representation of linguistic knowledge in a uniform fashion Type expansion is an operation that makes constraints of a typed feature structure explicit and determines its satisfiability We describe an efficient expansion algorithm that takes care of recursive type definitions and permits the exploration of different expansion strategies through the use of control knowledge. This knowledge is specified on a separate layer independent of grammatical information. The algorithm as presented in the paper, has been full implemented in COMMON LISP and is an integrated part of the typed feature formalism TDC that is employed in several large NL projects.