Abstract
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.
Cite
CITATION STYLE
Rounds, W. C., & Manaster-Ramer, A. (1987). A logical version of functional grammar. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (Vol. 1987-July, pp. 89–96). Association for Computational Linguistics (ACL). https://doi.org/10.3115/981175.981188
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
