1 LIN6932 Spring 2007 LIN6932 Topics in Computational Linguistics Lecture 6: Grammar and Parsing (I) February 15, 2007 Hana Filip.

Slides:



Advertisements
Similar presentations
School of something FACULTY OF OTHER School of Computing FACULTY OF ENGINEERING Parsing: computing the grammatical structure of English sentences COMP3310.
Advertisements

Computational language: week 10 Lexical Knowledge Representation concluded Syntax-based computational language Sentence structure: syntax Context free.
Mrach 1, 2009Dr. Muhammed Al-Mulhem1 ICS482 Formal Grammars Chapter 12 Muhammed Al-Mulhem March 1, 2009.
Syntactic analysis using Context Free Grammars. Analysis of language Morphological analysis – Chairs, Part Of Speech (POS) tagging – The/DT man/NN left/VBD.
Lecture 1, 7/21/2005Natural Language Processing1 CS60057 Speech &Natural Language Processing Autumn 2007 Lecture August 2007.
Context-Free Grammars Julia Hirschberg CS 4705 Slides with contributions from Owen Rambow, Kathy McKeown, Dan Jurafsky and James Martin.
Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 27
1 LING 180 Autumn 2007 LINGUIST 180: Introduction to Computational Linguistics Dan Jurafsky, Marie-Catherine de Marneffe Lecture 9: Grammar and Parsing.
Albert Gatt LIN3022 Natural Language Processing Lecture 8.
1 CSC 594 Topics in AI – Applied Natural Language Processing Fall 2009/ Grammar and Parsing.
Syllabus Text Books Classes Reading Material Assignments Grades Links Forum Text Books עיבוד שפות טבעיות - שיעור שמונה Context Free Grammars and.
Syntax and Context-Free Grammars CMSC 723: Computational Linguistics I ― Session #6 Jimmy Lin The iSchool University of Maryland Wednesday, October 7,
1 CONTEXT-FREE GRAMMARS. NLE 2 Syntactic analysis (Parsing) S NPVP ATNNSVBD NP AT NNthechildrenate thecake.
Artificial Intelligence 2004 Natural Language Processing - Syntax and Parsing - Language Syntax Parsing.
CPSC 503 Computational Linguistics
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.
Syntax Construction of phrases and sentences from morphemes and words. Usually the word syntax refers to the way words are arranged together. Syntactic.
Dr. Ansa Hameed Syntax (4).
Models of Generative Grammar Smriti Singh. Generative Grammar  A Generative Grammar is a set of formal rules that can generate an infinite set of sentences.
11 CS 388: Natural Language Processing: Syntactic Parsing Raymond J. Mooney University of Texas at Austin.
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.
School of something FACULTY OF OTHER School of Computing FACULTY OF ENGINEERING COMP3310 Natural Language Processing Eric Atwell, Language Research Group.
1 Features and Unification Chapter 15 October 2012 Lecture #10.
Context Free Grammars Reading: Chap 12-13, Jurafsky & Martin This slide set was adapted from J. Martin and Rada Mihalcea.
Speech and Language Processing Lecture 12—02/24/2015 Susan W. Brown.
Session 13 Context-Free Grammars and Language Syntax Introduction to Speech and Natural Language Processing (KOM422 ) Credits: 3(3-0)
TEORIE E TECNICHE DEL RICONOSCIMENTO Linguistica computazionale in Python: -Analisi sintattica (parsing)
1 Syntax Sudeshna Sarkar 25 Aug Sentence-Types Declaratives: A plane left S -> NP VP Imperatives: Leave! S -> VP Yes-No Questions: Did the plane.
1 CPE 480 Natural Language Processing Lecture 5: Parser Asst. Prof. Nuttanart Facundes, Ph.D.
10/3/2015CPSC503 Winter CPSC 503 Computational Linguistics Lecture 8 Giuseppe Carenini.
GRAMMARS David Kauchak CS159 – Fall 2014 some slides adapted from Ray Mooney.
Chapter 12: FORMAL GRAMMARS OF ENGLISH Heshaam Faili University of Tehran.
Parsing I: Earley Parser CMSC Natural Language Processing May 1, 2003.
Context Free Grammars Reading: Chap 9, Jurafsky & Martin This slide set was adapted from J. Martin, U. Colorado Instructor: Rada Mihalcea.
11 Chapter 14 Part 1 Statistical Parsing Based on slides by Ray Mooney.
6/2/2016CPSC503 Winter CPSC 503 Computational Linguistics Lecture 9 Giuseppe Carenini.
Chapter 12: Context-Free Grammars Heshaam Faili University of Tehran.
Parsing Introduction Syntactic Analysis I. Parsing Introduction 2 The Role of the Parser The Syntactic Analyzer, or Parser, is the heart of the front.
For Wednesday Read chapter 23 Homework: –Chapter 22, exercises 1,4, 7, and 14.
Parsing with Context-Free Grammars for ASR Julia Hirschberg CS 4706 Slides with contributions from Owen Rambow, Kathy McKeown, Dan Jurafsky and James Martin.
Rules, Movement, Ambiguity
CSA2050 Introduction to Computational Linguistics Parsing I.
Parsing with Context-Free Grammars References: 1.Natural Language Understanding, chapter 3 (3.1~3.4, 3.6) 2.Speech and Language Processing, chapters 9,
1 Context Free Grammars October Syntactic Grammaticality Doesn’t depend on Having heard the sentence before The sentence being true –I saw a unicorn.
1 Context Free Grammars Chapter 9 (Much influenced by Owen Rambow) October 2009 Lecture #7.
Syntax Sudeshna Sarkar 25 Aug 2008.
Section 11.3 Features structures in the Grammar ─ Jin Wang.
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Spring 2006-Lecture 2.
Natural Language Processing Lecture 14—10/13/2015 Jim Martin.
English Syntax Read J & M Chapter 9.. Two Kinds of Issues Linguistic – what are the facts about language? The rules of syntax (grammar) Algorithmic –
◦ Process of describing the structure of phrases and sentences Chapter 8 - Phrases and sentences: grammar1.
1/22/2016CPSC503 Winter CPSC 503 Computational Linguistics Lecture 8 Giuseppe Carenini.
CSA3050: NLP Algorithms Sentence Grammar NLP Algorithms.
3/20/2016CPSC503 Winter CPSC 503 Computational Linguistics Lecture 7 Giuseppe Carenini.
Speech and Language Processing Formal Grammars Chapter 12.
SI485i : NLP Set 7 Syntax and Parsing. 2 Syntax Grammar, or syntax: The kind of implicit knowledge of your native language that you had mastered by the.
Context Free Grammars. Slide 1 Syntax Syntax = rules describing how words can connect to each other * that and after year last I saw you yesterday colorless.
Natural Language Processing Vasile Rus
Speech and Language Processing
CSC NLP -Context-Free Grammars
CPSC 503 Computational Linguistics
Lecture 13: Grammar and Parsing (I) November 9, 2004 Dan Jurafsky
CSC 594 Topics in AI – Natural Language Processing
CSCI 5832 Natural Language Processing
CSCI 5832 Natural Language Processing
CS 388: Natural Language Processing: Syntactic Parsing
CSCI 5832 Natural Language Processing
Natural Language - General
CSCI 5832 Natural Language Processing
Presentation transcript:

1 LIN6932 Spring 2007 LIN6932 Topics in Computational Linguistics Lecture 6: Grammar and Parsing (I) February 15, 2007 Hana Filip

2 LIN6932 Spring 2007 Outline for Grammar/Parsing Context-Free Grammars (CFG) and Constituency Some common CFG phenomena for English Sentence-level constructions NP, PP, VP Coordination Subcategorization Levels of complexity in grammars and automata: The Chomsky hierarchy Top-down and Bottom-up Parsing Earley Parsing Quick sketch of probabilistic parsing

3 LIN6932 Spring 2007 Review Parts of Speech Basic syntactic/morphological categories that words belong to Part of Speech tagging Assigning parts of speech to all the words in a sentence

4 LIN6932 Spring 2007 Syntax Syntax: from Greek syntaxis, “setting out together, arrangement’ Refers to the way words are arranged together, and their relationships Distinction: Prescriptive grammar: how people ought to talk Descriptive grammar: how they do talk Goal of syntax is to model the knowledge that people unconsciously have about the grammar of their native language

5 LIN6932 Spring 2007 Syntax Why should you care? Grammar checkers Question answering Information extraction Machine translation

6 LIN6932 Spring key ideas of syntax Constituency Grammatical relations Subcategorization Lexical dependencies Plus one part we won’t have time for: Movement/long-distance dependency

7 LIN6932 Spring 2007 Context-Free Grammars Capture constituency and ordering Ordering: What are the rules that govern the ordering of words and bigger units in the language? Constituency: How words group into units and how the various kinds of units behave

8 LIN6932 Spring 2007 Constituency Noun phrases (NPs) –Three parties from Brooklyn –A high-class spot such as Mindy’s –The Broadway coppers –They –Harry the Horse –The reason he comes into the Hot Box How do we know these form a constituent? They can all appear before a verb: –Three parties from Brooklyn arrive… –A high-class spot such as Mindy’s attracts… –The Broadway coppers love… –They sit…

9 LIN6932 Spring 2007 Constituency (II) They can all appear before a verb: –Three parties from Brooklyn arrive… –A high-class spot such as Mindy’s attracts… –The Broadway coppers love… –They sit But individual words can’t always appear before verbs: –*from arrive… –*as attracts… –*the is –*spot is… Must be able to state generalizations like: –Noun phrases occur before verbs

10 LIN6932 Spring 2007 Constituency (III) Preposing and postposing: On September 17th, I’d like to fly from Atlanta to Denver I’d like to fly on September 17th from Atlanta to Denver I’d like to fly from Atlanta to Denver on September 17th. But not: *On September, I’d like to fly 17th from Atlanta to Denver *On I’d like to fly September 17th from Atlanta to Denver

11 LIN6932 Spring 2007 CFG Examples S -> NP VP NP -> Det NOMINAL NOMINAL -> Noun VP -> Verb Det -> a Noun -> flight Verb -> left

12 LIN6932 Spring 2007 CFGs S -> NP VP This says that there are units called S, NP, and VP in this language That an S consists of an NP followed immediately by a VP Doesn’t say that that’s the only kind of S Nor does it say that this is the only place that NPs and VPs occur

13 LIN6932 Spring 2007 Generativity As with FSAs you can view these rules as either analysis or synthesis machines Generate strings in the language Reject strings not in the language Impose structures (trees) on strings in the language

14 LIN6932 Spring 2007 Derivations A derivation is a sequence of rules applied to a string that accounts for that string Covers all the elements in the string Covers only the elements in the string

15 LIN6932 Spring 2007 Derivations as Trees

16 LIN6932 Spring 2007 CFGs more formally A context-free grammar has 4 parameters (“is a 4- tuple”) 1)A set of non-terminal symbols (“variables”) N 2)A set of terminal symbols  (disjoint from N) 3)A set of productions P, each of the form –A ->  –Where A is a non-terminal and  is a string of symbols from the infinite set of strings (  N)* 4)A designated start symbol S

17 LIN6932 Spring 2007 Defining a CF language via derivation A string A derives a string B if A can be rewritten as B via some series of rule applications More formally: If A -> is a production of P  and  are any strings in the set (  N)* Then we say that –A directly derives  –Or A   Derivation is a generalization of direct derivation Let  1,  2, …  m be strings in (  N)*, m>= 1, s.t. – 1   2,  2   3 …  m-1   m –We say that  1 derives  m or  1 *  m We then formally define language L G generated by grammar G –As set of strings composed of terminal symbols derived from S –L G = {w | w is in * and S * w}

18 LIN6932 Spring 2007 Parsing Parsing is the process of taking a string and a grammar and assigning correct trees to input strings Correct tree: a tree that covers all and only the elements of the input and has an S node at the top

19 LIN6932 Spring 2007 Context? The notion of context in CFGs has nothing to do with the ordinary meaning of the word context in language. All it means is that the non-terminal on the left-hand side of a rule is out there all by itself (free of context) A -> B C Means that I can rewrite an A as a B followed by a C regardless of the context in which A is found

20 LIN6932 Spring 2007 Key Constituents (English) Sentences Noun phrases Verb phrases Prepositional phrases

21 LIN6932 Spring 2007 Sentence-Types Declaratives: A plane left S -> NP VP Imperatives: Leave! S -> VP Yes-No Questions: Did the plane leave? S -> Aux NP VP WH Questions: When did the plane leave? S -> WH Aux NP VP

22 LIN6932 Spring 2007 NPs NP -> Pronoun I came, you saw it, they conquered NP -> Proper-Noun Los Angeles is west of Texas NP -> Det Noun The president NP -> Nominal Nominal -> Noun Noun A morning flight to Denver

23 LIN6932 Spring 2007 PPs PP -> Preposition NP From LA To Boston On Tuesday With lunch

24 LIN6932 Spring 2007 Recursion We’ll have to deal with rules such as the following where the non-terminal on the left also appears somewhere on the right (directly). NP -> NP PP[[The flight] [to Boston]] VP -> VP PP[[departed Miami] [at noon]]

25 LIN6932 Spring 2007 Recursion Of course, this is what makes syntax interesting flights from Denver Flights from Denver to Miami Flights from Denver to Miami in February Flights from Denver to Miami in February on a Friday Flights from Denver to Miami in February on a Friday under $300 Flights from Denver to Miami in February on a Friday under $300 with lunch Etc.

26 LIN6932 Spring 2007 Recursion Of course, this is what makes syntax interesting [[flights] [from Denver]] [[[Flights] [from Denver]] [to Miami]] [[[[Flights] [from Denver]] [to Miami]] [in February]] [[[[[Flights] [from Denver]] [to Miami]] [in February]] [on a Friday]] Etc.

27 LIN6932 Spring 2007 Implications of recursion and context-freeness If you have a rule like VP -> V NP It only cares that the thing after the verb is an NP. It doesn’t have to know about the internal affairs of that NP

28 LIN6932 Spring 2007 The Point VP -> V NP I hate flights from Denver Flights from Denver to Miami Flights from Denver to Miami in February Flights from Denver to Miami in February on a Friday Flights from Denver to Miami in February on a Friday under $300 Flights from Denver to Miami in February on a Friday under $300 with lunch

29 LIN6932 Spring 2007 Bracketed Notation [ S [ NP [ PRO I] [ VP [ V prefer [ NP [ NP [ Det a] [ Nom [ N morning] [ N flight]]]]

30 LIN6932 Spring 2007 Coordination Constructions S -> S and S John went to NY and Mary followed him NP -> NP and NP VP -> VP and VP … In fact the right rule for English is X -> X and X

31 LIN6932 Spring 2007 Other Syntactic stuff Grammatical Relations Subject –I booked a flight to New York –The flight was booked by my agent. Object –I booked a flight to New York Complement –I said that I wanted to leave

32 LIN6932 Spring 2007 Problems Agreement Subcategorization Movement (for want of a better term)

33 LIN6932 Spring 2007 Agreement This dog Those dogs This dog eats Those dogs eat *This dogs *Those dog *This dog eat *Those dogs eats

34 LIN6932 Spring 2007 Possible CFG Solution S -> NP VP NP -> Det Nominal VP -> V NP … SgS -> SgNP SgVP PlS -> PlNp PlVP SgNP -> SgDet SgNom PlNP -> PlDet PlNom PlVP -> PlV NP SgVP ->SgV Np …

35 LIN6932 Spring 2007 CFG Solution for Agreement It works and stays within the power of CFGs But its ugly (loss of generalization) And it doesn’t scale all that well

36 LIN6932 Spring 2007 Subcategorization Verbs have preferences for the number and syntactic kinds of constituents they co-occur with Sneeze: John sneezed intransitive verb Find: Please find [a flight to NY] NP transitive verb Give: Give [me] NP [a cheaper fare] NP ditransitive verb Help: Can you help [me] NP [with a flight] PP DO IO/Oblique Prefer: I prefer [to leave earlier] TO-VP VP complement Said: You said [United has a flight] S sentential complement …

37 LIN6932 Spring 2007 Subcategorization But not: *John sneezed the book *I prefer United has a flight *Give with a flight Subcategorization expresses the constraints that a lexical predicate places on the number and syntactic kinds of arguments it wants to take (occur with) So far we have only considerate one type of lexical predicate: verb Nouns, adjectives and prepositions also take arguments

38 LIN6932 Spring 2007 So? So the various CFG rules for VPs overgenerate. They permit the presence of strings containing verbs and arguments that don’t go together For example VP -> V NP predicts that Sneezed the book is a VP since “sneeze” is a verb and “the book” is a valid NP

39 LIN6932 Spring 2007 Forward Pointer It turns out that verb subcategorization facts will provide a key element for semantic analysis (determining who did what to who in an event).

40 LIN6932 Spring 2007 Possible CFG Solution VP -> V VP -> V NP VP -> V NP PP … VP -> IntransV VP -> TransV NP VP -> TransVwPP NP PP …

41 LIN6932 Spring 2007 Movement Core example My travel agent booked the flight

42 LIN6932 Spring 2007 Movement Core example [[My travel agent] NP [booked [the flight] NP ] VP ] S I.e. “book” is a straightforward transitive verb. It expects a single NP arg as the subject and a single NP arg within the VP

43 LIN6932 Spring 2007 Movement - Long Distance Dependencies What about? Which flight do you want me to have the travel agent book __? The direct object argument to “book” isn’t appearing in the right place. It is a long way from where it originally appeared And note that it is separated from its verb by 2 other verbs.

44 LIN6932 Spring 2007 CFGs: a summary CFGs appear to be just about what we need to account for a lot of basic syntactic structure in English But there are problems That can be dealt with adequately, although not elegantly, by staying within the CFG framework. There are simpler, more elegant, solutions that take us out of the CFG framework (beyond its formal power) Syntactic theories: HPSG, LFG, CCG, Minimalism, etc