Efficient search for transformation-based inference

50th Annual Meeting of the Association for Computational Linguistics, ACL 2012 - Proceedings of the Conference

Volumn 1, Issue , 2012, Pages 283-291

  Stern, Asher ^a   Stern, Roni ^b   Dagan, Ido ^a   Felner, Ariel ^b  

^a BAR ILAN UNIVERSITY   (Israel)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EVALUATION FUNCTION; EXPANSION METHODS; OPEN SOURCE SYSTEM; PROOF QUALITY; SEARCH ALGORITHMS; SEARCH EFFICIENCY; SEARCH PROBLEM;

ALGORITHMS; COMPUTATIONAL LINGUISTICS; QUALITY CONTROL;

INFERENCE ENGINES;

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

References (29)

1. Roy Bar-Haim, Ido Dagan, Iddo Greental, and Eyal Shnarch. 2007. Semantic inference at the lexicalsyntactic level. In Proceedings of AAAI.
2. Philip Bille. 2005. A survey on tree edit distance and related problems. Theoretical Computer Science.
3. Adi Botea, Markus Enzenberger, Martin M̈uller, and Jonathan Schaeffer. 2005. Macro-FF: Improving ai planning with automatically learned macro-operators. J. Artif. Intell. Res. (JAIR), 24:581-621.
4. Vadim Bulitko and Mitja Lustrek. 2006. Lookahead pathology in real-time path-finding. In proceedings of AAAI.
5. Ido Dagan, Oren Glickman, and Bernardo Magnini. 2005. The pascal recognising textual entailment challenge. In Proceedings of MLCW.
6. Rodrigo de Salvo Braz, Roxana Girju, Vasin Punyakanok, Dan Roth, and Mark Sammons. 2005. An inference model for semantic entailment in natural language. In Proceedings of AAAI.
7. Christiane Fellbaum, editor. 1998. WordNet An Electronic Lexical Database. The MIT Press, May.
8. Ariel Felner, Sarit Kraus, and Richard E. Korf. 2003. KBFS: K-best-first search. Ann. Math. Artif. Intell., 39(1-2):19-39.
9. David Furcy and Sven Koenig. 2005. Limited discrepancy beam search. In proceedings of IJCAI.
10. Aria Haghighi and Dan Klein. 2009. Simple coreference resolution with rich syntactic and semantic features. In Proceedings of EMNLP.
11. Stefan Harmeling. 2009. Inferring textual entailment with a probabilistically sound calculus. Natural Language Engineering.
12. Peter E. Hart, Nils J. Nilsson, and Bertram Raphael. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, SSC-4(2):100-107.
13. Michael Heilman and Noah A. Smith. 2010. Tree edit models for recognizing textual entailments, paraphrases, and answers to questions. In Proceedings of NAACL.
14. Levente Kocsis and Csaba Szepesv́ari. 2006. Bandit based monte-carlo planning. In proceedings of ECML.
15. Richard E. Korf. 1985. Macro-operators: A weak method for learning. Artif. Intell., 26(1):35-77.
16. Richard E. Korf. 1990. Real-time heuristic search. Artif. Intell., 42(2-3):189-211.
17. Lili Kotlerman, Ido Dagan, Idan Szpektor, and Maayan Zhitomirsky-geffet. 2010. Directional distributional similarity for lexical inference. Natural Language Engineering.
18. Milen Kouylekov and Bernardo Magnini. 2005. Recognizing textual entailment with tree edit distance algorithms. In Proceedings of Pascal Challenges Workshop on Recognising Textual Entailment.
19. Dekang Lin and Patrick Pantel. 2001. DIRT - discovery of inference rules from text. In Proceedings of ACM SIGKDD Conference on Knowledge Discovery and Data Mining.
20. Yashar Mehdad. 2009. Automatic cost estimation for tree edit distance using particle swarm optimization. In Proceedings of the ACL-IJCNLP.
21. Shachar Mirkin, Roy Bar-Haim, Jonathan Berant, Ido Dagan, Eyal Shnarch, Asher Stern, and Idan Szpektor. 2009. Addressing discourse and document structure in the rte search task. In Proceedings of TAC.
22. Ira Pohl. 1970. Heuristic search viewed as path finding in a graph. Artificial Intelligence, 1(3-4):193 - 204.
23. Stuart Russell and Peter Norvig. 2010. Artificial Intelligence: A Modern Approach. Prentice-Hall, Englewood Cliffs, NJ, 3rd edition edition.
24. Asher Stern and Ido Dagan. 2011. A confidence model for syntactically-motivated entailment proofs. In Proceedings of RANLP.
25. Roni Stern, Tamar Kulberis, Ariel Felner, and Robert Holte. 2010. Using lookaheads with optimal best-first search. In proceedings of AAAI.
26. Idan Szpektor, Hristo Tanev, Ido Dagan, and Bonaventura Coppola. 2004. Scaling web-based acquisition of entailment relations. In Proceedings of EMNLP.
27. Richard Anthony Valenzano, Nathan R. Sturtevant, Jonathan Schaeffer, Karen Buro, and Akihiro Kishimoto. 2010. Simultaneously searching with multiple settings: An alternative to parameter tuning for suboptimal single-agent search algorithms. In proceedings of ICAPS.
28. Mengqiu Wang and Christopher D. Manning. 2010. Probabilistic tree-edit models with structured latent variables for textual entailment and question answering. In Proceedings of COLING.
29. Rong Zhou and Eric A. Hansen. 2005. Beam-stack search: Integrating backtracking with beam search. In proceedings of ICAPS.