A syntactic approach for searching similarities within sentences

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2002, Pages 635-637

  Mandreoli, Federica ^a   Martoglia, Riccardo ^a   Tiberio, Paolo ^a  

^a UNIVERSITY OF MODENA AND REGGIO EMILIA   (Italy)

Author keywords

Sentence similarity measure; Sequence matching

Indexed keywords

DATA REDUCTION; DATABASE SYSTEMS; FORMAL LOGIC; INFORMATION RETRIEVAL; KNOWLEDGE REPRESENTATION; SEQUENTIAL MACHINES; TEXT PROCESSING;

APPROXIMATE SUBSEQUENCE MATCHING; SENTENCE SIMILARITY MEASURE; TEXTUAL DATA;

SYNTACTICS;

EID: 0038156162     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/584792.584904     Document Type: Conference Paper

References (8)

1. R. Baeza-Yates and G. Gonnet. A Fast Algorithm on Average for All-Against-All Sequence Matching. In Proc. of the Int'l Workshop and Symposium on String Processing and Information Retrieval (SPIRE), pages 16-23, 1999.
2. A. Cobbs. Fast Approximate Matching Using Suffix Trees. In Proc. of the 6th Int'l Symposium on Combinatorial Pattern Matching (CPM), pages 41-51, 1995.
3. C. Faloutsos, M. Ranganathan, and Y. Manolopoulos. Fast Subsequence Matching in Time-Series Databases. In Proc. of the 1994 ACM SIGMOD Int'l Conf. on Management of Data, pages 419-429, 1994.
4. L. Gravano, P. Ipeirotis, H. Jagadish, N. Koudas, S. Muthukrishnan, and D. Srivastava. Approximate String Joins in a Database (Almost) for Free. In Proc. of 27th Int'l Conf. on Very Large DataBases (VLDB), 2001.
5. T. Kahveci and A. Singh. Variable Length Queries for Time Series Data. In Proc. of the 17th Int'l Conf. on Data Engineering (ICDE), pages 273-282, 2001.
6. G. Navarro. A guided tour to approximate string matching. ACM Computing Surveys, 33(1):31-88, 2001.
7. G. Navarro and R. Baeza-Yatesa. New and faster filters for multiple approximate string matching. Random Structures and Algorithms, 20(1):23-49, 2002.
8. C. Rick. A New Flexible Algorithm for the Longest Common Subsequence Problem. Technical report, University of Bonn. Computer Science Department IV, 1994.