Semantic similarity between sentences through approximate tree matching

Authors:
Francisco Jose Ribadas;Manuel Vilares;Jesus Vilares
Affiliations:
Computer Science Dept, Univ. of Vigo, Ourense, Spain;Computer Science Dept, Univ. of Vigo, Ourense, Spain;Computer Science Dept, Univ. of A Coruña, A Coruña, Spain
Venue:
IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part II
Year:
2005

Citing 4
Cited 2

Approximate tree matching in the presence of variable length don't cares

Journal of Algorithms
Experiments on using semantic distances between words in image caption retrieval

SIGIR '96 Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval
The String-to-String Correction Problem

Journal of the ACM (JACM)
An Information-Theoretic Definition of Similarity

ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning

Sentence Similarity Based on Semantic Nets and Corpus Statistics

IEEE Transactions on Knowledge and Data Engineering
Automatic acquisition of semantic-based question reformulations for question answering

CICLing'06 Proceedings of the 7th international conference on Computational Linguistics and Intelligent Text Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe an algorithm to measure the similarity between sentences, integrating the edit distance between trees and single-term similarity techniques, and also allowing the pattern to be defined approximately, omitting some structural details. A technique of this kind is of interest in a variety of applications, such as information extraction/retrieval or question answering, where error-tolerant recognition allows incomplete sentences to be integrated in the computation process.