TAILIEUCHUNG - 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 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 .

• Báo cáo khoa học
• A Specification Language
• Lexical Functional Grammars
• Long Papers
• scientific reports
• model language
• process natural language
• C++ CLI Language Specification
• Ecma International Rue
• ECMA 372
• CLI Language Specification
• Ecma International
• Formal Specification
• Mathematical specification
• Programming languages
• Z specification language
• Finite state machine
• State transition diagram
• # C Language Specification
• Visual Studio
• # C Language
• Microsoft Developer Network
• Formal specification of agent behaviour
• Environment scenarios
• A Formal Specification Language of Agent Behaviour
• Agents as Encapsulations of Behaviour
• Classes of Agents as Birds of a Feather
• Scenarios as Patterns of Behaviours
• programming book
• overloading
• lexical analysis
• C language
• programming language
• language specification
• Lyle Luppes
• Daniel Jebaraj
• C++
• Standard ECMA 334
• C# Language Specification
• 4th Edition
• JavaServer Pages
• scripting language
• HTML documents
• JavaBeans
• scripting HTML
• Software testing
• Specification
• Measuring language usage
• Methodologies
• Algorithmic complexity
• basic java
• programming languages​​
• programming documentation
• programming methods
• programming theory
• network programming
• java application
• Functional requirement
• System test case generation
• Specify software functional requirements
• Language USL
• Automatic test case generation
• Functional testing
• System testing
• Testing based on use case
• Specification language UCML
• Luận văn Thạc sĩ
• Nghiên cứu ngôn ngữ
• Công nghệ phần mềm
• Kỹ thuật phần mềm
• Functional Requirement Specification Language