Tree Edit Distance as a Baseline Approach for Paraphrase Representation

• Autores: Marta Vila, Mark Dras
• Localización: Procesamiento del lenguaje natural, ISSN 1135-5948, Nº. 48, 2012, págs. 89-95
• Idioma: inglés
• Títulos paralelos:
  • Distancia de edición de árboles como caso base para la representación de la paráfrasis
• Enlaces
  • Texto completo
• Resumen
  • español

    Encontrar un formalismo adecuado para representar la paráfrasis constituye un reto para el Procesamiento del Lenguaje Natural. En este artículo, se analiza la distancia de edición de árboles como caso base para dicha representación. Los experimentos realizados utilizando Edit Distance Textual Entailment Suite muestran que, dado que la distancia de edición de árboles es una aproximación puramente sintáctica, las paráfrasis no basadas en reorganizaciones estructurales no encuentran una representación adecuada. Asimismo, muestran la necesidad de mejorar la forma como los árboles se alinean.

  • English

    Finding an adequate paraphrase representation formalism is a challenging issue in Natural Language Processing. In this paper, we analyse the performance of Tree Edit Distance as a paraphrase representation baseline. Our experiments using Edit Distance Textual Entailment Suite show that, as Tree Edit Distance consists of a purely syntactic approach, paraphrase alternations not based on structural reorganizations do not find an adequate representation. They also show that there is much scope for better modelling of the way trees are aligned.

• Referencias bibliográficas
  • Aho, Alfred V. and Jeffrey D. Ullman. 1969. Syntax directed translations and the pushdown assembler. Journal of Computer and System Sciences,...
  • Augsten, Nikolaus, Michael Böhlen, and Johann Gamper. 2010. The pq-gram distance between ordered labeled trees. ACM Transactions on Database...
  • Bille, Philip. 2003. Tree edit distance, alignment distance and inclusion. IT University Technical Report Series.
  • Casacuberta, Francisco and Enrique Vidal. 2007. Learning finite-state models for machine translation. Machine Learning, 66:69-91.
  • Chomsky, Noam. 1957. Syntactic Structures. Mouton, The Hague/Paris. Cohn, Trevor, Chris Callison-Burch, and Mirella Lapata. 2008. Constructing...
  • Dolan, William B. and Chris Brockett. 2005. Automatically constructing a corpus of sentential paraphrases. In Proceedings of the Third International...
  • Dras, Mark. 1999. Tree Adjoining Grammar and the Reluctant Paraphrasing of Text. Ph.D. thesis, Macquarie University, Australia.
  • Eisner, Jason. 2003. Learning nonisomorphic tree mappings for machine translation. In The Companion Volume to the Proceedings of the ACL,...
  • Heilman, Michael and Noah A. Smith. 2010. Tree edit models for recognizing textual entailments, paraphrases and answers to questions. In Proceedings...
  • Kouylekov, Milen and Bernardo Magnini. 2005. Recognizing textual entailment with tree edit distance. In Proceedings of the PASCAL RTE Challenge,...
  • Shasha, Dennis and Kaizhong Zhang. 1990. Fast algorithm for the unit cost editing distance between trees. Journal of Algorithms, 11:581-621.
  • Smith, David and Jason Eisner. 2006. Quasisynchronous grammars: Alignment by soft projection of syntactic dependencies. In Proceedings of...
  • Vila, Marta, M. Antònia Martí, and Horacio Rodríguez. 2011. Paraphrase concept and typology. A linguistically based and computationally oriented...
  • Wan, Stephen. 2010. Sentence Augmen- tation: A Text-to-Text Generation Component for Summarisation. Ph.D. thesis, Macquarie University, Australia.
  • Wu, Dekai. 1997. Stochastic inversion transduction grammars and bilingual parsing of parallel corpora. Computational Linguistics, 23(3):377-404.
  • Wu, Dekai. 2010. Alignment. In Nitin Indurkhya and Fred Damerau, editors, Handbook of Natural Language Processing. Chapman & Hall/CRC,...