Optimising tree edit distance with subtrees for textual entailment

Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Authors:
  • Maytham Alabbas
  • Allan Ramsay

Abstract

This paper introduces a method for improving tree edit distance (TED) for textual entailment. We explore two ways of improving TED: we extend the standard TED to use edit operations that apply to subtrees as well as to single nodes; and we use the 'artificial bee colony' algorithm (ABC) to estimate the cost of edit operations for single nodes and subtrees and to determine thresholds. The preliminary results of the current work for checking entailment between two texts are encouraging compared with the common bag-of-words, string edit distance and standard TED algorithms.

Bibliographical metadata

Original languageEnglish
Title of host publicationInternational Conference Recent Advances in Natural Language Processing, RANLP|Int. Conf. Recent Adv. Nat. Lang. Proces., RANLP
Pages9-17
Number of pages8
Publication statusPublished - 2013
Event9th International Conference on Recent Advances in Natural Language Processing, RANLP 2013 - Hissar
Event duration: 1 Jul 2013 → …

Conference

Conference9th International Conference on Recent Advances in Natural Language Processing, RANLP 2013
CityHissar
Period1/07/13 → …