Proceedings on Third international conference on logic programming
Information-based syntax and semantics: Vol. 1: fundamentals
Information-based syntax and semantics: Vol. 1: fundamentals
Inheritance and constraint-based grammar formalisms
Computational Linguistics - Special issue on inheritance: I
CLG: A Grammar Formalism Based on Constraint Reslution
EPIA 89 Proceedings of the 4th Portuguese Conference on Artificial Intelligence
CLG(n): constraint logic grammars
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
The generalized LR parser/compiler V8-4: a software package for practical NL projects
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 1
Unification-based multimodal parsing
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Deixis and conjunction in multimodal systems
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
| Hi-index | 0.00 |
Motivation for including relational constraints other than equality within grammatical formalisms has come from discontinuous constituency and partially free word order for natural languages as well as from the need to define combinatory operations at the most basic level for languages with a two-dimensional syntax (e.g., mathematical notation, chemical equations, and various diagramming languages). This paper presents F-PATR, a generalization of the PATR-II unification-based formalism, which incorporates relational constraints expressed as user-defined functions. An operational semantics is given for unification that is an adaptation and extension of the approach taken by Ait-Kaci and Nasr (1989). It is designed particularly for unification-based formalisms implemented in functional programming environments such as Lisp. The application of unification in a chart parser for relational set languages is discussed briefly.