Lexical Functional Grammar 11-722: Grammar Formalisms Spring Term 2004.

Slides:



Advertisements
Similar presentations
Unification example: a grammar Rule {Satz} S -> NP VP (PP): = =. ;Kongruenz zwischen Subjekt und finitem Verb Rule{NP} NP -> Name / Pron / Det (AP) N (PP):
Advertisements

Word list entry: (spiser (V spise Pres)) Stem list entry: (spise (V Transitive (sense eat'))) Template list entries: (V ((sense) (trans relation))) (Pres((syntax.
          What is the functional domain of this node?
 Christel Kemke 2007/08 COMP 4060 Natural Language Processing Feature Structures and Unification.
Feature Structures and Parsing Unification Grammars Algorithms for NLP 18 November 2014.
1 Unification Grammars Allen ’ s Chapter 4 J&M ’ s Chapter 11.
Lexical Functional Grammar History: –Joan Bresnan (linguist, MIT and Stanford) –Ron Kaplan (computational psycholinguist, Xerox PARC) –Around 1978.
1 Natural Language Processing Lecture 7 Unification Grammars Reading: James Allen NLU (Chapter 4)
NP Movement Passives, Raising: When NPs are not in their theta positions.
Sub-constituents of NP in English September 12, 2007.
Introduction to LFG Kersti Börjars & Nigel Vincent {k.borjars, University of Manchester Winter school in LFG July University.
Grammar Engineering: Set-valued Attributes Various Kinds of Constraints Case Restrictions on Arguments Miriam Butt (University of Konstanz) and Martin.
Grammatical Relations and Lexical Functional Grammar Grammar Formalisms Spring Term 2004.
Subject complements - a noun, pronoun, or an adjective that completes the meaning of a linking verb - there are two types: predicate adjective and predicate.
Statistical NLP: Lecture 3
LFG Slides based on slides by: Kersti Börjars & Nigel Vincent {k.borjars, University of Manchester Winter school in LFG July
1 Auxiliary Verbs and Movement Phenomena Allen ’ s Chapter 5 J&M ’ s Chapter 11.
Syllabus Text Books Classes Reading Material Assignments Grades Links Forum Text Books עיבוד שפות טבעיות - שיעור עשר Chart Parsing (cont) Features.
Issues in Computational Linguistics: Parsing and Generation Dick Crouch and Tracy King.
Features and Unification
1 Kakia Chatsiou Department of Language and Linguistics University of Essex XLE Tutorial & Demo LG517. Introduction to LFG Introduction.
September 19, : Grammars and Lexicons Lori Levin.
CS 4705 Lecture 11 Feature Structures and Unification Parsing.
Stochastic POS tagging Stochastic taggers choose tags that result in the highest probability: P(word | tag) * P(tag | previous n tags) Stochastic taggers.
Features and Unification Read J & M Chapter 11.. Solving the Agreement Problem Number agreement: S  NP VP * Mary walk. [NP NUMBER] [VP NUMBER] NP  det.
Context-Free Parsing Part 2 Features and Unification.
Chapter 2 A rapid overview.
Predicate Nominatives. A predicate nominative is a noun (naming word) or a pronoun (a word used in place of a noun) that is the same as the subject of.
Embedded Clauses in TAG
Feature structures and unification Attributes and values.
1 Semantics Interpretation Allen ’ s Chapter 9 J&M ’ s Chapter 15.
1 Features and Unification Chapter 15 October 2012 Lecture #10.
Chapter 4 Syntax Part II.
Chapter 16: Features and Unification Heshaam Faili University of Tehran.
October 15, 2007 Non-finite clauses and control : Grammars and Lexicons Lori Levin.
2007CLINT-LIN-FEATSTR1 Computational Linguistics for Linguists Feature Structures.
Grammar Engineering: Coordination and Macros METARULEMACRO Interfacing finite-state morphology Miriam Butt (University of Konstanz) and Martin Forst (NetBase.
Relative Clauses Ed McCorduck English 402--Grammar SUNY Cortland
Semantic Construction lecture 2. Semantic Construction Is there a systematic way of constructing semantic representation from a sentence of English? This.
What you have learned and how you can use it : Grammars and Lexicons Parts I-III.
CPE 480 Natural Language Processing Lecture 4: Syntax Adapted from Owen Rambow’s slides for CSc Fall 2006.
Rules, Movement, Ambiguity
Section 11.3 Features structures in the Grammar ─ Jin Wang.
The Passive Voice Ed McCorduck English 402--Grammar SUNY Cortland
October 25, : Grammars and Lexicons Lori Levin.
WORDS The term word is much more difficult to define in a technical sense, and like many other linguistic terms, there are often arguments about what exactly.
 Chapter 8 (Part 2) Transformations Transformational Grammar Engl 424 Hayfa Alhomaid.
1 Natural Language Processing Lectures 8-9 Auxiliary Verbs Movement Phenomena Reading: James Allen NLU (Chapter 5)
LING 6520: Comparative Topics in Linguistics (from a computational perspective) Martha Palmer Jan 15,
ACTL 2008 Syntax: Introduction to LFG Peter Austin, Linguistics Department, SOAS with thanks to Kersti Börjars & Nigel Vincent.
◦ Process of describing the structure of phrases and sentences Chapter 8 - Phrases and sentences: grammar1.
GRAMMAR REVIEW Direct Objects Indirect Objects Predicate Adjective
Linguistics 187 Week 3 Coordination and Functional Uncertainty.
1.[ S I forced him [ S PRO to be kind]] Phrase structure analyses in traditional transformational grammar:
Lexical-Functional Grammar A Formal System for Grammatical Representation Kaplan and Bresnan, 1982 Erin Fitzgerald NLP Reading Group October 18, 2006.
September 26, : Grammars and Lexicons Lori Levin.
Chapter 11: Parsing with Unification Grammars Heshaam Faili University of Tehran.
Natural Language Processing Vasile Rus
Syntax and parsing Introduction to Computational Linguistics – 28 March 2017.
Embedded Clauses in TAG
Lecture – VIII Monojit Choudhury RS, CSE, IIT Kharagpur
Statistical NLP: Lecture 3
Lexical Functional Grammar
Behavioral Properties of Subjects: matrix coding as subject
TREE ADJOINING GRAMMAR
BBI 3212 ENGLISH SYNTAX AND MORPHOLOGY
Relative Clauses Ed McCorduck English 402--Grammar SUNY Cortland
CPSC 503 Computational Linguistics
Principles and Parameters (I)
Structure of a Lexicon Debasri Chakrabarti 13-May-19.
Presentation transcript:

Lexical Functional Grammar : Grammar Formalisms Spring Term 2004

Lions seem to live in the forest DET N P NP V PP COMP VP N V VP-bar NP VP S SUBJ PRED ‘lion’ NUM pl PERS 3 PRED ‘seem SUBJ’ XCOMP TENSE pres VFORM fin XCOMP SUBJ [ ] VFORM INF PRED ‘live ’ SUBJ OBL-loc OBJ OBL -loc CASE OBL-loc PRED ‘in ’ OBJ PRED ‘forest’ NUM sg PERS 3 DEF +

Lions seem to live in the forest DET N P NP V PP COMP VP N V VP-bar NP VP S SUBJ PRED ‘lion’ NUM pl PERS 3 PRED ‘seem SUBJ’ XCOMP TENSE pres VFORM fin XCOMP SUBJ [ ] VFORM INF PRED ‘live ’ SUBJ OBL-loc OBJ OBL -loc CASE OBL-loc PRED ‘in ’ OBJ PRED ‘forest’ NUM sg PERS 3 DEF + f1 f3 f2 f4 f5 f6 n7 n6 n5 n4 n3 n2 n1 n10 n9 n8 n11 n13 n12 n14

Lions seem to live in the forest DET N P NP V PP COMP VP N V VP-bar NP VP S SUBJ PRED ‘lion’ NUM pl PERS 3 PRED ‘seem SUBJ’ XCOMP TENSE pres VFORM fin XCOMP SUBJ [ ] VFORM INF PRED ‘live ’ SUBJ OBL-loc OBJ OBL -loc CASE OBL-loc PRED ‘in ’ OBJ PRED ‘forest’ NUM sg PERS 3 DEF + f1 f3 f2 f4 f5 f6 n7 n6 n5 n4 n3 n2 n1 n10 n9 n8 n11 n13 n12 n14

Properties of the mapping from c- structure to f-structure Each c-structure node maps onto at most one f-structure node. More than one c-structure node can map onto the same f-structure node. An f-structure node does not have to correspond to any c-structure node. (But the information it contains does come from somewhere – either a grammar rule or lexical entry.)

Φ is a mapping from c-structure nodes to f- structure nodes. –There are other mappings to semantic structures, argument structures, discourse structures,etc. * is the “current” c-structure node (me). Φ(*) is “my f-structure” (  ) m(*) is “my c-structure mother” Φ(m(*)) is “my c-structure mother’s f-structure” (  ) The formalism for grammatical encoding : Local co-description of partial structures

Local co-description of partial structures S  NP VP (  SUBJ) =   =  NP says: My mother’s f-structure has a SUBJ feature whose value is my f-structure. VP says: My mother’s f-structure is my f-structure. This rule simultaneously describes a piece of c- structure and a piece of f-structure. It is local because each equation refers only to the current node and its mother. (page )

Other types of equations F-structure composition –(  SUBJ NUM) = sg –My f-structure has a subj feature, whose value is another f-structure, which has a num feature, whose value is sg. –Usually, path names are not longer than two. Two features pointing to the same value: –(  SUBJ) = (  XCOMP SUBJ) –(  SUBJ) = (  TOPIC) (  (  CASE)) =  (Dalrymple pages ) –Sam walked in the park. –(  CASE) = OBL-loc –(  OBL-loc) = 

The minimal solution The f-structure for a sentence is the minimal f-structure that satisfies all of the equations. (page 101).

Building an F-structure: informal, for linguists Annotate –Assign a variable name to the f-structure corresponding to each c-structure node. –May find out later that some of them are the same. Instantiate –Replace the arrows with the variable names. Solve –Locate the f-structure named on the left side of the equation. –Locate the f-structure named on the right side of the equation –Unify them. –Replace both of them with the result of unification.

Lions seem to live in the forest DET N P NP V PP COMP VP N V VP-bar NP f2 VP f3 S f1 SUBJ PRED ‘lion’ NUM pl PERS 3 PRED ‘seem SUBJ’ XCOMP TENSE pres VFORM fin XCOMP SUBJ [ ] VFORM INF PRED ‘live ’ SUBJ OBL-loc OBJ OBL -loc CASE OBL-loc PRED ‘in ’ OBJ PRED ‘forest’ NUM sg PERS 3 DEF + Rule: S → NP VP (↑ SUBJ) = ↓ ↑=↓ (↑VFORM) = fin Instantiated equations: (f1 SUBJ) = f2 f1 = f3 f1 f2 f3

Equivalent to drawing f-structures on nodes as in TAG S [1] [ VFORM fin ] NP VP [1] [ SUBJ [2] ] [1]

Lions seem to live in the forest DET N P NP V PP COMP VP f4 N f5 V VP-bar NP VP S SUBJ PRED ‘lion’ NUM pl PERS 3 PRED ‘seem SUBJ’ XCOMP TENSE pres VFORM fin XCOMP SUBJ [ ] VFORM INF PRED ‘live ’ SUBJ OBL-loc OBJ OBL -loc CASE OBL-loc PRED ‘in ’ OBJ PRED ‘forest’ NUM sg PERS 3 DEF + lion: N seem: V (↑ PRED) = `lion’ (↑ PRED) = ‘seem SUBJ’ XCOMP (↑ SUBJ) = (↑ XCOMP SUBJ) -s (suffix for nouns) (↑ NUM) = pl - Ø (suffix for verbs) (↑ PERS) = 3 (↑ VFORM) = fin (↑ SUBJ NUM) = pl f5 f4

Lions seem to live in the forest DET N P NP V PP COMP VP f4 N f5 V VP-bar NP VP S SUBJ PRED ‘lion’ NUM pl PERS 3 PRED ‘seem SUBJ’ XCOMP TENSE pres VFORM fin XCOMP SUBJ [ ] VFORM INF PRED ‘live ’ SUBJ OBL-loc OBJ OBL -loc CASE OBL-loc PRED ‘in ’ OBJ PRED ‘forest’ NUM sg PERS 3 DEF + lion: N seem: V (f4 PRED) = `lion’ (f5 PRED) = ‘seem SUBJ’ XCOMP (f5 SUBJ) = (f5 XCOMP SUBJ) -s (suffix for nouns) (f4 NUM) = pl - Ø (suffix for verbs) (f4 PERS) = 3 (f5 VFORM) = fin (f5 SUBJ NUM) = pl f5 f4

What is an XCOMP A non-finite clause, predicate nominal, predicate adjective, or predicate PP –Sam seemed to be happy (VP) –Sam seemed happy (AP) –Sam became a teacher (NP) –We had them arrested (VP) –We kept them in the drawer (PP) Has to be an argument of a verb: –Arrested by the police, Sam had no alternative but to give up his life of crime. This is an adjunct, not an XCOMP Gets its subject by sharing with another verb: –I think that Sam is happy. This is a COMP, not an XCOMP

Lions seem to live in the forest DET N P NP f7V PP f6COMP VP f9 N f5 V f8 VP-bar NP VP f3 S SUBJ PRED ‘lion’ NUM pl PERS 3 PRED ‘seem SUBJ’ XCOMP TENSE pres VFORM fin XCOMP SUBJ [ ] VFORM INF PRED ‘live ’ SUBJ OBL-loc OBJ OBL -loc CASE OBL-loc PRED ‘in ’ OBJ PRED ‘forest’ NUM sg PERS 3 DEF + seem: V (↑ PRED) = ‘seem SUBJ’ XCOMP ( ↑ SUBJ) = ( ↑ XCOMP SUBJ) ( ↑ XCOMP VFORM) = INF - Ø (suffix for verbs) ( ↑ VFORM) = fin ( ↑ SUBJ NUM) = pl to: COMP - Ø (suffix for verbs) ( ↑ VFORM) = INF live: V ( ↑ PRED) = `live ’ SUBJ OBL VP → V VP ↑=↓ (↑ XCOMP) = ↓ f3 f5 f9 f8 f7 f6

Lions seem to live in the forest DET N P NP f7V PP f6COMP VP f9 N f5 V f8 VP-bar NP VP f3 S SUBJ PRED ‘lion’ NUM pl PERS 3 PRED ‘seem SUBJ’ XCOMP TENSE pres VFORM fin XCOMP SUBJ [ ] VFORM INF PRED ‘live ’ SUBJ OBL-loc OBJ OBL -loc CASE OBL-loc PRED ‘in ’ OBJ PRED ‘forest’ NUM sg PERS 3 DEF + seem: V (f5 PRED) = ‘seem SUBJ’ XCOMP (f5 SUBJ) = (f5 XCOMP SUBJ) (f5 XCOMP VFORM) = INF - Ø (suffix for verbs) (f5 VFORM) = fin (f5 SUBJ NUM) = pl to: COMP - Ø (suffix for verbs) (f6 VFORM) = INF (f7 VFORM) = INF live: V (f7 PRED) = `live ’ SUBJ OBL VP → V VP f3=f5 (f3 XCOMP) = f8 f3 f5 f9 f8 f7 f6

Lions try to live in the forest DET N P NP V PP COMP VP N V VP-bar NP VP S SUBJ PRED ‘lion’ NUM pl PERS 3 PRED ‘try ’ SUBJ XCOMP TENSE pres VFORM fin XCOMP SUBJ [ ] VFORM INF PRED ‘live ’ SUBJ OBL-loc OBJ OBL -loc CASE OBL-loc PRED ‘in ’ OBJ PRED ‘forest’ NUM sg PERS 3 DEF +

Lions have lived in the forest DET N P NP V PP VP N V NP VP S SUBJ PRED ‘lion’ NUM pl PERS 3 PRED ‘have SUBJ’ XCOMP TENSE pres VFORM fin XCOMP SUBJ [ ] VFORM PASTPART PRED ‘live ’ SUBJ OBL-loc OBJ OBL -loc CASE OBL-loc PRED ‘in ’ OBJ PRED ‘forest’ NUM sg PERS 3 DEF + have: V (↑ PRED) = ‘have SUBJ’ XCOMP ( ↑ SUBJ) = ( ↑ XCOMP SUBJ) ( ↑ XCOMP VFORM) = PASTPART - Ø (suffix for verbs) ( ↑ VFORM) = fin ( ↑ SUBJ NUM) = pl

Lions were hunted in the forest DET N P NP V PP VP N V NP VP S SUBJ PRED ‘lion’ NUM pl PERS 3 PRED ‘be SUBJ’ XCOMP TENSE pres VFORM fin XCOMP SUBJ [ ] VFORM PASSIVE PRED ‘hunt ’ Ø SUBJ OBL-loc OBJ OBL -loc CASE OBL-loc PRED ‘in ’ OBJ PRED ‘forest’ NUM sg PERS 3 DEF + were : V (↑ PRED) = ‘be SUBJ’ XCOMP ( ↑ SUBJ) = ( ↑ XCOMP SUBJ) ( ↑ XCOMP VFORM) = PASSIVE ( ↑ VFORM) = fin ( ↑ SUBJ NUM) = pl