Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
Computing the Edit-Distance between Unrooted Ordered Trees
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
BLEU: a method for automatic evaluation of machine translation
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
COGEX: a logic prover for question answering
NAACL '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1
Question answering passage retrieval using dependency relations
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
A survey on tree edit distance and related problems
Theoretical Computer Science
Parsing the WSJ using CCG and log-linear models
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Online large-margin training of dependency parsers
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Incorporating non-local information into information extraction systems by Gibbs sampling
ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics
Robust textual inference via graph matching
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Effectively using syntax for recognizing false entailment
HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
Learning to recognize features of valid textual entailments
HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
Learning probabilistic models of tree edit distance
Pattern Recognition
Modeling semantic containment and exclusion in natural language inference
COLING '08 Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1
EMNLP '06 Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing
A phrase-based alignment model for natural language inference
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
An inference model for semantic entailment in natural language
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Robust textual inference via learning and abductive reasoning
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Dependency-based paraphrasing for recognizing textual entailment
RTE '07 Proceedings of the ACL-PASCAL Workshop on Textual Entailment and Paraphrasing
RTE '07 Proceedings of the ACL-PASCAL Workshop on Textual Entailment and Paraphrasing
Natural logic for textual inference
RTE '07 Proceedings of the ACL-PASCAL Workshop on Textual Entailment and Paraphrasing
Quasi-synchronous grammars: alignment by soft projection of syntactic dependencies
StatMT '06 Proceedings of the Workshop on Statistical Machine Translation
Automatic cost estimation for tree edit distance using particle swarm optimization
ACLShort '09 Proceedings of the ACL-IJCNLP 2009 Conference Short Papers
Paraphrase identification as probabilistic quasi-synchronous recognition
ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 1 - Volume 1
Discriminative learning over constrained latent representations
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Tree edit models for recognizing textual entailments, paraphrases, and answers to questions
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
The PASCAL recognising textual entailment challenge
MLCW'05 Proceedings of the First international conference on Machine Learning Challenges: evaluating Predictive Uncertainty Visual Object Classification, and Recognizing Textual Entailment
Recognizing textual entailment: is word similarity enough?
MLCW'05 Proceedings of the First international conference on Machine Learning Challenges: evaluating Predictive Uncertainty Visual Object Classification, and Recognizing Textual Entailment
A probabilistic lexical model for ranking textual inferences
SemEval '12 Proceedings of the First Joint Conference on Lexical and Computational Semantics - Volume 1: Proceedings of the main conference and the shared task, and Volume 2: Proceedings of the Sixth International Workshop on Semantic Evaluation
Efficient search for transformation-based inference
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
Probabilistic finite state machines for regression-based MT evaluation
EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
Building structures from classifiers for passage reranking
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
| Hi-index | 0.00 |
A range of Natural Language Processing tasks involve making judgments about the semantic relatedness of a pair of sentences, such as Recognizing Textual Entailment (RTE) and answer selection for Question Answering (QA). A key challenge that these tasks face in common is the lack of explicit alignment annotation between a sentence pair. We capture the alignment by using a novel probabilistic model that models tree-edit operations on dependency parse trees. Unlike previous tree-edit models which require a separate alignment-finding phase and resort to ad-hoc distance metrics, our method treats alignments as structured latent variables, and offers a principled framework for incorporating complex linguistic features. We demonstrate the robustness of our model by conducting experiments for RTE and QA, and show that our model performs competitively on both tasks with the same set of general features.