Optimizing textual entailment recognition using particle swarm optimization

TextInfer 2009 - 2009 Workshop on Applied Textual Inference at the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP, ACL-IJCNLP 2009 - Proceedings

Volumn , Issue , 2009, Pages 36-43

  Mehdad, Yashar ^a   Magnini, Bernardo ^b  

^a UNIVERSITY OF TRENTO   (Italy)

^b FONDAZIONE BRUNO KESSLER   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

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

COST OPERATIONS; DISTANCE ALGORITHM; OPTIMAL VALUES; RECOGNIZING TEXTUAL ENTAILMENTS; TEST SETS; TEXTUAL ENTAILMENT; TREE EDIT DISTANCE;

TEXT PROCESSING;

EID: 77958540485     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Marc Bernard, Laurent Boyer, Amaury Habrard, and Marc 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. Elena Cabrio, Milen Kouylekovand, and Bernardo Magnini. 2008. Combining specialized entailment engines for rte-4. In Proceedings of TAC08, 4th PASCAL Challenges Workshop on Recognising Textual Entailment.
4. Pablo Cingolani. 2005. Jswarm-pso: Particle swarm optimization package. Available at http://jswarmpso.sourceforge.net/.
5. Ido Dagan and Oren Glickman. 2004. Probabilistic textual entailment: Generic applied modeling of language variability. In Proceedings of the PASCAL Workshop of Learning Methods for Text Understanding and Mining.
6. E. Demaine, S. Mozes, B. Rossman, and O. Weimann. 2007. An optimal decomposition algorithm for tree edit distance. In Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP), pages 146-157.
7. Russell C. Eberhart, Yuhui Shi, and James Kennedy. 2001. Swarm Intelligence. The Morgan Kaufmann Series in Artificial Intelligence. Morgan Kaufmann.
8. Keinosuke Fukunaga. 1990. Introduction to statistical pattern recognition (2nd ed.). Academic Press Professional, Inc., San Diego, CA, USA.
9. Dan Klein and Christopher D. Manning. 2003. Fast exact inference with a factored model for natural language parsing. In Advances in Neural Information Processing Systems 15, pages 3-10, Cambridge, MA. MIT Press.
10. Philip N. Klein. 1998. Computing the edit-distance between unrooted ordered trees. In ESA'98: Proceedings of the 6th Annual European Symposium on Algorithms, pages 91-102, London, UK. Springer-Verlag.
11. Milen Kouylekov and Bernardo Magnini. 2005. Recognizing textual entailment with tree edit distance algorithms. In PASCAL Challenges on RTE, pages 17-20.
12. Milen Kouylekov and Bernardo Magnini. 2006. Tree edit distance for recognizing textual entailment: Estimating the cost of insertion. In PASCAL RTE-2 Challenge.
13. Bernardo Magnini, Milen Kouylekov, and Elena Cabrio. 2009. Edits - edit distance textual entailment suite user manual. Available at http://edits.fbk.eu/.
14. Yashar Mehdad and Bernardo Magnini. 2009. A word overlap baseline for the recognizing textual entailment task. Available at http://edits.fbk.eu/.
15. Farid Melgani and Yakoub 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.
16. Michel Neuhaus and Horst Bunke. 2004. A probabilistic approach to learning costs for graph edit distance. In ICPR'04, pages 389-393, Washington, DC, USA. IEEE Computer Society.
17. C. C. Reyes-Aldasoro and A. Bhalerao. 2006. The bhattacharyya space for feature selection and its application to texture segmentation. Pattern Recogn., 39(5):812-826.
18. Stanley M. Selkow. 1977. The tree-to-tree editing problem. Inf. Process. Lett., 6(6):184-186.
19. Kuo-Chung Tai. 1979. The tree-to-tree correction problem. J. ACM, 26(3):422-433.
20. 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.