Skip to main content
Conference Proceedings

Approximate VLDC pattern matching in shared-forest

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2004 483-494
DOI: 10.1007/3-540-44686-9_48
2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a matching-based proposal intended to deal with querying for structured text databases. Our approach extends approximate vldc matching techniques by allowing a query to exploit sharing of common parts between patterns used to index the document.

Cite

CITATION STYLE

APA

Vilares, M., Ribadas, F. J., & Darriba, V. M. (2001). Approximate VLDC pattern matching in shared-forest. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2004, pp. 483–494). Springer Verlag. https://doi.org/10.1007/3-540-44686-9_48

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free