Grammar Development with LFG and XLE. Miriam Butt University of Konstanz

Similar documents
Grammar Development with LFG and XLE. Miriam Butt University of Konstanz

Introduction to Lexical Functional Grammar. Wellformedness conditions on f- structures. Constraints on f-structures

Grammar Knowledge Transfer for Building RMRSs over Dependency Parses in Bulgarian

Unification in Unification-based Grammar

Lexical entries & clauses

The uniform treatment of constraints, coherency and completeness in a Lexical Functional Grammar compiler

Goals of the talk: of linking theory into the projection architecture of Integration LFG Choice of correct linkings by preference rankings 2

AUTOMATIC LFG GENERATION

Computational Linguistics: Feature Agreement

Clausal Architecture and Verb Movement

Context-Free Grammars

LING 510, Lab 3 September 23, 2013

Context-Free Grammars. Carl Pollard Ohio State University. Linguistics 680 Formal Foundations Tuesday, November 10, 2009

Computational Linguistics (INF2820 TFSs)

Einführung in die Computerlinguistik

Wh-questions. Ling 567 May 9, 2017

Elementary Operations, Clausal Architecture, and Verb Movement

Context-Free Grammars

Computational Linguistics (INF2820 TFSs)

Lesson 3: Solving for Unknown Angles using Equations

The Verb. From Probabilities to Internal Categories. Cem Bozşahin. Cognitive Science Department, The Informatics Institute, ODTÜ

1 Informal Motivation

11-682: Introduction to IR, NLP, MT and Speech. Parsing with Unification Grammars. Reading: Jurafsky and Martin, Speech and Language Processing

1 Introduction. 2 Set-Theory Formalisms. Formal Semantics -W2: Limitations of a Set-Theoretic Model SWU LI713 Meagan Louie August 2015

Knowledge Engineering for NLP May 1, 2005 Clausal semantics

A Lattice Based Algebraic Model for Verb Centered Constructions

FLE Preliminary Results

exlepse Eclipse XLE Plugin

synsem local cat head head-dtr... head 1 dtrs hd-str headed-phrase

User-Defined Nonmonotonicity in Unification-Based Formalisms

L322 Syntax. Chapter 3: Structural Relations. Linguistics 322 D E F G H. Another representation is in the form of labelled brackets:

Proseminar on Semantic Theory Fall 2013 Ling 720 An Algebraic Perspective on the Syntax of First Order Logic (Without Quantification) 1

Towards a basic DCG for English: X-bar Theory. A DCG for English using gap threading for unbounded dependencies. Verb phrases and sentences

Overview and Future Promise of Battle Management Language

More Theories, Formal semantics

Optional Arguments in Abstract Categorial Grammar

A simple syntax-directed

A Minimal GB Parser. Marwan Shaban. October 26, Boston University

COP 3402 Systems Software Syntax Analysis (Parser)

1. He considers himself to be a genius. 2. He considered dieting to be unnecessary. 3. She considered that the waffle iron was broken. 4.

fragments covered in earlier work more than 1,000,000 words in over 49,000 sentences so this newer work is an attempt to demonstrate that sets of f-st

A Method for. Disjunctive Constraint Satisfaction. Xerox Palo Alto Research Center

Computational Linguistics

A partial and impartial view on partitives

Algorithms for AI and NLP (INF4820 TFSs)

Statistical Parsing for Text Mining from Scientific Articles

Theory and Compiling COMP360

The MetaGrammar Compiler: An NLP Application with a Multi-paradigm Architecture

Dependency grammar and dependency parsing

Application of recursion. Grammars and Parsing. Recursive grammar. Grammars

A logic-based grammar formalism incorporating feature-structures and inheritance

Syntax Analysis, VII One more LR(1) example, plus some more stuff. Comp 412 COMP 412 FALL Chapter 3 in EaC2e. target code.

Ling/CSE 472: Introduction to Computational Linguistics. 5/9/17 Feature structures and unification

Dependency Grammar as Graph Description

CMSC 201 Fall 2016 Lab 09 Advanced Debugging

Getting Started With Syntax October 15, 2015

Argument Structures and Semantic Roles: Actual State in ISO TC37/SC4 TDG 3

Ling 571: Deep Processing for Natural Language Processing

6.037 Lecture 7B. Scheme Variants Normal Order Lazy Evaluation Streams

Homework & NLTK. CS 181: Natural Language Processing Lecture 9: Context Free Grammars. Motivation. Formal Def of CFG. Uses of CFG.

Ontology-guided Extraction of Complex Nested Relationships

The Application of Constraint Rules to Data-driven Parsing

Compilers - Chapter 2: An introduction to syntax analysis (and a complete toy compiler)

Unit 4 Voice. Answer Key. Objectives

Subtraction Understand Subtraction on a Number Line Using a number line let s demonstrate the subtraction process using the problem 7 5.

A high-level approach to language description

6.1 Basics of functional type theory, semantics of serial verbs via function composition.

Ling/CSE 472: Introduction to Computational Linguistics. 5/21/12 Unification, parsing with unification Meaning representation

Defining Program Syntax. Chapter Two Modern Programming Languages, 2nd ed. 1

MINIMALIST INQUIRIES AND DERIVATION BY PHASE MAIN POINTS

Lecture 5: Declarative Programming. The Declarative Kernel Language Machine. September 12th, 2011

Ling/CSE 472: Introduction to Computational Linguistics. 4/6/15: Morphology & FST 2

The CKY algorithm part 2: Probabilistic parsing

A Principle Compiler for Extensible Dependency Grammar

1 Ellipsis resolution as a semantic relation between source and target. Dalrymple et al. (1991), Shieber et al. (1996): The equational analysis

Indexing Methods for Efficient Parsing with Typed Feature Structure Grammars

Linguistics and Philosophy 23: , Is Compositionality Formally Vacuous? Francis Jeffry Pelletier

Introduction to Semantics. Expanding Our Formalism, Part 2 1

Compiler I: Sytnax Analysis

Theory of Computation - Module 1

LING 253: SYNTAX I SECTION. (Specifier Rule) (Adjunct Rule) (Complement Rule)

Computer Project #2 (Matrix Operations)

2 Agreement, inflection, and the auxiliary system

Lexical vs. Dynamic Scope

4.2 Variations on a Scheme -- Lazy Evaluation

Prolog-embedding typed feature structure grammar and grammar tool. Version 4.

XML. extensible Markup Language. ... and its usefulness for linguists

Topic 3: Syntax Analysis I

Tree Macros. Emma Pease November 4, 2005

Only the original curriculum in Danish language has legal validity in matters of discrepancy

Related Course Objec6ves

Dependency grammar and dependency parsing

Delimited Continuations, Applicative Functors and Natural Language Semantics

Specifying Syntax COMP360

Logic and Natural Language Semantics: Formal Semantics

A Brief Incomplete Introduction to NLTK

RAISE in Perspective

Dependency grammar and dependency parsing

STRUCTURES AND STRATEGIES FOR STATE SPACE SEARCH

Abstract Syntax and Universal Dependencies

Transcription:

Grammar Development with LFG and XLE Miriam Butt University of Konstanz

Last Time Integration of a Finite-State Morphological Analyzer - Sublexical Rules - Sublexical Entries - The -unknown entry The XLE Lexicon Lookup Model

This Time: Lesson 8 1. Verbal Complements: COMP and XCOMP Finite Complements (COMP) Non-finite Complements (XCOMP) Control Verbs Theory of Control and Complementation 2. Regression Testing (Testsuites) and Debugging

Types of Arguments! So far we have been working with the following grammatical functions (GFs): SUBJ, OBJ, OBJ2, OBL! But there are also GFs corresponding to clausal arguments: XCOMP, COMP! COMP is generally used for finite that-clauses! XCOMP is generally used for non-finite embedded clauses.

Types of Arguments! You can read up on grammatical functions in LFG and how to test for them in the Dalrymple book, Ch. 2.

Complements: COMP! Some verbs require finite clausal arguments: think: Kim thinks [that the gorilla ate the bananas]. say: Kim said [that the gorilla ate the bananas]. believe: Kim believes [that the gorilla eats cake]....! These arguments are treated as COMP in LFG at f-structure and as a CP at c-structure.! Note that they are recursive Kim thinks that Sandy said that the gorilla ate the bananas. Kim thinks that Sandy said that the dog believes that the gorilla ate the bananas.

A (simplified) f-str with COMP PRED SUBJ 'believe<(^subj),(^comp)>' PRED 'Kim' NUM sg, PERS 3, CASE nom COMP PRED 'eat<(^subj),(^obj)>' SUBJ OBJ PRED 'Kim' NUM sg, PERS 3, CASE nom PRED 'cake' NUM sg, PERS 3, CASE acc

Complements: XCOMP! Some verbs require non-finite clausal arguments: persuade: Kim persuaded the gorilla [to eat cake]. promise: Kim promised the gorilla [to eat cake]. want: Kim wanted [to eat cake.] want: Kim wanted the gorilla [to eat cake.]! These arguments are treated as XCOMP in LFG at f-structure and generally as a VP at c-structure.

Complements: XCOMP! Note that they are recursive as well Kim wanted to persuade Sandy to eat cake. Kim wanted to persuade Sandy to promise the gorilla to eat cake....! They also interact with the COMPs Kim thinks that Sandy wants to persuade Peter to believe that the gorilla ate cake. Kim promised Sandy to believe that Peter persuaded the gorilla to eat cake....

XCOMP: Functional Control! The non-finite clauses are called XCOMPs in LFG because the embedded clause contains a open SUBJ argument that is controlled by an argument in the matrix clause.! Which argument controls the embedded SUBJ is lexically determined.! Who is doing the eating? Sandy Kim persuaded Sandy [ to eat cake].! Who is doing the eating? Kim Kim promised Sandy [ to eat cake].

Open Functions! XCOMP is considered to be an open GF because one of its arguments is not specified within the clause.! XADJUNCT is its adjunct counterpart. [ Having eaten the cake], Kim ordered some tea.! The subject of the embedded non-finite adjunct is controlled by an entity outside of the clause.

XCOMP: Functional Control! Each control verb needs to specify in the lexicon whether it is a subject or an object control verb (want does both).! Object control verb: persuade Kim persuaded Sandy [ to eat cake].! Subject control verb: promise Kim promised Sandy [ to eat cake].

A (simplified) f-str with XCOMP OBJ control PRED SUBJ OBJ 'persuade<(^subj)(^ OBJ)(^XCOMP)>' PRED 'Kim' NUM sg, PERS 3, CASE nom PRED 'Sandy' NUM sg, PERS 3, CASE acc XCOMP PRED 'eat<(^subj),(^obj)>' SUBJ OBJ PRED 'cake' NUM sg, PERS 3, CASE acc

A (simplified) f-str with XCOMP SUBJ control PRED SUBJ OBJ 'promise<(^subj)(^ OBJ)(^XCOMP)>' PRED 'Kim' NUM sg, PERS 3, CASE nom PRED 'Sandy' NUM sg, PERS 3, CASE acc XCOMP PRED 'eat<(^subj),(^obj)>' SUBJ OBJ PRED 'cake' NUM sg, PERS 3, CASE acc

XCOMP: Functional Control! The lexical specification is done by means of a control equation.! Object control verb: persuade (^ XCOMP SUBJ) = (^ OBJ) Kim persuaded Sandy [ to eat cake].! Subject control verb: promise (^ XCOMP SUBJ) = (^ SUBJ) Kim promised Sandy [ to eat cake]

Control and Complementation! The basic theoretical concepts for understanding control and complementation in LFG were worked out in the early 1980s.! Classic article: Bresnan, Joan. 1982. Control and Complementation. In The Mental Representation of Grammatical Relations. The MIT Press. Reprinted in: Bresnan, Joan. 1982. Control and Complementation. Linguistic Inquiry 11(3):343-434.

Demo grammar7.lfg testsuite7.lfg Grammar Engineering: Testsuites and Debugging (morphological analyzer) COMP and XCOMP

Practical Work! This concludes Lesson 8.! The practical work you should do now is detailed in Exercise 8.! You will practice with integrating verbal complements (COMP, XCOMP) writing entries for control verbs learn about raising verbs