Handling Unlike Coordinated Phrases in TAG by Mixing Syntactic Category and Grammatical Function Carlos A. Prolo Faculdade de Informática – PUCRS CELSUL,

Slides:



Advertisements
Similar presentations
Lecture 3a Clause functions Adapted from Mary Laughren.
Advertisements

The Structure of Sentences Asian 401
Syntactic analysis using Context Free Grammars. Analysis of language Morphological analysis – Chairs, Part Of Speech (POS) tagging – The/DT man/NN left/VBD.
Introduction to Syntax Owen Rambow September 30.
Grammatical Relations and Lexical Functional Grammar Grammar Formalisms Spring Term 2004.
Statistical NLP: Lecture 3
GRAMMAR & PARSING (Syntactic Analysis) NLP- WEEK 4.
MORPHOLOGY - morphemes are the building blocks that make up words.
LTAG Semantics on the Derivation Tree Presented by Maria I. Tchalakova.
Sag et al., Chapter 4 Complex Feature Values 10/7/04 Michael Mulyar.
Extracting LTAGs from Treebanks Fei Xia 04/26/07.
LEXICALIZATION AND CATEGORIAL GRAMMARS: ARAVIND K. JOSHI A STORY BAR-HILLEL MIGHT HAVE LIKED UNIVERSITY OF PENNSYLVANIA PHILADELPHIA, PA USA June.
Introduction to Syntax, with Part-of-Speech Tagging Owen Rambow September 17 & 19.
June 7th, 2008TAG+91 Binding Theory in LTAG Lucas Champollion University of Pennsylvania
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Fall 2005-Lecture 2.
1/15 Synchronous Tree-Adjoining Grammars Authors: Stuart M. Shieber and Yves Schabes Reporter: 江欣倩 Professor: 陳嘉平.
Syntax and Context-Free Grammars CMSC 723: Computational Linguistics I ― Session #6 Jimmy Lin The iSchool University of Maryland Wednesday, October 7,
Probabilistic Parsing Ling 571 Fei Xia Week 5: 10/25-10/27/05.
Linguistics II Syntax. Rules of how words go together to form sentences What types of words go together How the presence of some words predetermines others.
SI485i : NLP Set 9 Advanced PCFGs Some slides from Chris Manning.
11 CS 388: Natural Language Processing: Syntactic Parsing Raymond J. Mooney University of Texas at Austin.
LING/C SC/PSYC 438/538 Lecture 19 Sandiway Fong 1.
Context Free Grammars Reading: Chap 12-13, Jurafsky & Martin This slide set was adapted from J. Martin, U. Colorado Instructor: Paul Tarau, based on Rada.
Meeting 3 Syntax Constituency, Trees, and Rules
1 LIN 1310B Introduction to Linguistics Prof: Nikolay Slavkov TA: Qinghua Tang CLASS 14, Feb 27, 2007.
Introduction to English Syntax Level 1 Course Ron Kuzar Department of English Language and Literature University of Haifa Chapter 2 Sentences: From Lexicon.
LING/C SC/PSYC 438/538 Lecture 27 Sandiway Fong. Administrivia 2 nd Reminder – 538 Presentations – Send me your choices if you haven’t already.
Tree-adjoining grammar (TAG) is a grammar formalism defined by Aravind Joshi and introduced in Tree-adjoining grammars are somewhat similar to context-free.
IV. SYNTAX. 1.1 What is syntax? Syntax is the study of how sentences are structured, or in other words, it tries to state what words can be combined with.
GRAMMARS David Kauchak CS159 – Fall 2014 some slides adapted from Ray Mooney.
CS : Language Technology for the Web/Natural Language Processing Pushpak Bhattacharyya CSE Dept., IIT Bombay Constituent Parsing and Algorithms (with.
October 15, 2007 Non-finite clauses and control : Grammars and Lexicons Lori Levin.
A Cascaded Finite-State Parser for German Michael Schiehlen Institut für Maschinelle Sprachverarbeitung Universität Stuttgart
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Fall 2005-Lecture 4.
Linguistic Essentials
CPE 480 Natural Language Processing Lecture 4: Syntax Adapted from Owen Rambow’s slides for CSc Fall 2006.
Rules, Movement, Ambiguity
1 Context Free Grammars October Syntactic Grammaticality Doesn’t depend on Having heard the sentence before The sentence being true –I saw a unicorn.
Linguistic Theory Lecture 5 Filters. The Structure of the Grammar 1960s (Standard Theory) LexiconPhrase Structure Rules Deep Structure Transformations.
Making it stick together…
Lecture Week 5 Basic Constructions of English Sentence.
November 16, 2004 Lexicon (An Interacting Subsystem in UG) Part-II Rajat Kumar Mohanty IIT Bombay.
Supertagging CMSC Natural Language Processing January 31, 2006.
LING 6520: Comparative Topics in Linguistics (from a computational perspective) Martha Palmer Jan 15,
CPSC 422, Lecture 27Slide 1 Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 27 Nov, 16, 2015.
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Spring 2006-Lecture 2.
Natural Language Processing Lecture 14—10/13/2015 Jim Martin.
SYNTAX.
◦ Process of describing the structure of phrases and sentences Chapter 8 - Phrases and sentences: grammar1.
NLP. Introduction to NLP #include int main() { int n, reverse = 0; printf("Enter a number to reverse\n"); scanf("%d",&n); while (n != 0) { reverse =
LING/C SC 581: Advanced Computational Linguistics Lecture Notes Feb 17 th.
Week 3. Clauses and Trees English Syntax. Trees and constituency A sentence has a hierarchical structure Constituents can have constituents of their own.
Week 12. NP movement Text 9.2 & 9.3 English Syntax.
Week 2. Constituents Sentences can be analyzed into subparts which we referred to as constituents English Syntax.
Coping with Problems in Grammars Automatically Extracted from Treebanks Carlos A. Prolo Computer and Info. Science Dept. University of Pennsylvania.
Lecture 2: Categories and Subcategorisation
Beginning Syntax Linda Thomas
English Syntax Week 12. NP movement Text 9.2 & 9.3.
Statistical NLP: Lecture 3
Lecture 4b: Verb Processes
Chapter Eight Syntax.
Part I: Basics and Constituency
LING/C SC/PSYC 438/538 Lecture 21 Sandiway Fong.
TREE ADJOINING GRAMMAR
LING/C SC 581: Advanced Computational Linguistics
Chapter Eight Syntax.
LING/C SC/PSYC 438/538 Lecture 24 Sandiway Fong.
Linguistic Essentials
Structure of a Lexicon Debasri Chakrabarti 13-May-19.
Presentation transcript:

Handling Unlike Coordinated Phrases in TAG by Mixing Syntactic Category and Grammatical Function Carlos A. Prolo Faculdade de Informática – PUCRS CELSUL, Oct. 2008

VP VP * Adv NP N S V VP Lexicalized Tree Adjoining Grammar (LTAG)

VP VP * Adv NP N S V VP S NPVP Adv V NP N N LTAG: combining trees 4 Tree Substitution Tree Adjunction

VP VP * Adv NP N S V VP 4 NP DT NP * Lexicalized Tree Adjoining Grammar (LTAG)

VP VP * Adv NP N S V VP 4 NP N [John] [apple] [quickly] [ate] NP DT NP * [the] Lexicalized Tree Adjoining Grammar (LTAG)

VP VP * Adv NP N S V VP S NPVP Adv V NP N N LTAG: combining trees 4 Tree Substitution Tree Adjunction NP N [John] [apple] [quickly] [ate] NP DT NP * [the] DT NP [the] [apple] [John] [ate] [quickly]

Features of LTAGs 1.Lexicalization 2.Domain of locality 3.Factoring of recursion 4.Rich descriptions 5.Dependencies 6.A grammar formalism, not a linguistic theory 7.Can have “feature” equations (FB-LTAGs) 8.Wide coverage grammars 9.Parsers

S NP V VP S NP V VP S NP  S NP V VP S NP  NP NP * Domain of locality: head and arguments in the same tree 5 [eat] Declarative Wh- object movement Rel. Clause, subject relativ.

S NP V PP VP Lexicalization, Domain of locality 4 P NP [account] [for]

Features of LTAGs 1.Lexicalization 2.Domain of locality 3.Factoring of recursion 4.Rich descriptions 5.Dependencies 6.A grammar formalism, not a linguistic theory 7.Can have “feature” equations (FB-LTAGs) 8.Wide coverage grammars 9.Parsers

VP VP * Adv S NP V VP S NPVP Adv V NP Factoring of recursion 4

Features of LTAGs 1.Lexicalization 2.Domain of locality 3.Factoring of recursion 4.Rich descriptions 5.Dependencies 6.A grammar formalism, not a linguistic theory 7.Can have “feature” equations (FB-LTAGs) 8.Wide coverage grammars 9.Parsers

Features of LTAGs 1.Lexicalization 2.Domain of locality 3.Factoring of recursion 4.Rich descriptions 5.Dependencies 6.A grammar formalism, not a linguistic theory 7.Can have “feature” equations (FB-LTAGs) 8.Wide coverage grammars 9.Parsers

VP VP * Adv NP N S NP S V NP O VP S NPVP Adv V NP N N Dependencies: NP N [John] [apple] [quickly] [ate] NP DT NP * [the] DT NP [the] [apple] [John] [ate] [quickly] ate John apple quickly NP S NP O VP Derivation tree Derived tree [the] NP

Features of LTAGs 1.Lexicalization 2.Domain of locality 3.Factoring of recursion 4.Rich descriptions 5.Dependencies 6.A grammar formalism, not a linguistic theory 7.Can have “feature” equations (FB-LTAGs) 8.Wide coverage grammars 9.Parsers

Features of LTAGs 1.Lexicalization 2.Domain of locality 3.Factoring of recursion 4.Rich descriptions 5.Dependencies 6.A grammar formalism, not a linguistic theory 7.Can have “feature” equations (FB-LTAGs) 8.Wide coverage grammars 9.Parsers

FB-LTAGs S NP V VP S NP V VP S NP  [eat] Declarative Wh- object movement [wh=+] [ref= ] [wh=-]  PRO  [fin=-] [fin= ]

Features of LTAGs 1.Lexicalization 2.Domain of locality 3.Factoring of recursion 4.Rich descriptions 5.Dependencies 6.A grammar formalism, not a linguistic theory 7.Can have “feature” equations (FB-LTAGs) 8.Wide coverage grammars 9.Parsers

Wide-coverage grammars Handcrafted  XTAG grammar (English)  French grammar (Paris 7) Automatically extracted from corpora  Chen & Vijay-Shanker  Chiang  Xia

S NP 0 V NP 1 VP S NP V NP 1 VP S NP 1 V VP S NP 0  S NP V VP S NP 1  S NP V NP 1 VP S NP 0  NP NP * XTAG grammar: Verb Trees 5

S NP 0 V NP 1 VP S NP V NP 1 VP S NP 1 V VP S NP 0  S NP V VP S NP 1  S NP V NP 1 VP S NP 0  NP NP * XTAG grammar: Verb FamilyTransitive 6

Architecture of the XTAG English grammar A set of verb tree families. Each family:  Roughly corresponds to a subcategorization frame  Contain a set of elementary trees corresponding to each of the possible final realizations of the frame, e.g.: declarative, wh-subject, passive, etc. A set of individual trees for the other syntactic categories

Trees for the verb “put” Declarative tree for “put”: “He put the book on the table”

Trees for the verb “put”: the “put” family Declarative tree for “put”: “He put the book on the table” Subject extracted tree for “put”: “Who put the book on the table”

More trees from the “put” family Passive tree for “put”: “The book was put on the table by him” Passive with subject extraction for “put”: “What was put on the table by him”

TreeAdjoining Grammars the SUBSTITUTION operation A A A A + = intial tree

TreeAdjoining Grammars the ADJUNCTION operation A A A*A* A A A + = auxiliary tree

VP VP * Adv NP N S V VP 4 NP DT NP * Lexicalized Tree Adjoining Grammar (LTAG)

VP VP * Adv NP N S V VP 4 NP N [John] [apple] [quickly] [ate] NP DT NP * [the] Lexicalized Tree Adjoining Grammar (LTAG)

Features of LTAGs 1.Lexicalization 2.Domain of locality 3.Factoring of recursion 4.Rich descriptions 5.Dependencies 6.A grammar formalism, not a linguistic theory 7.Can have “feature” equations (FB-LTAGs) 8.Wide coverage grammars 9.Parsers

VP VP * Adv NP N S V VP S NPVP Adv V NP N N LTAG: combining trees 4 Tree Substitution Tree Adjunction NP N [John] [apple] [quickly] [ate] NP DT NP * [the] DT NP [the] [apple] [John] [ate] [quickly]

VP VP * Adv NP N S NP S V NP O VP S NPVP Adv V NP N N Dependencies: NP N [John] [apple] [quickly] [ate] NP DT NP * [the] DT NP [the] [apple] [John] [ate] [quickly] ate John apple quickly NP S NP O VP Derivation tree Derived tree [the] NP

VP VP * Adv NP N S NP S V NP O VP S NPVP Adv V NP N N Dependencies 4 ate[green] John[red] apples[red] quickly[yellow] NP S NP O VP Derivation tree Derived tree

FB-LTAGs S NP V VP S NP V VP S NP  [eat] Declarative Wh- object movement [wh=+] [ref= ] [wh=-]  PRO  [fin=-] [fin= ]

Wide-coverage grammars Handcrafted  XTAG grammar (English)  French grammar (Paris 7) Automatically extracted from corpora  Chen & Vijay-Shanker  Chiang  Xia

Parsers “All-parses” parsers  Schabes/Paroubek  Sarkar  Boullier High accuracy “best-parse” parsers  Chiang  Sarkar Very fast “deterministic” “best-parse” parsers  Prolo: EMNLP02, IWPT00 (LR parser, decisions based on statistics, deterministic with limited amount of backtracking)

VP VP * Adv NP N S NP 0 V NP 1 VP XTAG grammar: Examples of elementary trees 3

VP VP * Adv NP N S NP 0 V NP 1 VP XTAG grammar: combining trees

VP VP * Adv NP N S NP 0 V NP 1 VP XTAG grammar: combining trees

VP VP * Adv NP N S NP 0 V NP 1 VP XTAG grammar: combining trees

VP VP * Adv NP N S NP 0 V NP 1 VP S NPVP Adv V NP N N XTAG grammar: combining trees 4

S NP V VP S NP V VP S NP  S NP V VP S NP  NP NP * Domain of locality: head and arguments in the same tree 5 [eat] Declarative Wh- object movement Rel. Clause, subject relativ.

S NP V PP VP Lexicalization, Domain of locality 4 P NP [account] [for]

S NP 0 V NP 1 VP S NP V NP 1 VP S NP 1 V VP S NP 0  S NP V VP S NP 1  S NP V NP 1 VP S NP 0  NP NP * XTAG grammar: Verb Trees 5

S NP 0 V NP 1 VP S NP V NP 1 VP S NP 1 V VP S NP 0  S NP V VP S NP 1  S NP V NP 1 VP S NP 0  NP NP * XTAG grammar: Verb FamilyTransitive 6

Architecture of the XTAG English grammar A set of verb tree families. Each family:  Roughly corresponds to a subcategorization frame  Contain a set of elementary trees corresponding to each of the possible final realizations of the frame, e.g.: declarative, wh-subject, passive, etc. A set of individual trees for the other syntactic categories

Trees for the verb “put” Declarative tree for “put”: “He put the book on the table”

Trees for the verb “put”: the “put” family Declarative tree for “put”: “He put the book on the table” Subject extracted tree for “put”: “Who put the book on the table”

More trees from the “put” family Passive tree for “put”: “The book was put on the table by him” Passive with subject extraction for “put”: “What was put on the table by him”

Description of trees of the “put” family (excluding relative clauses) 7

Overview of current coverage of the XTAG verb tree families 8

Trees not generated (80) Idiosyncratic trees: 30  “-ed” adjectives, restricted to transitives (“an eaten apple”)  Trees with punctuation in the sentential compl. Fams.  Determiner Gerund trees (“the finding of the treasure”) Not yet handled yet: 48  Passivization of “2 nd object” in idioms: (“The warning was taken heed of”)  Occurrence of “by-phrase” in passives in non-final position (“I was told by Mary that...”) Note: “... given by Lee to Sandy” (Gazdar et al. 85) Other: 2 21

Unlike Coordinated Phrases (UCP) (NP (UCP (NN construction) (CC and) (JJ commercial)) (NNS loans)) (VP (VB be) (UCP-PRD (NP (CD 35)) (CC or) (ADJP (JJR older)))) (VP (VB take) (NP (NN effect)) (UCP-TMP (ADVP 96 days later) (,,) (CC or) (PP in early February)))

Unlike Coordinated Phrases (UCP) (NP (UCP (NN construction) (CC and) (JJ commercial)) (NNS loans)) (VP (VB be) (UCP-PRD (NP (CD 35)) (CC or) (ADJP (JJR older)))) (VP (VB take) (NP (NN effect)) (UCP-TMP (ADVP 96 days later) (,,) (CC or) (PP in early February))) NP NP * UCP JJ NNCC S NP VB UCP VP [be]

Unlike Coordinated Phrases (UCP) We give the UCP the status of an independent non-terminal as if it had some intrinsic categorial significance Multiple conjunts: it is enough for one of them to be of a distinct category to turn the entire constituent into a UCP

Unlike Coordinated Phrases (UCP): as the head of a constituent (S (NP-SBJ-1 The Series 1989 B bonds) (VP (VBP are) (VP (VBN rated) (S *-1 double-A)))) (S (NP-SBJ-1 The Series 1989 B bonds) (VP (VBP are) (UCP-PRD (ADJP-PRD (JJ uninsured)) (CC and) (VP (VBN rated) (S *-1 double-A)))))

Mixing Syntactic Categoryand Grammatical Function Coordination works over the Grammatical Functions and not the Syntactic Categories  She flew yesterday. She flew on July 4 th (Adverbial adjuncts)  Hence: She flew yesterday and on July 4th.  They sell electronic devices. They sell computer devices (adnominal adjuncts)  Hence: They sell electronic and computer devices.  I know the answer. I know that you don´t know it. (Internal arguments of “know”)  Hence: I know the answer and that you don´t know it.

Mixing Syntactic Categoryand Grammatical Function: Elementary trees for intransitive main clause and for NP subject Main Subj S Pred VP V N NP Substitution nodes (for arguments) are Grammatical Functions Corresponding Initial Trees are rooted by Grammatical Function nodes

Mixing Syntactic Categoryand Grammatical Function: Elementary trees for left adnominal adjuncts NP AdnAdjLeft NP * NP N AdnAdjLeft NP * NP A Adjunction takes place at Syntactic Category nodes for modifiers, adjuncts … Corresponding auxiliary trees have Syntactic Category root and foot.

Mixing Syntactic Categoryand Grammatical Function: Elementary trees for coordination of left adnominal adjuncts AdnAdjLeft NP AdnAdjLeft * CC AdnAdjLeft ADJP AdnAdjLeft * CC Adjunction takes place at Grammatical Function nodes for coordination and... what else???? Corresponding auxiliary trees have Grammatical Function root and foot.

Conclusion Mixing Syntactic Category and Grammatical Function in the tagset of a generative grammar allows for handling linguistic phenomena which are syntactic in nature but rely on grammatical functions instead of syntactic categories Clearly coordination is one such phenomenon We would like to know other such cases We sketch a proposal of how to work out the idea in the Tree Adjoining Grammar formalism

S NP V VP S NP V VP S NP  S NP V VP S NP  NP NP * Domain of locality: head and arguments in the same tree 5 [eat] Declarative Wh- object movement Rel. Clause, subject relativ.