Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
Introduction to statistical pattern recognition (2nd ed.)
Introduction to statistical pattern recognition (2nd ed.)
The Tree-to-Tree Correction Problem
Journal of the ACM (JACM)
Swarm intelligence
A Probabilistic Approach to Learning Costs for Graph Edit Distance
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 3 - Volume 03
Learning probabilistic models of tree edit distance
Pattern Recognition
IEEE Transactions on Information Technology in Biomedicine
An optimal decomposition algorithm for tree edit distance
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Natural language inference for arabic using extended tree edit distance with subtrees
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
This paper introduces a new method to improve tree edit distance approach to textual entailment recognition, using particle swarm optimization. Currently, one of the main constraints of recognizing textual entailment using tree edit distance is to tune the cost of edit operations, which is a difficult and challenging task in dealing with the entailment problem and datasets. We tried to estimate the cost of edit operations in tree edit distance algorithm automatically, in order to improve the results for textual entailment. Automatically estimating the optimal values of the cost operations over all RTE development datasets, we proved a significant enhancement in accuracy obtained on the test sets.