1 / 44

CS344: Introduction to Artificial Intelligence

CS344: Introduction to Artificial Intelligence. Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 20-21 – Natural Language Parsing. Parsing of Sentences. Are sentences flat linear structures? Why tree?. Is there a principle in branching

lionel
Download Presentation

CS344: Introduction to Artificial Intelligence

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. CS344: Introduction to Artificial Intelligence Pushpak BhattacharyyaCSE Dept., IIT Bombay Lecture 20-21– Natural Language Parsing

  2. Parsing of Sentences

  3. Are sentences flat linear structures? Why tree? • Is there a principle in branching • When should the constituent give rise to children? • What is the hierarchy building principle?

  4. Structure Dependency: A Case Study • Interrogative Inversion (1) John will solve the problem. Will John solve the problem? Declarative Interrogative (2) a. Susan must leave. Must Susan leave? b. Harry can swim. Can Harry swim? c. Mary has read the book. Has Mary read the book? • Bill is sleeping. Is Bill sleeping? ………………………………………………………. The section, “Structure dependency a case study” here is adopted from a talk given by Howard Lasnik (2003) in Delhi university.

  5. Interrogative inversionStructure Independent (1st attempt) (3)Interrogative inversion process Beginning with a declarative, invert the first and second words to construct an interrogative. Declarative Interrogative (4) a. The woman must leave. *Woman the must leave? b. A sailor can swim. *Sailor a can swim? c. No boy has read the book. *Boy no has read the book? d. My friend is sleeping. *Friend my is sleeping?

  6. Interrogative inversion correct pairings • Compare the incorrect pairings in (4) with the correct pairings in (5): Declarative Interrogative (5) a. The woman must leave. Must the woman leave? b. A sailor can swim. Can a sailor swim? c. No boy has read the book. Has no boy read the book? d. My friend is sleeping. Is my friend sleeping?

  7. Interrogative inversionStructure Independent (2nd attempt) (6) Interrogative inversion process: • Beginning with a declarative, move the auxiliary verb to the front to construct an interrogative. Declarative Interrogative (7) a. Bill could be sleeping. *Be Bill could sleeping? Could Bill be sleeping? b. Mary has been reading. *Been Mary has reading? Has Mary been reading? c. Susan should have left. *Have Susan should left? Should Susan have left?

  8. Structure independent (3rd attempt): • Interrogative inversion process • Beginning with a declarative, move the first auxiliary verb to the front to construct an interrogative. Declarative Interrogative (9) a. The man who is here can swim. *Is the man who here can swim? b. The boy who will play has left. *Will the boy who play has left?

  9. Structure Dependent Correct Pairings • For the above examples, fronting the second auxiliary verb gives the correct form: Declarative Interrogative (10) a.The man who is here can swim. Can the man who is here swim? b.The boy who will play has left. Has the boy who will play left?

  10. Natural transformationsarestructure dependent • Does the child acquiring English learn these properties? (12) We are not dealing with a peculiarity of English. No known human language has a transformational process that would produce pairings like those in (4), (7) and (9), repeated below: (4) a. The woman must leave. *Woman the must leave? (7) a. Bill could be sleeping. *Be Bill could sleeping? (9) a. The man who is here can swim. *Is the man who here can swim?

  11. Deeper trees needed for capturing sentence structure This wont do! Flat structure! NP PP The AP PP book with the blue cover of poems big [The big book of poems with the Blue cover] is on the table.

  12. Other languages English NP PP The AP PP book with the blue cover big of poems NP Hindi AP PP PP kitaab kavita kii niil jilda vaalii badii [niil jilda vaalii kavita kii kitaab]

  13. Other languages: contd English NP PP The AP PP book with the blue cover big of poems NP Bengali AP PP PP ti bai kavitar niil malaat deovaa motaa [niil malaat deovaa kavitar bai ti]

  14. PPs are at the same level: flat with respect to the head word “book” No distinction in terms of dominance or c-command NP PP The AP PP book with the blue cover of poems big [The big book of poems with the Blue cover] is on the table.

  15. “Constituency test of Replacement” runs into problems • One-replacement: • I bought the big [book of poems with the blue cover] not the small [one] • One-replacement targets book of poems with the blue cover • Another one-replacement: • I bought the big [book of poems] with the blue cover not the small [one] with the red cover • One-replacement targets book of poems

  16. More deeply embedded structure NP N’1 The AP N’2 N’3 big PP N book with the blue cover PP of poems

  17. To target N1’ • I want [NPthis [N’big book of poems with the red cover] and not [Nthat [None]]

  18. Bar-level projections • Add intermediate structures • NP (D) N’ • N’ (AP) N’ | N’ (PP) | N (PP) • () indicates optionality

  19. New rules produce this tree NP N-bar N’1 The AP N’2 N’3 big PP N book with the blue cover PP of poems

  20. As opposed to this tree NP PP The AP PP book with the blue cover of poems big

  21. V-bar • What is the element in verbs corresponding to one-replacement for nouns • do-so or did-so

  22. As opposed to this tree NP PP The AP PP book with the blue cover of poems big

  23. I [eat beans with a fork] VP PP eat NP with a fork beans No constituent that groups together V and NP and excludes PP

  24. Need for intermediate constituents • I [eat beans] with a fork but Ram [does so] with a spoon VP V1’ VPV’ V’ V’ (PP) V’ V (NP) V2’ PP V NP with a fork eat beans

  25. How to target V1’ • I [eat beans with a fork], and Ram [does so] too. VP V1’ VPV’ V’ V’ (PP) V’ V (NP) V2’ PP V NP with a fork eat beans

  26. Parsing Algorithms

  27. A simplified grammar • S  NP VP • NP  DT N | N • VP  V ADV | V

  28. A segment of English Grammar • S’(C) S • S{NP/S’} VP • VP(AP+) (VAUX) V (AP+) ({NP/S’}) (AP+) (PP+) (AP+) • NP(D) (AP+) N (PP+) • PPP NP • AP(AP) A

  29. Example Sentence People laugh • 2 3 Lexicon: People - N, V Laugh - N, V These are positions This indicate that both Noun and Verb is possible for the word “People”

  30. Top-Down Parsing State Backup State Action ----------------------------------------------------------------------------------------------------- 1. ((S) 1) - - 2. ((NP VP)1) - - 3a. ((DT N VP)1) ((N VP) 1) - 3b. ((N VP)1) - - 4. ((VP)2) - Consume “People” 5a. ((V ADV)2) ((V)2) - 6. ((ADV)3) ((V)2) Consume “laugh” 5b. ((V)2) - - 6. ((.)3) - Consume “laugh” Termination Condition : All inputs over. No symbols remaining. Note: Input symbols can be pushed back. Position of input pointer

  31. Discussion for Top-Down Parsing • This kind of searching is goal driven. • Gives importance to textual precedence (rule precedence). • No regard for data, a priori (useless expansions made).

  32. Bottom-Up Parsing Some conventions: N12 S1? -> NP12 ° VP2? Represents positions Work on the LHS done, while the work on RHS remaining End position unknown

  33. Bottom-Up Parsing (pictorial representation) S -> NP12 VP23° People Laugh 1 2 3 N12 N23 V12 V23 NP12 -> N12 ° NP23 -> N23 ° VP12 -> V12 ° VP23 -> V23 ° S1? -> NP12° VP2?

  34. Problem with Top-Down Parsing • Left Recursion • Suppose you have A-> AB rule. Then we will have the expansion as follows: • ((A)K) -> ((AB)K) -> ((ABB)K) ……..

  35. Combining top-down and bottom-up strategies

  36. Top-Down Bottom-Up Chart Parsing • Combines advantages of top-down & bottom-up parsing. • Does not work in case of left recursion. • e.g. – “People laugh” • People – noun, verb • Laugh – noun, verb • Grammar – S  NP VP NP  DT N | N VP  V ADV | V

  37. Transitive Closure People laugh 1 2 3 S NP VP NP N VP  V  NP DT N S  NPVP S  NP VP  NP N VP V ADV success VP V

  38. Arcs in Parsing • Each arc represents a chart which records • Completed work (left of ) • Expected work (right of )

  39. Example People laugh loudly 1 2 3 4 S  NP VP NP  N VP  V VP  V ADV NP  DT N S  NPVP VP  VADV S  NP VP NP  N VP V ADV S  NP VP VP V

  40. Dealing With Structural Ambiguity • Multiple parses for a sentence • The man saw the boy with a telescope. • The man saw the mountain with a telescope. • The man saw the boy with the ponytail. At the level of syntax, all these sentences are ambiguous. But semantics can disambiguate 2nd & 3rd sentence.

  41. Prepositional Phrase (PP) Attachment Problem V – NP1 – P – NP2 (Here P means preposition) NP2 attaches to NP1 ? or NP2 attaches to V ?

  42. Parse Trees for a Structurally Ambiguous Sentence Let the grammar be – S  NP VP NP  DT N | DT N PP PP  P NP VP  V NP PP | V NP For the sentence, “I saw a boy with a telescope”

  43. Parse Tree - 1 S NP VP N V NP Det N PP saw I a P NP boy Det N with a telescope

  44. Parse Tree -2 S NP VP PP N V NP P NP Det N saw I Det N with a boy a telescope

More Related