type driven incremental semantic parsing with polymorphism
play

Type-driven Incremental Semantic Parsing with Polymorphism Kai - PowerPoint PPT Presentation

Type-driven Incremental Semantic Parsing with Polymorphism Kai Zhao and Liang Huang City University of New York The Problem weakly supervised semantic fully supervised semantic parsing parsing aka. parsing from Q/A pairs


  1. Type-driven Incremental Semantic Parsing with Polymorphism Kai Zhao and Liang Huang City University of New York

  2. The Problem • weakly supervised semantic • fully supervised semantic parsing parsing • aka. parsing from Q/A pairs • analogous to MT Input Input What states border Texas? What states border Texas? Output Output λ x.state(x) ∧ borders(x, texas) {LA,AR,OK,NM}

  3. The Problem • fully supervised semantic parsing • analogous to MT Input What states border Texas? Output λ x.state(x) ∧ borders(x, texas)

  4. The Problem • fully supervised semantic parsing • analogous to MT Input What states border Texas? Output λ x.state(x) ∧ borders(x, texas)

  5. Challenges • Unknown Derivation • Use Latent Variable • Unknown Grammar • i.e., English phrases <-> predicates • Learn both derivation & grammar

  6. Related Work • Kwiatkowski et al., 2013 • learn from Q/A pairs • based on CCG • CKY parsing => underspecified semantics • Structural transform to match underspecified semantics to known predicates • collapse/expand underspecified predicates

  7. Our Work • incremental parsing (aka shift-reduce) • abandon CCG, use type to guide parsing • subtyping hierarchy and polymorphic functions • simultaneous grounding

  8. Decoding Type-driven Incremental Parsing • Stack + Queue • Actions: • SHIFT : pop a word from queue, push its grounded • semantic expr. onto stack use templates triggered by POS tags/patterns • REDUCE : function application ( type-driven ) • SKIP •

  9. A Running Example Queue: What is the capital of the largest state by area ? WP VBZ DT NN IN DT JJS NN IN NN Stack Type Constraints φ

  10. A Running Example Queue: What is the capital of the largest state by area ? WP VBZ DT NN IN DT JJS NN IN NN SKIP Stack Type Constraints φ

  11. A Running Example Queue: What is the capital of the largest state by area ? WP VBZ DT NN IN DT JJS NN IN NN SKIP Stack Type Constraints φ

  12. A Running Example What is the capital of the largest state by area ? WP VBZ DT NN IN DT JJS NN IN NN SKIP the Queue: capital … Stack Type Constraints φ

  13. A Running Example What is the capital of the largest state by area ? WP VBZ DT NN IN DT JJS NN IN NN SHIFT capital Queue: of … Stack Type Constraints λ P : ' c . ( λ x : ' b . ( P x )) b → '

  14. A Running Example What is the capital of the largest state by area ? WP VBZ DT NN IN DT JJS NN IN NN SHIFT capital Queue: of … Stack Type Constraints λ P : ' c . ( λ x : ' b . ( P x )) b → ' capital : st → ct

  15. A Running Example What is the capital of the largest state by area ? WP VBZ DT NN IN DT JJS NN IN NN SHIFT capital Queue: of … Stack Type Constraints λ x : ' b . ( capital : st → ct x ) st → ct < : ' b → ' c

  16. A Running Example What is the capital of the largest state by area ? WP VBZ DT NN IN DT JJS NN IN NN SHIFT capital Queue: of … Stack Type Constraints ' b < : st λ x : ' b . ( capital : st → ct x )

  17. A Running Example What is the capital of the largest state by area ? WP VBZ DT NN IN DT JJS NN IN NN SKIP of Queue: the … Stack Type Constraints ' b < : st λ x : ' b . ( capital : st → ct x )

  18. A Running Example What is the capital of the largest state by area ? WP VBZ DT NN IN DT JJS NN IN NN SKIP the Queue: largest … Stack Type Constraints ' b < : st λ x : ' b . ( capital : st → ct x )

  19. A Running Example What is the capital of the largest state by area ? WP VBZ DT NN IN DT JJS NN IN NN SHIFT largest Queue: state … Stack Type Constraints ' b < : st λ x : ' b . ( capital : st → ct x ) λ P : ( ' a → t ) → ( ' a → i ) → ' a . λ x : ' a → t . λ y : ' a → i . ( P x y )

  20. A Running Example What is the capital of the largest state by area ? WP VBZ DT NN IN DT JJS NN IN NN SHIFT largest Queue: state … Stack Type Constraints ' b < : st λ x : ' b . ( capital : st → ct x ) λ P : ( ' a → t ) → ( ' a → i ) → ' a . λ x : ' a → t . λ y : ' a → i . ( P x y ) argmax : ( ' b → t ) → ( ' b → i ) → ' b

  21. A Running Example What is the capital of the largest state by area ? WP VBZ DT NN IN DT JJS NN IN NN SHIFT largest Queue: state … Stack Type Constraints ' b < : st λ x : ' b . ( capital : st → ct x ) λ x : ' a → t . λ y : ' a → i . ( ' b → t ) → ( ' b → i ) → ' b < : ( argmax : ( ' a → t ) → ( ' a → i ) → ' a ( ' a → t ) → ( ' a → i ) → ' a x y )

  22. A Running Example What is the capital of the largest state by area ? WP VBZ DT NN IN DT JJS NN IN NN SHIFT largest Queue: state … Stack Type Constraints ' b < : st λ x : ' b . ( capital : st → ct x ) λ x : ' a → t . λ y : ' a → i . ( argmax : ( ' a → t ) → ( ' a → i ) → ' a x y )

  23. A Running Example What is the capital of the largest state by area ? WP VBZ DT NN IN DT JJS NN IN NN SHIFT state Queue: by … Stack Type Constraints ' b < : st λ x : ' b . ( capital : st → ct x ) λ x : ' a → t . λ y : ' a → i . ( argmax : ( ' a → t ) → ( ' a → i ) → ' a x y ) λ x : ' c . ( state : st → t x ) ' c < : st

  24. A Running Example What is the capital of the largest state by area ? WP VBZ DT NN IN DT JJS NN IN NN SHIFT state Queue: by … Stack Type Constraints ' b < : st λ x : ' b . ( capital : st → ct x ) λ x : ' a → t . λ y : ' a → i . ' c < : st ( argmax : ( ' a → t ) → ( ' a → i ) → ' a x y ) λ x : ' c . ( state : st → t x )

  25. A Running Example What is the capital of the largest state by area ? WP VBZ DT NN IN DT JJS NN IN NN SHIFT state Queue: by … Stack Type Constraints ' b < : st λ x : ' b . ( capital : st → ct x ) λ y : ' a → i . ( argmax : ( ' a → t ) → ( ' a → i ) → ' a ' c < : st λ x : ' c . ( state : st → t x ) y ) ' c → t < : ' a → t

  26. A Running Example What is the capital of the largest state by area ? WP VBZ DT NN IN DT JJS NN IN NN SHIFT state Queue: by … Stack Type Constraints ' b < : st λ x : ' b . ( capital : st → ct x ) λ y : ' a → i . ( argmax : ( ' a → t ) → ( ' a → i ) → ' a ' c < : st λ x : ' c . ( state : st → t x ) y ) ' a < : ' c

  27. A Running Example What is the capital of the largest state by area ? WP VBZ DT NN IN DT JJS NN IN NN SKIP by Queue: area … Stack Type Constraints ' b < : st λ x : ' b . ( capital : st → ct x ) λ y : ' a → i . ( argmax : ( ' a → t ) → ( ' a → i ) → ' a ' c < : st λ x : ' c . ( state : st → t x ) y ) ' a < : ' c

  28. A Running Example What is the capital of the largest state by area ? WP VBZ DT NN IN DT JJS NN IN NN SHIFT area Queue: φ Stack Type Constraints ' b < : st λ x : ' b . ( capital : st → ct x ) λ y : ' a → i . ( argmax : ( ' a → t ) → ( ' a → i ) → ' a ' c < : st λ x : ' c . ( state : st → t x ) y ) ' a < : ' c λ x : ' d . ( size : lo → i x ) d < : lo '

  29. A Running Example What is the capital of the largest state by area ? WP VBZ DT NN IN DT JJS NN IN NN REDUCE Queue: φ Stack Type Constraints ' b < : st λ x : ' b . ( capital : st → ct x ) λ y : ' a → i . ( argmax : ( ' a → t ) → ( ' a → i ) → ' a ' c < : st λ x : ' c . ( state : st → t x ) y ) ' a < : ' c λ x : ' d . ( size : lo → i x ) d < : lo '

  30. A Running Example What is the capital of the largest state by area ? WP VBZ DT NN IN DT JJS NN IN NN REDUCE Queue: φ Stack Type Constraints ' b < : st λ x : ' b . ( capital : st → ct x ) ( argmax : ( ' a → t ) → ( ' a → i ) → ' a ' c < : st ( λ x : ' c . ( state : st → t x )) ' a < : ' c ( λ y : ' d . ( size : lo → i y ))) d < : lo '

  31. A Running Example What is the capital of the largest state by area ? WP VBZ DT NN IN DT JJS NN IN NN REDUCE Queue: φ Stack Type Constraints ( capital : st → ct ( argmax : ( ' a → t ) → ( ' a → i ) → ' a ' c < : st ( λ x : ' c . ( state : st → t x )) ' a < : ' c d < : lo ' ( λ y : ' d . ( size : lo → i y ))))

  32. A Running Example What is the capital of the largest state by area ? WP VBZ DT NN IN DT JJS NN IN NN ( capital : st → ct ( argmax : ( ' a → t ) → ( ' a → i ) → ' a ' c < : st ( λ x : ' c . ( state : st → t x )) ' a < : ' c d < : lo ' ( λ y : ' d . ( size : lo → i y ))))

  33. Learning • Both derivation/Grammar are Unknown • Spurious Ambiguity • Various derivations/groundings lead to the same logical form • Latent Variable • Structured Perceptron => Latent Variable Structured Perceptron

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend