cky algorithm chomsky normal form
play

CKY Algorithm, Chomsky Normal Form Scott Farrar CLMA, University of - PowerPoint PPT Presentation

Jan 09, 2024 •155 likes •1.29k views

Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 CKY Algorithm, Chomsky Normal Form Scott Farrar CLMA, University of Washington January 13, 2010 Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  1. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 the chef eats fish with the chopsticks 0 1 2 3 4 5 6 7 0 1 [1,2] 2 3 4 5 6 Notice how the spans (e.g, [1,2]) differ from the word indices (e.g, ‘chef’, 2). Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  2. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 the chef eats fish with the chopsticks 0 1 2 3 4 5 6 7 0 DT [0,1] 1 [1,2] 2 [2,3] 3 [3,4] 4 [4,5] 5 [5,6] 6 [6,7] ‘the’ is labelled DT Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  3. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 the chef eats fish with the chopsticks 0 1 2 3 4 5 6 7 0 DT [0,1] 1 NN [1,2] 2 [2,3] 3 [3,4] 4 [4,5] 5 [5,6] 6 [6,7] ‘chef’ is labelled NN Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  4. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 the chef eats fish with the chopsticks 0 1 2 3 4 5 6 7 0 DT NP [0,2] [0,1] 1 NN [1,2] 2 [2,3] 3 [3,4] 4 [4,5] 5 [5,6] 6 [6,7] Found an NP: [0,1], [1,2] Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  5. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 the chef eats fish with the chopsticks 0 1 2 3 4 5 6 7 0 DT NP [0,2] [0,1] 1 NN [1,2] 2 VBZ [2,3] 3 [3,4] 4 [4,5] 5 [5,6] 6 [6,7] ‘eats’ is labelled VBZ Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  6. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 the chef eats fish with the chopsticks 0 1 2 3 4 5 6 7 0 DT NP [0,2] S [0,3] [0,1] 1 NN [1,2] 2 VBZ [2,3] 3 [3,4] 4 [4,5] 5 [5,6] 6 [6,7] Found an S: [0,2],[2,3] Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  7. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 the chef eats fish with the chopsticks 0 1 2 3 4 5 6 7 0 DT NP [0,2] S [0,3] [0,1] 1 NN [1,2] 2 VBZ [2,3] 3 NNS [3,4] 4 [4,5] 5 [5,6] 6 [6,7] ‘fish’ is labelled NNS Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  8. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 the chef eats fish with the chopsticks 0 1 2 3 4 5 6 7 0 DT NP [0,2] S [0,3] [0,1] 1 NN [1,2] 2 VBZ [2,3] 3 NNS,VBP [3,4] 4 [4,5] 5 [5,6] 6 [6,7] ‘fish’ is labelled VBP Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  9. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 the chef eats fish with the chopsticks 0 1 2 3 4 5 6 7 0 DT NP [0,2] S [0,3] [0,1] 1 NN [1,2] 2 VBZ VP [2,4] [2,3] 3 NNS,VBP [3,4] 4 [4,5] 5 [5,6] 6 [6,7] Found a VP: [2,3], [3,4] Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  10. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 the chef eats fish with the chopsticks 0 1 2 3 4 5 6 7 0 DT S [0,3] NP [0,2] S [0,4] [0,1] 1 NN [1,2] 2 VBZ VP [2,4] [2,3] 3 NNS,VBP [3,4] 4 [4,5] 5 [5,6] 6 [6,7] Found an S: [0,2],[2,4] Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  11. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 the chef eats fish with the chopsticks 0 1 2 3 4 5 6 7 0 DT NP [0,2] S [0,3] S [0,4] [0,1] 1 NN [1,2] 2 VBZ VP [2,4] [2,3] 3 NNS,VBP [3,4] 4 IN [4,5] 5 [5,6] 6 [6,7] ‘with’ is labelled IN Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  12. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 the chef eats fish with the chopsticks 0 1 2 3 4 5 6 7 0 DT NP [0,2] S [0,3] S [0,4] [0,1] 1 NN [1,2] 2 VBZ VP [2,4] [2,3] 3 NNS,VBP [3,4] 4 IN [4,5] 5 DT [5,6] 6 [6,7] ‘the’ is labelled DT Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  13. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 the chef eats fish with the chopsticks 0 1 2 3 4 5 6 7 0 DT NP [0,2] S [0,3] S [0,4] [0,1] 1 NN [1,2] 2 VBZ VP [2,4] [2,3] 3 NNS,VBP [3,4] 4 IN [4,5] 5 DT [5,6] 6 NNS [6,7] ‘chopsticks’ is labelled NNS Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  14. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 the chef eats fish with the chopsticks 0 1 2 3 4 5 6 7 0 DT NP [0,2] S [0,3] S [0,4] [0,1] 1 NN [1,2] 2 VBZ VP [2,4] [2,3] 3 NNS,VBP [3,4] 4 IN [4,5] 5 DT [5,6] NP [5,7] 6 NNS [6,7] Found an NP: [5,6], [6,7] Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  15. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 the chef eats fish with the chopsticks 0 1 2 3 4 5 6 7 0 DT NP [0,2] S [0,3] S [0,4] [0,1] 1 NN [1,2] 2 VBZ VP [2,4] [2,3] 3 NNS,VBP [3,4] 4 IN [4,5] PP [4,7] 5 DT [5,6] NP [5,7] 6 NNS [6,7] Found a PP: [4,5],[5,7] Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  16. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 the chef eats fish with the chopsticks 0 1 2 3 4 5 6 7 0 DT NP [0,2] S [0,3] S [0,4] [0,1] 1 NN [1,2] 2 VBZ VP [2,4] [2,3] 3 NNS,VBP VP [3,7] [3,4] 4 IN [4,5] PP [4,7] 5 DT [5,6] NP [5,7] 6 NNS [6,7] Found a VP: [3,4], [4,7] Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  17. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 the chef eats fish with the chopsticks 0 1 2 3 4 5 6 7 0 DT NP [0,2] S [0,3] S [0,4] [0,1] 1 NN [1,2] 2 VP [2,4] VBZ VP [2,7] [2,3] 3 NNS,VBP VP [3,7] [3,4] 4 IN [4,5] PP [4,7] 5 DT [5,6] NP [5,7] 6 NNS [6,7] Found a VP: [2,3],[3,7] Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  18. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 the chef eats fish with the chopsticks 0 1 2 3 4 5 6 7 0 DT NP [0,2] S [0,3] S [0,4] [0,1] 1 NN [1,2] 2 VBZ VP 1 , VP 2 VP [2,4] [2,3] [2,7] 3 NNS,VBP VP [3,7] [3,4] 4 IN [4,5] PP [4,7] 5 DT [5,6] NP [5,7] 6 NNS [6,7] Found another VP: [2,4],[4,7] Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  19. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 the chef eats fish with the chopsticks 0 1 2 3 4 5 6 7 0 DT S [0,3] S [0,4] NP [0,2] S [0,7] [0,1] 1 NN [1,2] 2 VBZ VP [2,4] VP 1 , VP 2 [2,3] [2,7] 3 NNS,VBP VP [3,7] [3,4] 4 IN [4,5] PP [4,7] 5 DT [5,6] NP [5,7] 6 NNS [6,7] Found an S node: [0,2] [2,7] Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  20. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 the chef eats fish with the chopsticks 0 1 2 3 4 5 6 7 0 DT S [0,3] S [0,4] S 1 , S 2 NP [0,2] [0,1] [0,7] 1 NN [1,2] 2 VBZ VP [2,4] VP 1 , VP 2 [2,3] [2,7] 3 NNS,VBP VP [3,7] [3,4] 4 IN [4,5] PP [4,7] 5 DT [5,6] NP [5,7] 6 NNS [6,7] Found a second S node: also [0,2] [2,7] Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  21. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 the chef eats fish with the chopsticks 0 1 2 3 4 5 6 7 0 DT S [0,3] S [0,4] S 1 , S 2 NP [0,2] [0,1] [0,7] 1 NN [1,2] 2 VBZ VP [2,4] VP 1 , VP 2 [2,3] [2,7] 3 NNS,VBP VP [3,7] [3,4] 4 IN [4,5] PP [4,7] 5 DT [5,6] NP [5,7] 6 NNS [6,7] Found a second S node: also [0,2] [2,7] Recognition algorithm returns True when a root node is found in [0,n] Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  22. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 The CKY Algorithm (recognition) function CKY-Parse ( words , grammar ) returns table for j ← 1 to length( words ) do : (loop over columns) table [j-1,j] ← { A | A → words [j] ∈ grammar } (add POS) for i ← j-2 downto 0 do : (loop over rows, backwards) for k ← i+1 to j-1 do : (loop over contents of cell) table [i,j] ← table [i,j] ∪ { A | A → B C ∈ grammar , B ∈ table [i,k] C ∈ table [k,j] } Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  23. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 CKY recognition vs. parsing Returning the full parse requires storing more in a cell than just a node label. We also require back-pointers to constituents of that node. We could also store whole trees, but less space efficient. For parsing, we must add an extra step to the algorithm: Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  24. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 CKY recognition vs. parsing Returning the full parse requires storing more in a cell than just a node label. We also require back-pointers to constituents of that node. We could also store whole trees, but less space efficient. For parsing, we must add an extra step to the algorithm: follow pointers and return the parse Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  25. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 The CKY Algorithm (parsing) function CKY-Parse ( words , grammar ) returns parses for j ← 1 to length( words ) do : (loop over columns) table [j-1,j] ← for all { A | A → words [j] ∈ grammar } (add all POS) for i ← j-2 downto 0 do : (loop over rows, backwards) for k ← i+1 to j-1 do : (loop over contents of cell) for all { A | A → B C } : (all productions) back [i,j,A] ← { k,B,C } (add back pointer) return buildtree( back [1, length( words ,S]), table [1,LENGTH( words ),S] (follow back pointer) Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  26. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 Issues with CKY Efficiency The CKY can be performed in cubic time: O ( n 3 ), where n=number of words in sentence. The complexity of the inner most loop is bounded by the square of the number of non-terminals. The more rules, the less efficient; but this increases at a constant rate L = r 2 where r is the number of non-terminals. Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  27. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 Issues with CKY Grammar requirements The basic algoritm requires a binary grammar, in fact a grammar in Chomsky Normal Form. Basic algorithm can be extended to account for arbitrary CFGs. However, transforming a grammar into a CNF grammar is easier and more efficient than parsing with an arbitrary grammar. Later, we’ll look at the Earley Algorithm for parsing arbitrary CFGs. Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  28. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 Binary tree Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  29. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 Chomsky Normal Form grammar Definition CNF grammar: a context-free grammar where the RHS of each production rule is restricted to be either two non-terminals or one terminal, and no empty productions are allowed. There can be: no mixed rules ( NP → the NN ) no unit productions ( NP → NNP ), except for NN → dog no right hand sides of more than two non-terminals ( VP → VBZ NP PP ). Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  30. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 Grammar equivalence Any CFG can be converted to a weakly equivalent grammar in CNF. Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  31. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 Grammar equivalence Any CFG can be converted to a weakly equivalent grammar in CNF. Definition Weak equivalence: Two grammars are weakly equivalent if they generate the same set of strings (sentences). Transforming a grammar to CNF results in a new grammar that is weakly equivalent. Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  32. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 Grammar equivalence Any CFG can be converted to a weakly equivalent grammar in CNF. Definition Weak equivalence: Two grammars are weakly equivalent if they generate the same set of strings (sentences). Transforming a grammar to CNF results in a new grammar that is weakly equivalent. Definition Strong equivalence: Two grammars are strongly equivalent if they generate the same set of strings AND the same structures over those strings. If only the variable names are diff. then the grammar are said to be isomorphic . Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  33. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 Symbol naming conventions Use new symbols (binarization): X 1, X 2, . . . , Y 3 S → NP VP PUNC becomes: S → NP X 1, X 1 → VP PUNC Delete a symbol (unary collapsing): SBAR → S , S → NP VP becomes SBAR → NP VP Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  34. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 CNF conversion algorithm Removing unit-productions (unary collapsing): 1 while there is a unit-production A → B , Remove A → B . foreach B → u , add A → u . Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  35. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 CNF conversion algorithm Removing unit-productions (unary collapsing): 1 while there is a unit-production A → B , Remove A → B . foreach B → u , add A → u . Remove terminals from mixed rules 2 foreach production A → B 1 B 2 ... B k , containing a terminal x Add new non-terminal/production X 1 → x (unless it has already been added) Replace every B i = x with X 1 Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  36. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 CNF conversion algorithm Removing unit-productions (unary collapsing): 1 while there is a unit-production A → B , Remove A → B . foreach B → u , add A → u . Remove terminals from mixed rules 2 foreach production A → B 1 B 2 ... B k , containing a terminal x Add new non-terminal/production X 1 → x (unless it has already been added) Replace every B i = x with X 1 Remove rules with more than two nonterminals on the RHS 3 (binarization) foreach rule p of form A → B 1 B 2 ... B k replace p with A → B 1 X 1, X 1 → B 2 X 2, X 2 → B 3 X 3, ..., X ( k − 2) → B k − 1 B k ( Xi ’s are new variables.) Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  37. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 Binarization Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  38. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 A sample CFG S → NP VP PUNC Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  39. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 A sample CFG S → NP VP PUNC (non-binary) Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  40. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 A sample CFG S → NP VP PUNC (non-binary) S → S and S Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  41. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 A sample CFG S → NP VP PUNC (non-binary) S → S and S (mixed) Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  42. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 A sample CFG S → NP VP PUNC (non-binary) S → S and S (mixed) NP → DT NP Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  43. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 A sample CFG S → NP VP PUNC (non-binary) S → S and S (mixed) NP → DT NP (OK) Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  44. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 A sample CFG S → NP VP PUNC (non-binary) S → S and S (mixed) NP → DT NP (OK) NP → NN Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  45. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 A sample CFG S → NP VP PUNC (non-binary) S → S and S (mixed) NP → DT NP (OK) NP → NN (unit production) Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  46. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 A sample CFG S → NP VP PUNC (non-binary) S → S and S (mixed) NP → DT NP (OK) NP → NN (unit production) NN → dog Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  47. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 A sample CFG S → NP VP PUNC (non-binary) S → S and S (mixed) NP → DT NP (OK) NP → NN (unit production) NN → dog (OK) Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  48. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 A sample CFG S → NP VP PUNC (non-binary) S → S and S (mixed) NP → DT NP (OK) NP → NN (unit production) NN → dog (OK) NN → cat Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  49. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 A sample CFG S → NP VP PUNC (non-binary) S → S and S (mixed) NP → DT NP (OK) NP → NN (unit production) NN → dog (OK) NN → cat (OK) Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  50. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 A sample CFG S → NP VP PUNC (non-binary) S → S and S (mixed) NP → DT NP (OK) NP → NN (unit production) NN → dog (OK) NN → cat (OK) VP → VBZ NP Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  51. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 A sample CFG S → NP VP PUNC (non-binary) S → S and S (mixed) NP → DT NP (OK) NP → NN (unit production) NN → dog (OK) NN → cat (OK) VP → VBZ NP (OK) Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  52. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 A sample CFG S → NP VP PUNC (non-binary) S → S and S (mixed) NP → DT NP (OK) NP → NN (unit production) NN → dog (OK) NN → cat (OK) VP → VBZ NP (OK) VP → VBZ Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  53. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 A sample CFG S → NP VP PUNC (non-binary) S → S and S (mixed) NP → DT NP (OK) NP → NN (unit production) NN → dog (OK) NN → cat (OK) VP → VBZ NP (OK) VP → VBZ (unit production) Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  54. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 A sample CFG S → NP VP PUNC (non-binary) S → S and S (mixed) NP → DT NP (OK) NP → NN (unit production) NN → dog (OK) NN → cat (OK) VP → VBZ NP (OK) VP → VBZ (unit production) VBZ → sleeps Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  55. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 A sample CFG S → NP VP PUNC (non-binary) S → S and S (mixed) NP → DT NP (OK) NP → NN (unit production) NN → dog (OK) NN → cat (OK) VP → VBZ NP (OK) VP → VBZ (unit production) VBZ → sleeps (OK) Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  56. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 A sample CFG S → NP VP PUNC (non-binary) S → S and S (mixed) NP → DT NP (OK) NP → NN (unit production) NN → dog (OK) NN → cat (OK) VP → VBZ NP (OK) VP → VBZ (unit production) VBZ → sleeps (OK) VBZ → eats Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  57. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 A sample CFG S → NP VP PUNC (non-binary) S → S and S (mixed) NP → DT NP (OK) NP → NN (unit production) NN → dog (OK) NN → cat (OK) VP → VBZ NP (OK) VP → VBZ (unit production) VBZ → sleeps (OK) VBZ → eats (OK) Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  58. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 A sample CFG S → NP VP PUNC (non-binary) S → S and S (mixed) NP → DT NP (OK) NP → NN (unit production) NN → dog (OK) NN → cat (OK) VP → VBZ NP (OK) VP → VBZ (unit production) VBZ → sleeps (OK) VBZ → eats (OK) DT → the Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  59. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 A sample CFG S → NP VP PUNC (non-binary) S → S and S (mixed) NP → DT NP (OK) NP → NN (unit production) NN → dog (OK) NN → cat (OK) VP → VBZ NP (OK) VP → VBZ (unit production) VBZ → sleeps (OK) VBZ → eats (OK) DT → the (OK) Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  60. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 Conversion of CFG to CNF: Step 1 Non-CNF grammar CNF grammar Action ——————– —————- ————— Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  61. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 Conversion of CFG to CNF: Step 1 Non-CNF grammar CNF grammar Action ——————– —————- ————— NP → NN Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  62. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 Conversion of CFG to CNF: Step 1 Non-CNF grammar CNF grammar Action ——————– —————- ————— NP → NN NN → dog Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  63. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 Conversion of CFG to CNF: Step 1 Non-CNF grammar CNF grammar Action ——————– —————- ————— NP → NN NN → dog NN → cat Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  64. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 Conversion of CFG to CNF: Step 1 Non-CNF grammar CNF grammar Action ——————– —————- ————— NP → NN NN → dog NN → cat NP → dog (collapse rule) Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  65. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 Conversion of CFG to CNF: Step 1 Non-CNF grammar CNF grammar Action ——————– —————- ————— NP → NN NN → dog NN → cat NP → dog (collapse rule) NP → cat (collapse rule) Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  66. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 Conversion of CFG to CNF: Step 1 Non-CNF grammar CNF grammar Action ——————– —————- ————— NP → NN NN → dog NN → cat NP → dog (collapse rule) NP → cat (collapse rule) VP → VBZ Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  67. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 Conversion of CFG to CNF: Step 1 Non-CNF grammar CNF grammar Action ——————– —————- ————— NP → NN NN → dog NN → cat NP → dog (collapse rule) NP → cat (collapse rule) VP → VBZ VBZ → sleeps Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  68. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 Conversion of CFG to CNF: Step 1 Non-CNF grammar CNF grammar Action ——————– —————- ————— NP → NN NN → dog NN → cat NP → dog (collapse rule) NP → cat (collapse rule) VP → VBZ VBZ → sleeps VBZ → eats Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  69. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 Conversion of CFG to CNF: Step 1 Non-CNF grammar CNF grammar Action ——————– —————- ————— NP → NN NN → dog NN → cat NP → dog (collapse rule) NP → cat (collapse rule) VP → VBZ VBZ → sleeps VBZ → eats VP → sleeps (collapse rule) VP → eats (collapse rule) Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  70. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 Conversion of CFG to CNF: Step 2 Non-CNF grammar CNF grammar Action ——————– —————- ————— Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  71. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 Conversion of CFG to CNF: Step 2 Non-CNF grammar CNF grammar Action ——————– —————- ————— S → S and S Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  72. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 Conversion of CFG to CNF: Step 2 Non-CNF grammar CNF grammar Action ——————– —————- ————— S → S and S Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  73. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 Conversion of CFG to CNF: Step 2 Non-CNF grammar CNF grammar Action ——————– —————- ————— S → S and S S → S X 1 (new symbol) Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  74. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 Conversion of CFG to CNF: Step 2 Non-CNF grammar CNF grammar Action ——————– —————- ————— S → S and S S → S X 1 (new symbol) X 1 → X 2 S (new symbol) Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  75. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 Conversion of CFG to CNF: Step 2 Non-CNF grammar CNF grammar Action ——————– —————- ————— S → S and S S → S X 1 (new symbol) X 1 → X 2 S (new symbol) X 2 → and Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

  76. Brief review CKY algorithm Chomsky Normal Form (CNF) Homework2 Conversion of CFG to CNF: Step 3 Non-CNF grammar CNF grammar Action ——————– —————- ————— Scott Farrar CLMA, University of Washington CKY Algorithm, Chomsky Normal Form

Recommend

Chomsky Normal Form We introduce Chomsky Normal Form, which is used to answer questions about

Chomsky Normal Form We introduce Chomsky Normal Form, which is used to answer questions about

Chomsky Normal Form We introduce Chomsky Normal Form, which is used to answer questions about context-free languages Chomsky Normal Form A grammar where Chomsky Normal Form. every production is either of the form A BC or A c (where A ,

601 views • 15 slides
Chomsky Normal Form Chomsky Normal Form Chomsky Normal Form A context free grammar is in

Chomsky Normal Form Chomsky Normal Form Chomsky Normal Form A context free grammar is in

Chomsky Normal Form Chomsky Normal Form Chomsky Normal Form A context free grammar is in Chomsky Normal Form (CNF) if every production is of the form: A BC A a Where A,B, and C are variables and a is a terminal.

340 views • 7 slides
4.9: Chomsky Normal Form In this section, we study a special form of grammars called Chomsky

4.9: Chomsky Normal Form In this section, we study a special form of grammars called Chomsky

4.9: Chomsky Normal Form In this section, we study a special form of grammars called Chomsky Normal Form (CNF), named for the linguist Noam Chomsky. Grammars in CNF have very nice formal properties. In particular, valid parse trees for grammars

634 views • 19 slides
Chomsky normal form (CNF) I Purpose: a simplified form of grammars Every rule must be either A

Chomsky normal form (CNF) I Purpose: a simplified form of grammars Every rule must be either A

Chomsky normal form (CNF) I Purpose: a simplified form of grammars Every rule must be either A BC or A a B , C are not start variables a so A is not allowed. September 27, 2020 1 / 10 Chomsky normal form (CNF) II

603 views • 10 slides
Bottom-Up Parsing (A First Step) CockeYoungerKasami (CYK) algorithm and Chomsky Normal

Bottom-Up Parsing (A First Step) CockeYoungerKasami (CYK) algorithm and Chomsky Normal

Bottom-Up Parsing (A First Step) CockeYoungerKasami (CYK) algorithm and Chomsky Normal Form 1 Last time Showed how to use Java CUP for getting ASTs But we never saw HOW the parser works 2 This time Dip our toe into parsing

1.39k views • 35 slides
Simplification of CFG and Normal Forms Wen-Guey Tzeng Computer Science Department National

Simplification of CFG and Normal Forms Wen-Guey Tzeng Computer Science Department National

Simplification of CFG and Normal Forms Wen-Guey Tzeng Computer Science Department National Chiao Tung University Normal Forms We want a cfg with either Chomsky or Greibach normal form Chomsky normal form A a, A BC

332 views • 30 slides
MA/CSSE 474 Theory of Computation Removing Ambiguity Chomsky Normal Form Pushdown Automata

MA/CSSE 474 Theory of Computation Removing Ambiguity Chomsky Normal Form Pushdown Automata

1/16/2012 MA/CSSE 474 Theory of Computation Removing Ambiguity Chomsky Normal Form Pushdown Automata Recap: Ambiguity A grammar is ambiguous iff there is at least one string in L ( G ) for which G produces more than one parse tree. For many

486 views • 32 slides
Last Class Recursive Descent Parsing and CYK ANLP: Lecture 13 Chomsky normal form grammars

Last Class Recursive Descent Parsing and CYK ANLP: Lecture 13 Chomsky normal form grammars

Last Class Recursive Descent Parsing and CYK ANLP: Lecture 13 Chomsky normal form grammars English syntax Shay Cohen Agreement phenomena and the way to model them with CFGs 14 October 2019 1 / 71 2 / 71 Recap: Syntax Parsing algorithms

407 views • 18 slides
CPSC 313: Chomsky Normal Form October 25, 2020 We want a simple standard format to describe the

CPSC 313: Chomsky Normal Form October 25, 2020 We want a simple standard format to describe the

CPSC 313: Chomsky Normal Form October 25, 2020 We want a simple standard format to describe the productions motivation of a grammar so that we can do proofs and constructions more readily on the grammar. We now must show that all grammars can

554 views • 5 slides
CS 301 Lecture 10 Chomsky Normal Form Stephen Checkoway February 19, 2018 1 / 23 More CFLs

CS 301 Lecture 10 Chomsky Normal Form Stephen Checkoway February 19, 2018 1 / 23 More CFLs

CS 301 Lecture 10 Chomsky Normal Form Stephen Checkoway February 19, 2018 1 / 23 More CFLs A = { a i b j c k i j or i = k } B = { w w { a , b , c } contains the same number of a s as b s and c s combined } C

1.17k views • 75 slides
Chomsky and Greibach Normal Forms Chomsky and Greibach Normal Forms p.1/24 Simplifying

Chomsky and Greibach Normal Forms Chomsky and Greibach Normal Forms p.1/24 Simplifying

Chomsky and Greibach Normal Forms Chomsky and Greibach Normal Forms p.1/24 Simplifying a CFG It is often convenient to simplify CFG Chomsky and Greibach Normal Forms p.2/24 Simplifying a CFG It is often convenient to

1.02k views • 60 slides
Homework Homework #3 returned Chomsky Normal Form Homework #4 due today Homework #5

Homework Homework #3 returned Chomsky Normal Form Homework #4 due today Homework #5

Homework Homework #3 returned Chomsky Normal Form Homework #4 due today Homework #5 Pg 169 -- Exercise 4 Pg 183 -- Exercise 4c,e,i (use JFLAP) Pg 184 -- Exercise 10 Pg 195 Exercise 5 Pg 196 Exercise 15

504 views • 9 slides
MA/CSSE 474 Theory of Computation More about Ambiguity Removal Normal Forms (Chomsky and

MA/CSSE 474 Theory of Computation More about Ambiguity Removal Normal Forms (Chomsky and

4/17/2018 MA/CSSE 474 Theory of Computation More about Ambiguity Removal Normal Forms (Chomsky and Greibach) Pushdown Automata (PDA) Intro PDA examples Your Questions? Previous class days' HW10 or 11 problems material Reading

536 views • 25 slides
Logical Form and Quantifier Raising What is Logical Form In the late 1970s, Noam Chomsky and

Logical Form and Quantifier Raising What is Logical Form In the late 1970s, Noam Chomsky and

Referat: Robert May (1977) The Syntax-Semantics Interface WS 07/08, Uni Potsdam Logical Form and Quantifier Raising What is Logical Form In the late 1970s, Noam Chomsky and Robert May developed a new, third level of syntactic representation,

184 views • 4 slides
Normal Form Games 2-12-16 Game Representations Extensive Form Game Normal Form Game

Normal Form Games 2-12-16 Game Representations Extensive Form Game Normal Form Game

Normal Form Games 2-12-16 Game Representations Extensive Form Game Normal Form Game Agents take turns Agents move simultaneously. Represented as a tree. Represented as a matrix. Internal nodes are agent decisions.

563 views • 12 slides
CKY Parsing Ling 571 Deep Processing Techniques for NLP January 12, 2011 Roadmap

CKY Parsing Ling 571 Deep Processing Techniques for NLP January 12, 2011 Roadmap

CKY Parsing Ling 571 Deep Processing Techniques for NLP January 12, 2011 Roadmap Motivation: Parsing (In) efficiency Dynamic Programming Cocke-Kasami-Younger Parsing Algorithm Chomsky Normal Form Conversion

689 views • 42 slides
COMP3630/6360: Theory of Computation Semester 1, 2020 The Australian National University Normal

COMP3630/6360: Theory of Computation Semester 1, 2020 The Australian National University Normal

COMP3630/6360: Theory of Computation Semester 1, 2020 The Australian National University Normal Forms and Closure Properties 1 / 33 This lecture covers Chapter 7 of HMU: Properties of CFLs Chomsky Normal Form Pumping Lemma for CFGs

782 views • 33 slides
Smith Normal Form and Combinatorics Richard P . Stanley Smith Normal Form and Combinatorics

Smith Normal Form and Combinatorics Richard P . Stanley Smith Normal Form and Combinatorics

Smith Normal Form and Combinatorics Richard P . Stanley Smith Normal Form and Combinatorics p. 1 Smith normal form A : n n matrix over commutative ring R (with 1) Suppose there exist P , Q GL( n, R ) such that PAQ := B = diag( d 1 ,

1.46k views • 123 slides
Normal Forms for CFGs Eliminating Useless Variables Removing Epsilon Removing Unit

Normal Forms for CFGs Eliminating Useless Variables Removing Epsilon Removing Unit

Normal Forms for CFGs Eliminating Useless Variables Removing Epsilon Removing Unit Productions Chomsky Normal Form 1 Variables That Derive Nothing Consider: S -> AB, A -> aA | a, B -> AB Although A derives all strings of

543 views • 36 slides
Theory of Computer Science C5. Context-free Languages: Normal Forms, Closure, Decidability Malte

Theory of Computer Science C5. Context-free Languages: Normal Forms, Closure, Decidability Malte

Theory of Computer Science C5. Context-free Languages: Normal Forms, Closure, Decidability Malte Helmert University of Basel April 6, 2016 Context-free Grammars and -Rules Chomsky Normal Form Closure Properties Decidability Summary

831 views • 47 slides
Polynomial time parsing of PCFGs Gerald Penn (some slides from Pi-Chuan Chang and Christopher

Polynomial time parsing of PCFGs Gerald Penn (some slides from Pi-Chuan Chang and Christopher

Polynomial time parsing of PCFGs Gerald Penn (some slides from Pi-Chuan Chang and Christopher Manning) 0. Chomsky Normal Form All rules are of the form X Y Z or X w. A transformation to this form doesnt change the weak

723 views • 48 slides
Normal Forms for Boolean Expressions A NORMAL FORM defines a class expressions s.t. a. Satisfy

Normal Forms for Boolean Expressions A NORMAL FORM defines a class expressions s.t. a. Satisfy

Normal Forms for Boolean Expressions A NORMAL FORM defines a class expressions s.t. a. Satisfy certain structural properties b. Are usually universal: able to express every boolean function 1. Disjunctive Normal Form (DNF) - Sum Of Products of

1.01k views • 68 slides
A game in normal form consists of: Set of players = {1, , } Strategy set

A game in normal form consists of: Set of players = {1, , } Strategy set

T RUTH J USTICE A LGOS Game Theory I: Basic Concepts Teachers: Ariel Procaccia (this time) and Alex Psomas NORMAL-FORM GAME A game in normal form consists of: Set of players = {1, , } Strategy set For each

239 views • 21 slides
Functional Dependencies Decompositions Normal Forms: BCNF, Third Normal Form

Functional Dependencies Decompositions Normal Forms: BCNF, Third Normal Form

Functional Dependencies Decompositions Normal Forms: BCNF, Third Normal Form Introduction to Multivalued Dependencies A poor choice of a relational database schema can lead to redundancy and related anomalies.

858 views • 64 slides

More recommend