Automatic cost estimation for Tree Edit Distance using Particle Swarm Optimization

ACL-IJCNLP 2009 - Joint Conf. of the 47th Annual Meeting of the Association for Computational Linguistics and 4th Int. Joint Conf. on Natural Language Processing of the AFNLP, Proceedings of the Conf.

Volumn , Issue , 2009, Pages 289-292

  Mehdad, Yashar ^a  

^a UNIVERSITY OF TRENTO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COST ESTIMATING; FORESTRY; NATURAL LANGUAGE PROCESSING SYSTEMS; PARTICLE SWARM OPTIMIZATION (PSO); SEMANTICS; TREES (MATHEMATICS); COST BENEFIT ANALYSIS; TEXT PROCESSING;

AUTOMATIC ESTIMATION; COMPLEX PROBLEMS; COMPUTATIONAL BIOLOGY; NATURAL LANGUAGE PROCESSING; PARTICLE SWARM OPTIMIZATION ALGORITHM; RECOGNIZING TEXTUAL ENTAILMENTS; TREE EDIT DISTANCE; TREE-STRUCTURED DATA; COST ESTIMATIONS; OPERATIONS COST; SEMANTIC TREE; SYNTACTIC TREES;

COST BENEFIT ANALYSIS; FORESTRY;

EID: 77957872319     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1667583.1667672     Document Type: Conference Paper

References (10)

1. M. Bernard, L. Boyer, A. Habrard, and M. Sebban. 2008. Learning probabilistic models of tree edit distance. Pattern Recogn., 41(8):2611-2629.
2. A. Bhattacharyya. 1943. On a measure of divergence between two statistical populations defined by probability distributions. Bull. Calcutta Math. Soc., 35:99109.
3. E. Cabrio, M. Kouylekovand, and B. Magnini. 2008. Combining specialized entailment engines for rte-4. In Proceedings of TAC08, 4th PASCAL Challenges Workshop on Recognising Textual Entailment.
4. R. C. Eberhart, Y. Shi, and J. Kennedy. 2001. Swarm Intelligence. The Morgan Kaufmann Series in Artificial Intelligence.
5. D. Klein and C. D. Manning. 2003. Fast exact inference with a factored model for natural language parsing. In Advances in Neural Information Processing Systems 15, Cambridge, MA. MIT Press.
6. M. Kouylekov and B. Magnini. 2005. Recognizing textual entailment with tree edit distance algorithms. In PASCAL Challenges on RTE, pages 17-20.
7. B. Magnini, M. Kouylekov, and E. Cabrio. 2009. Edits - Edit Distance Textual Entailment Suite User Manual. Available at http://edits.fbk.eu/.
8. Y. Mehdad and B. Magnini. 2009. A word overlap baseline for the recognizing textual entailment task. Available at http://edits.fbk.eu/.
9. F. Melgani and Y. Bazi. 2008. Classification of electrocardiogram signals with support vector machines and particle swarm optimization. IEEE Transactions on Information Technology in Biomedicine, 12(5):667-677.
10. K. Zhang and D. Shasha. 1989. Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput., 18(6):1245-1262.