Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3944))

Included in the following conference series:

Abstract

The PASCAL Challenge’s textual entailment recognition task, or RTE, presents intriguing opportunities to test various implications of the strong language universal constraint posited by Wu’s (1995, 1997) Inversion Transduction Grammar (ITG) hypothesis. The ITG Hypothesis provides a strong inductive bias, and has been repeatedly shown empirically to yield both efficiency and accuracy gains for numerous language acquisition tasks. Since the RTE challenge abstracts over many tasks, it invites meaningful analysis of the ITG Hypothesis across tasks including information retrieval, comparable documents, reading comprehension, question answering, information extraction, machine translation, and paraphrase acquisition. We investigate two new models for the RTE problem that employ simple generic Bracketing ITGs. Experimental results show that, even in the absence of any thesaurus to accommodate lexical variation between the Text and the Hypothesis strings, surprisingly strong results for a number of the task subsets are obtainable from the Bracketing ITG’s structure matching bias alone.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Chiang, D.: A hierarchical phrase-based model for statistical machine translation. In: 43rd Annual Meeting of the Association for Computational Linguistics (ACL 2005), Ann Arbor, pp. 263–270 (2005)

    Google Scholar 

  • Dagan, I., Glickman, O., Magnini, B.: The PASCAL Recognising Textual Entailment Challenge. In: PASCAL Challenges Workshop on Recognising Textual Entailment, Southampton, UK (2005)

    Google Scholar 

  • Leusch, G., Ueffing, N., Ney, H.: A novel string-to-string distance measure with applications to machine translation evaluation. In: Machine Translation Summit, New Orleans (2003)

    Google Scholar 

  • Lewis, P.M., Stearns, R.E.: Syntax-directed transduction. Journal of the Association for Computing Machinery 15, 465–488 (1968)

    Article  MATH  Google Scholar 

  • Vilar, J.M., Vidal, E.: A recursive statistical translation model. In: ACL-2005 Workshop on Building and Using Parallel Texts, Ann Arbor, pp. 199–207 (2005)

    Google Scholar 

  • Wu, D.: An algorithm for simultaneously bracketing parallel texts by aligning words. In: 33rd Annual Meeting of the Association for Computational Linguistics Conference (ACL 1995), Cambridge, MA. Association for Computational Linguistics (1995)

    Google Scholar 

  • Wu, D.: Trainable coarse bilingual grammars for parallel text bracketing. In: 3rd Annual Workshop on Very Large Corpora (WVLC-3), Cambridge, MA, pp. 69–81 (1995); Also in Armstrong, S., Church, K.W., Isabelle, P., Tzoukermann, S.M.E., Yarowsky, D. (eds.) Natural Language Processing Using Very Large Corpora. Kluwer, Dordrecht (November 1999) ISBN 0-7923-6055-9

    Google Scholar 

  • Wu, D.: Stochastic inversion transduction grammars and bilingual parsing of parallel corpora. Computational Linguistics 23 (1997)

    Google Scholar 

  • Wu, D.: Alignment. In: Dale, R., Moisl, H., Somers, H. (eds.) Handbook of Natural Language Processing, pp. 415–458. Marcel Dekker, New York (2000)

    Google Scholar 

  • Wu, D., Fung, P.: Inversion transduction grammar constraints for mining parallel sentences from quasi-comparable corpora. In: Dale, R., Wong, K.-F., Su, J., Kwong, O.Y. (eds.) IJCNLP 2005. LNCS (LNAI), vol. 3651, pp. 257–268. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  • Yamada, K., Knight, K.: A syntax-based statistical translation model. In: 39th Annual Meeting of the Association for Computational Linguistics Conference (ACL 2001), Toulouse, France. Association for Computational Linguistics (2001)

    Google Scholar 

  • Zens, R., Ney, H.: A comparative study on reordering constraints in statistical machine translation, Hong Kong, pp. 192–202 (2003)

    Google Scholar 

  • Zens, R., Ney, H., Watanabe, T., Sumita, E.: Reordering constraints for phrase-based statistical machine translation. In: Proceedings of COLING, Geneva (2004)

    Google Scholar 

  • Zhang, H., Gildea, D.: Syntax-based alignment: Supervised or unsupervised? In: Proceedings of COLING, Geneva (2004)

    Google Scholar 

  • Zhang, H., Gildea, D.: Stochastic lexicalized inversion transduction grammar for alignment. In: 43rd Annual Meeting of the Association for Computational Linguistics (ACL-2005), Ann Arbor, pp. 475–482 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, D. (2006). Textual Entailment Recognition Using Inversion Transduction Grammars. In: Quiñonero-Candela, J., Dagan, I., Magnini, B., d’Alché-Buc, F. (eds) Machine Learning Challenges. Evaluating Predictive Uncertainty, Visual Object Classification, and Recognising Tectual Entailment. MLCW 2005. Lecture Notes in Computer Science(), vol 3944. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11736790_17

Download citation

  • DOI: https://doi.org/10.1007/11736790_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33427-9

  • Online ISBN: 978-3-540-33428-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics