Phrase similarity through the edit distance

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3180, Issue , 2004, Pages 306-317

  Vilares, Manuel ^a   Ribadas, Francisco J ^a   Vilares, Jesús ^b  

^a UNIVERSITY OF VIGO   (Spain)

^b UNIVERSITY OF A CORUÑA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; EXPERT SYSTEMS; NATURAL LANGUAGE PROCESSING SYSTEMS; PATTERN MATCHING; SEMANTICS; TREES (MATHEMATICS);

EDIT DISTANCE; GRAMMATICAL STRUCTURE; PARSE TREES; PATTERN MATCHING ALGORITHMS; SEMANTIC SIMILARITY; SENTENCE LEVEL; TERM SIMILARITY; WORK STRESS;

DYNAMIC PROGRAMMING;

EID: 33745528465     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30075-5_30     Document Type: Article

References (10)

1. K. Hammouda and M. Kamel. Phrase-based document similarity based on an index graph model. In 2002 IEEE Int. Conf. on Data Mining, pages 203-210, Maebashi, Japan, 2002.
2. M. Montes-y-Gomez, A. Gelbukh, A. Lopez-Lopez and R. Baeza-Yates Flexible Comparison of Conceptual Graphs. In 2001 Database and Expert Systems Applications, vol. 2113 of Lecture Notes in Computer Science, Springer-Verlag, 2001.
3. Dekang Lin. An information-theoretic definition of similarity. In Proc. 15th International Conf. on Machine Learning, pages 296-304, 1998.
4. G. Miller. WordNet: An online lexical database. International Journal of Lexicography, 3(4), 1990.
5. Mitchell. Machine learning and data mining. CACM: Communications of the ACM, 42, 1999.
6. Kuo-Chung Tai. The Tree-to-Tree Correction Problem. Journal of the ACM, 26(3):422-433, 1979.
7. th IEEE Int. Conf. on Computer Languages, pages 241-252, Toulouse, France, 1994.
8. M. Vilares, F.J. Ribadas, and V.M. Darriba. Approximate pattern matching in shared-forest. Lecture Notes in Computer Science, 1873:322-333, 2000.
9. R.A. Wagner and M.J. Fischer. The string to string correction problem. Journal of the ACM, 21(1):168-173, 1974.
10. K. Zhang, D. Shasha, and J.T.L. Wang. Approximate tree matching in the presence of variable length don't cares. Journal of Algorithms, 16(1):33-66, January 1994.