LFP: a logic for linguistic descriptions and an analysis of its complexity
Computational Linguistics
Parsing a free-word order language: warlpiri
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
A logical semantics for feature structures
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
Unification: a multidisciplinary survey
ACM Computing Surveys (CSUR)
Using descriptions of trees in a tree adjoining grammar
Computational Linguistics
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Review of "The logic of typed feature structures" by Bob Carpenter. Cambridge University Press 1992.
Computational Linguistics
Computing with features as formulae
Computational Linguistics
Recycling terms into a partial parser
ANLC '94 Proceedings of the fourth conference on Applied natural language processing
A logical approach to Arabic phonology
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
A unification-based parser for relational grammar
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
An experimental parser for systemic grammars
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Data types in computational phonology
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Efficient parameterizable type expansion for typed feature formalisms
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
| Hi-index | 0.00 |
Kay's functional-unification grammar notation [5] is a way of expressing grammars which relies on very few primitive notions. The primary syntactic structure is the feature structure, which can be visualised as a directed graph with arcs labeled by attributes of a constituent, and the primary structure-building operation is unification. In this paper we propose a mathematical formulation of FUG, using logic to give a precise account of the strings and the structures defined by any grammar written in this notation.