generating disambiguating paraphrases for structurally
play

Generating Disambiguating Paraphrases for Structurally Ambiguous - PowerPoint PPT Presentation

Generating Disambiguating Paraphrases for Structurally Ambiguous Sentences Manjuan Duan, Ethan Hill, Michael White August 11-12, 2016, LAW-X The Ohio State University Department of Linguistics 1 Joint work with Manjuan& Ethan&


  1. Generating Disambiguating Paraphrases for Structurally Ambiguous Sentences Manjuan Duan, Ethan Hill, Michael White August 11-12, 2016, LAW-X The Ohio State University Department of Linguistics 1

  2. Joint work with Manjuan& Ethan& Duan& Hill& 2

  3. Introduction

  4. How can we crowd-source data for adapting parsers to new domains? • To some extent, MTurk workers can perform meaning- and form-oriented tasks such as annotating PP-attachment points, with some training (Snow et al., 2008; Jha et al., 2010) • Gerdes (2013) and Zeldes (2016) also found that it was possible to obtain fairly high quality class-sourced annotations, where students only received a modest amount of training 3

  5. How can we crowd-source data for adapting parsers to new domains? • To some extent, MTurk workers can perform meaning- and form-oriented tasks such as annotating PP-attachment points, with some training (Snow et al., 2008; Jha et al., 2010) • Gerdes (2013) and Zeldes (2016) also found that it was possible to obtain fairly high quality class-sourced annotations, where students only received a modest amount of training • In the current study, rather than annotating syntax, we use natural language clarification questions, simply asking Mturk workers to select the right paraphrase of a structurally ambiguous sentence 3

  6. Big picture: Just ask people what ambiguous sentences mean Interp 1' Para 1' AMT :' Closer'in' Silver' Sent' Parser' Realizer' Interp t' meaning?' Data' Interp 2' Para 2' 4

  7. Difference from previous studies • Aiming (ultimately) for all structural ambiguities identifiable by an automatic parser, not confined to some specific constructions (Jha et al., 2010) • AMT workers are making choices among paraphrases, not annotations, and no specific tutorial is needed 5

  8. Methods

  9. Generating disambiguating paraphrases: An illustration Reversal ¡ ✗ He stopped Godzilla with the laser � Top ¡Parse ¡ ✓ With the laser, he stopped Godzilla � stop.01 <TENSE>past,<MOOD>dcl PASS <TENSE>past,<MOOD>dcl Mod Arg1 Arg0 Arg1 Rewrite ¡ with Godzilla <NUM>sg he stop <PARTIC>pass Arg0 realize ✓ Godzilla was stopped � Arg1 Mod Arg1 Arg0 by him with the laser � Godzilla <NUM>sg laser <NUM>sg with by Arg1 Arg1 Det laser <NUM>sg he the Input ¡Sentence ¡ Det the He stopped Godzilla � with the laser � Next ¡Parse ¡ Reversal ¡ realize ✗ He stopped Godzilla with the laser � stop.01 <TENSE>past,<MOOD>dcl Arg1 Arg0 PASS <TENSE>past,<MOOD>dcl Godzilla <NUM>sg he Arg1 stop <PARTIC>pass Arg0 Mod Rewrite ¡ r e w r i t e Arg0 Arg1 with realize ✓ Godzilla with the laser � by Godzilla <NUM>sg was stopped by him � Arg1 Arg1 Mod laser <NUM>sg he with Arg1 Det laser <NUM>sg the Det the 6

  10. Generating disambiguating paraphrases: An illustration Reversal ¡ ✗ He stopped Godzilla with the laser � Top ¡Parse ¡ ✓ With the laser, he stopped Godzilla � stop.01 <TENSE>past,<MOOD>dcl PASS <TENSE>past,<MOOD>dcl Mod Arg1 Arg0 Arg1 Godzilla <NUM>sg with he stop <PARTIC>pass Arg0 realize Arg1 Mod Arg1 Arg0 laser <NUM>sg with by Godzilla <NUM>sg Arg1 Arg1 Det laser <NUM>sg he the Det the � Next ¡Parse ¡ Reversal ¡ realize ✗ He stopped Godzilla with the laser � stop.01

  11. Generating disambiguating paraphrases: An illustration Reversal ¡ ✗ He stopped Godzilla with the laser � ✓ With the laser, he stopped Godzilla � PASS <TENSE>past,<MOOD>dcl Arg1 Rewrite ¡ stop <PARTIC>pass Arg0 realize ✓ Godzilla was stopped � Mod Arg1 Arg0 by him with the laser � with by Godzilla <NUM>sg Arg1 Arg1 laser <NUM>sg he Det the Reversal ¡ e z i l ✗

  12. Generating disambiguating paraphrases: An illustration Reversal ¡ ✗ He stopped Godzilla with the laser � Top ¡Parse ¡ ✓ With the laser, he stopped Godzilla � stop.01 <TENSE>past,<MOOD>dcl PASS <TENSE>past,<MOOD>dcl Mod Arg1 Arg0 Arg1 Rewrite ¡ with Godzilla <NUM>sg he stop <PARTIC>pass Arg0 realize ✓ Godzilla was stopped � Arg1 Mod Arg1 Arg0 by him with the laser � with by Godzilla <NUM>sg laser <NUM>sg Arg1 Arg1 Det laser <NUM>sg he the Input ¡Sentence ¡ Det He stopped Godzilla � the with the laser � Next ¡Parse ¡ Reversal ¡ realize ✗ He stopped Godzilla with the laser � stop.01 <TENSE>past,<MOOD>dcl Arg1 Arg0 PASS <TENSE>past,<MOOD>dcl Godzilla <NUM>sg he Arg1 stop <PARTIC>pass Arg0 Mod Rewrite ¡ rewrite Arg0 Arg1 with realize ✓ Godzilla with the laser � by Godzilla <NUM>sg was stopped by him � Arg1 Arg1 Mod laser <NUM>sg he with Arg1 Det laser <NUM>sg the Det the

  13. ✗ Generating disambiguating paraphrases: An illustration � Next ¡Parse ¡ Reversal ¡ realize ✗ He stopped Godzilla with the laser � stop.01 <TENSE>past,<MOOD>dcl Arg1 Arg0 PASS <TENSE>past,<MOOD>dcl Godzilla <NUM>sg he Arg1 stop <PARTIC>pass Arg0 Mod Rew rewrite Arg0 Arg1 realize with ✓ Godzilla w by Godzilla <NUM>sg was stoppe Arg1 Arg1 Mod laser <NUM>sg he with Arg1 Det laser <NUM>sg the Det the

  14. ✗ Generating disambiguating paraphrases: An illustration Reversal ¡ realize ✗ He stopped Godzilla with the laser � PASS <TENSE>past,<MOOD>dcl Arg1 stop <PARTIC>pass Arg0 Rewrite ¡ rewrite Arg0 Arg1 realize ✓ Godzilla with the laser � by Godzilla <NUM>sg was stopped by him � Arg1 Mod he with Arg1 laser <NUM>sg Det the

  15. Obtaining meaningfully distinct parses 1. Parse the input sentence with the OpenCCG parser to obtain its top 25 parses 2. Find a parse from the n -best parse list which is meaningfully distinct from the top parse: 8

  16. Obtaining meaningfully distinct parses 1. Parse the input sentence with the OpenCCG parser to obtain its top 25 parses 2. Find a parse from the n -best parse list which is meaningfully distinct from the top parse: • Only compare the unlabeled and unordered dependencies from the two parses • The symmetric difference cannot be empty, with neither set of dependencies a superset of the other 8

  17. Obtaining meaningfully distinct parses 1. Parse the input sentence with the OpenCCG parser to obtain its top 25 parses 2. Find a parse from the n -best parse list which is meaningfully distinct from the top parse: • Only compare the unlabeled and unordered dependencies from the two parses • The symmetric difference cannot be empty, with neither set of dependencies a superset of the other • Ambiguities involving only POS, named entity or word sense differences are disregarded 8

  18. Obtaining meaningfully distinct parses 1. Parse the input sentence with the OpenCCG parser to obtain its top 25 parses 2. Find a parse from the n -best parse list which is meaningfully distinct from the top parse: • Only compare the unlabeled and unordered dependencies from the two parses • The symmetric difference cannot be empty, with neither set of dependencies a superset of the other • Ambiguities involving only POS, named entity or word sense differences are disregarded 3. If successful, this phase yields a top and next parse — the ones reflecting the greatest uncertainty 8

  19. Two ways to obtain paraphrases • Paraphrases obtained from reverse realization ( reversals ) • Able to generate paraphrases for ambiguities involving various constructions identifiable by an auto parser • Paraphrases obtained from logical form rewriting ( rewrites ) • Triggered by specific syntactic constructions such as PP-attachment ambiguity and modifier scope ambiguity in coordination 9

  20. Validating reverse realizations Need to ensure paraphrases actually disambiguate intended meanings 10

  21. Validating reverse realizations Need to ensure paraphrases actually disambiguate intended meanings 1. Realize the top and next parse into a n -best realization list ( n =25), using OpenCCG 2. Traverse the list to find a qualifying paraphrase, which has to • be different from the original sentence • have different relative distance among the words involving the ambiguity from the original sentence 10

  22. Validating reverse realizations Need to ensure paraphrases actually disambiguate intended meanings 1. Realize the top and next parse into a n -best realization list ( n =25), using OpenCCG 2. Traverse the list to find a qualifying paraphrase, which has to • be different from the original sentence • have different relative distance among the words involving the ambiguity from the original sentence 3. Parse each candidate paraphrase to make sure the most likely interpretation includes the dependencies from which it was generated 10

  23. Two-sided paraphrases and one-sided paraphrases • Two-sided paraphrases : Two paraphrases are obtained for the original sentence, one generated from the top parse, and one from the next • One-sided paraphrases : Only one paraphrase is obtained for the original sentence 11

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