1 / 73

LINGUIST 180: Introduction to Computational Linguistics

LINGUIST 180: Introduction to Computational Linguistics. Dan Jurafsky, Marie-Catherine de Marneffe Lecture 9: Grammar and Parsing (I). Thanks to Jim Martin for many of these slides!. Outline for Grammar/Parsing Week. Context-Free Grammars and Constituency

cuyler
Download Presentation

LINGUIST 180: Introduction to Computational Linguistics

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. LINGUIST 180: Introduction to Computational Linguistics Dan Jurafsky, Marie-Catherine de Marneffe Lecture 9: Grammar and Parsing (I) Thanks to Jim Martin for many of these slides!

  2. Outline for Grammar/Parsing Week • Context-Free Grammars and Constituency • Some common CFG phenomena for English • Sentence-level constructions • NP, PP, VP • Coordination • Subcategorization • Top-down and Bottom-up Parsing • Dynamic Programming Parsing • Quick sketch of probabilistic parsing

  3. 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. Syntax • Syntax: from Greek syntaxis “setting out together, arrangement’’ • Refers to the way words are arranged together, and the relationship between them. • Distinction: • Prescriptive grammar: how people ought to talk • Descriptive grammar: how they do talk • Goal of syntax is to model the knowledge of that people unconsciously have about the grammar of their native language

  5. Syntax • Why should we care? • Grammar checkers • Question answering • Information extraction • Machine translation

  6. key ideas of syntax • Constituency (we’ll spend most of our time on this) • Subcategorization • Grammatical relations Plus one part we won’t have time for: • Movement/long-distance dependency

  7. Context-Free Grammars (CFG) • 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. Constituency • E.g., 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?

  9. 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. 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. CFG example • S -> NP VP • NP -> Det NOMINAL • NOMINAL -> Noun • VP -> Verb • Det -> a • Noun -> flight • Verb -> left

  12. CFGs: set of rules • 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. 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 • How can we define grammatical vs. ungrammatical sentences?

  14. 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. S NP VP NP Nom Pro Verb Det Noun Noun I prefer a morning flight Derivations as Trees

  16. CFGs more formally • A context-free grammar has 4 parameters (“is a 4-tuple”) • A set of non-terminal symbols (“variables”) N • A set of terminal symbols  (disjoint from N) • 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)* • A designated start symbol S

  17. 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 1derives m or 1*m • We then formally define language LG generated by grammar G • A set of strings composed of terminal symbols derived from S • LG = {w | w is in * and S * w}

  18. Parsing • Parsing is the process of taking a string and a grammar and returning a (many?) parse tree(s) for that string

  19. Context? • The notion of context in CFGs has nothing to do with the ordinary meaning of the word context in language • All it really 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. Key Constituents (English) • Sentences • Noun phrases • Verb phrases • Prepositional phrases

  21. 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. NPs • NP -> Pronoun • I came, you saw it, they conquered • NP -> Proper-Noun • Los Angeles is west of Texas • John Hennessy is the president of Stanford • NP -> Det Noun • The president • NP -> Nominal • Nominal -> Noun Noun • A morning flight to Denver

  23. PPs • PP -> Preposition NP • From LA • To the store • On Tuesday morning • With lunch

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

  26. Recursion [[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. NP -> NP PP

  27. 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. 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. S NP VP NP Nom Pro Verb Det Noun Noun I prefer a morning flight Bracketed Notation • [S [NP [PRO I]] [VP [V prefer] [NP [Det a] [Nom [N morning] [N flight] ] ] ] ]

  30. 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 (Metarule) However we can say “He was longwinded and a bully.”

  31. Problems • Agreement • Subcategorization • Movement (for want of a better term)

  32. This dog Those dogs This dog eats Those dogs eat *This dogs *Those dog *This dog eat *Those dogs eats Agreement

  33. 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 … Possible CFG Solution

  34. CFG Solution for Agreement • It works and stays within the power of CFGs • But it’s ugly • And it doesn’t scale all that well

  35. Subcategorization • Sneeze: John sneezed • *John sneezed the book • Say: You said [United has a flight]S • Prefer: I prefer [to leave earlier]TO-VP • *I prefer United has a flight • Give: Give [me]NP[a cheaper fare]NP • Help: Can you help [me]NP[with a flight]PP • *Give with a flight

  36. Subcategorization • Subcat expresses the constraints that a predicate (verb for now) places on the number and syntactic types of arguments it wants to take (occur with).

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

  38. Possible CFG Solution • VP -> V • VP -> V NP • VP -> V NP PP • … • VP -> IntransV • VP -> TransV NP • VP -> TransVwPP NP PP • …

  39. 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. Movement • Core example • My travel agent booked the flight • [[My travel agent]NP [booked [the flight]NP]VP]S • i.e. “book” is a straightforward transitive verb. It expects a single NP arg within the VP as an argument, and a single NP arg as the subject.

  41. Movement • 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 in fact a long way from where its supposed to appear. • And note that it’s separated from its verb by 2 other verbs.

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

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

  44. Dependency parsing • Word to word links instead of constituency • Based on the European rather than American traditions • But dates back to the Greeks • The original notions of Subject, Object and the progenitor of subcategorization (called ‘valence’) came out of Dependency theory. • Dependency parsing is quite popular as a computational model since relationships between words are quite useful

  45. S submitted VP NP agent nsubjpass auxpass VP VBD PP NP VBN PP Brownback Bills were IN NP prep_on nn NP IN NNS NN CC NNS ports NNP NNP Senator conj_and Bills on ports and immigration were submitted by Senator Brownback immigration Dependency parsing Parse tree: Nesting of multi-word constituents Typed dep parse: Grammatical relations between individual words

  46. Why are dependency parses useful? • Example: multi-document summarization Need to identify sentences from different documents that each say roughly the same thing: phrase structure trees of paraphrasing sentences which differ in word order can be significantly different but dependency representations will be very similar

  47. Parsing • Parsing: assigning correct trees to input strings • Correct tree: a tree that covers all and only the elements of the input and has an S at the top • For now: enumerate all possible trees • A further task: disambiguation: means choosing the correct tree from among all the possible trees.

  48. Treebanks • Parsed corpora in the form of trees • The Penn Treebank • The Brown corpus • The WSJ corpus • Tgrep http://www.ldc.upenn.edu/ldc/online/treebank/ • Tregex http://www-nlp.stanford.edu/nlp/javadoc/javanlp/

  49. Parsing involves search • As with everything of interest, parsing involves a search which involves the making of choices • We’ll start with some basic (meaning bad) methods before moving on to the one or two that you need to know

  50. For Now • Assume… • You have all the words already in some buffer • The input isn’t pos tagged • We won’t worry about morphological analysis • All the words are known

More Related