Đang chuẩn bị liên kết để tải về tài liệu:
Báo cáo khoa học: "A Specification Language for Lexical Functional Grammars"

This paper defines a language Z~ for specifying LFG grammars. This enables constraints on LFG's composite ontology (c-structures synchronised with fstructures) to be stated directly; no appeal to the LFG construction algorithm is needed. We use f to specify schemata annotated rules and the LFG uniqueness, completeness and coherence principles. Broader issues raised by this work are noted and discussed. | A Specification Language for Lexical Functional Grammars Patrick Blackburn and Claire Gardent Computerlinguistik Universitât des Saarlandes Postfach 1150 D-66041 Saarbrucken Germany patrick claire coli.uni-sb.de Abstract This paper defines a language c for specifying LFG grammars. This enables constraints on LFG s composite ontology c-structures synchronised with f-structures to be stated directly no appeal to the LFG construction algorithm is needed. We use c to specify schemata annotated rules and the LFG uniqueness completeness and coherence principles. Broader issues raised by this work are noted and discussed. 1 Introduction Unlike most linguistic theories LFG see Kaplan and Bresnan 1982 treats grammatical relations as first class citizens. Accordingly it casts its linguistic analyses in terms of a composite ontology two independent domains a domain of constituency information c-structure and a domain of grammatical function information f-structure linked together in a mutually constraining manner. As has been amply demonstrated over the last fifteen years this view permits perspicuous analyses of a wide variety of linguistic data. However standard formalisations of LFG do not capture its strikingly simple underlying intuitions. Instead they make a detour via the LFG construction algorithm which explains how equatio-nal constraints linking subtrees and feature structures are to be resolved. The main point of the present paper is to show that such detours are unnecessary. We define a specification language c in which most of the interactions between c-and f-structure typical of LFG grammars can be stated directly. The key idea underlying our approach is to think about LFG model theoretically. That is our first task will be to give a precise and transparent mathematical picture of the LFG ontology. As has already been noted the basic entities underlying the LFG analyses are composite structures consisting of a finite tree a finite feature structure and a .