Efficient approximate entity extraction with edit distance constraints

SIGMOD-PODS'09 - Proceedings of the International Conference on Management of Data and 28th Symposium on Principles of Database Systems

Volumn , Issue , 2009, Pages 759-770

  Wang, Wei ^a   Xiao, Chuan ^a   Lin, Xuemin ^a   Zhang, Chengqi ^b  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

^b UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATIVE APPROACH; APPROXIMATE MATCHES; DATA SETS; DICTIONARY MATCHING; DOCUMENT-PROCESSING; DOMAIN KNOWLEDGE; EDIT DISTANCE; GENERATION METHOD; NAMED ENTITIES; NAMED ENTITY RECOGNITION; ORDER OF MAGNITUDE; POOR PERFORMANCE; PROBLEM DEFINITION; PRUNING TECHNIQUES; RECENT TRENDS;

ALGORITHMS; CHARACTER RECOGNITION; GRAPH THEORY; NATURAL LANGUAGE PROCESSING SYSTEMS;

DATABASE SYSTEMS;

EID: 70849115286     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1559845.1559925     Document Type: Conference Paper

References (42)

1. S. Agrawal, K. Chakrabarti, S. Chaudhuri, and V. Ganti. Scalable ad-hoc entity extraction from text collections. PVLDB, 1(1):945-957, 2008.
2. E. Amitay, N. Har'El, R. Sivan, and A. Soffer. Web-awhere: geotagging web content. In SIGIR, pages 273-280, 2004.
3. A. Arasu, S. Chaudhuri, K. Ganjam, and R. Kaushik. Incorporating string transformations in record matching. In SIGMOD Conference, pages 1231-1234, 2008.
4. A. Arasu, V. Ganti, and R. Kaushik. Efficient exact set-similarity joins. In VLDB, 2006.
5. R. J. Bayardo, Y. Ma, and R. Srikant. Scaling up all pairs similarity search. In WWW, 2007.
6. P. A. Bernstein and D.-M. W. Chiu. Using semi-joins to solve relational queries. J. ACM, 28(1):25-40, 1981.
7. M. Bilenko, R. J. Mooney, W. W. Cohen, P. Ravikumar, and S. E. Fienberg. Adaptive name matching in information integration. IEEE Intelligent Sys., 18(5):16-23, 2003.
8. K. Chakrabarti, S. Chaudhuri, V. Ganti, and D. Xin. An efficient filter for approximate membership checking. In SIGMOD Conference, pages 805-818, 2008.
9. A. Chandel, O. Hassanzadeh, N. Koudas, M. Sadoghi, and D. Srivastava. Benchmarking declarative approximate selection predicates. In SIGMOD Conference, pages 353-364, 2007.
10. A. Chandel, P. C. Nagesh, and S. Sarawagi. Efficient batch top-k search for dictionary-based entity recognition. In ICDE, page 28, 2006.
11. S. Chaudhuri, B.-C. Chen, V. Ganti, and R. Kaushik. Example-driven design of efficient record matching queries. In VLDB, pages 327-338, 2007.
12. S. Chaudhuri, V. Ganti, and R. Kaushik. A primitive operator for similarity joins in data cleaning. In ICDE, 2006.
13. S. Chaudhuri, A. D. Sarma, V. Ganti, and R. Kaushik. Leveraging aggregate constraints for deduplication. In SIGMOD Conference, pages 437-448, 2007.
14. A. M. Cohen. Unsupervised gene/protein entity normalization using automatically extracted dictionaries. In Proceedings of the BioLINK2005 Workshop, 2005.
15. W. W. Cohen and S. Sarawagi. Exploiting dictionaries in named entity extraction: combining semi-markov extraction processes and data integration methods. In KDD, pages 89-98, 2004.
16. L. Gravano, P. G. Ipeirotis, H. V. Jagadish, N. Koudas, S. Muthukrishnan, and D. Srivastava. Approximate string joins in a database (almost) for free. In VLDB, 2001.
17. M. Hadjieleftheriou, A. Chandel, N. Koudas, and D. Srivastava. Fast indexes and algorithms for set similarity selection queries. In ICDE, pages 267-276, 2008.
18. M. Hadjieleftheriou, X. Yu, N. Koudas, and D. Srivastava. Hashed samples: selectivity estimators for set similarity selection queries. PVLDB, 1(1):201-212, 2008.
19. L. Jin and C. Li. Selectivity estimation for fuzzy string predicates in large data sets. In VLDB, pages 397-408 2005.
20. H. Lee, R. T. Ng, and K. Shim. Extending q-grams to estimate selectivity of string matching with low edit distance. In VLDB, pages 195-206, 2007.
21. C. Li, J. Lu, and Y. Lu. Efficient merging and filtering algorithms for approximate string searches. In ICDE, pages 257-266, 2008.
22. C. Li, B. Wang, and X. Yang. VGRAM: Improving performance of approximate queries on string collections using variable-length grams. In VLDB, 2007.
23. M. D. Lieberman, J. Sankaranarayanan, and H. Samet. A fast similarity join algorithm using graphics processing units. In ICDE, pages 1111-1120, 2008.
24. A. Mazeika, M. H. Böhlen, N. Koudas, and D. Srivastava. Estimating the selectivity of approximate string queries. ACM Trans. Database Syst., 32(2):12, 2007.
25. E. W. Myers. A sublinear algorithm for approximate keyword searching. Algorithmica, 12(4/5):345-374, 1994.
26. G. Navarro. A guided tour to approximate string matching. ACM Comput. Surv., 33(1):31-88, 2001.
27. G. Navarro, R. A. Baeza-Yates, and J. M. A. Arcoverde. Matchsimile: a flexible approximate matching tool for searching proper name. JASIST, 54(1):3-15, 2003.
28. G. Navarro, R. A. Baeza-Yates, E. Sutinen, and J. Tarhio. Indexing methods for approximate string matching. IEEE Data Eng. Bull., 24(4):19-27, 2001.
29. R. Navigli. Word sense disambiguation: A survey. ACM Comput. Surv., 41(2), 2009.
30. B.-W. On, N. Koudas, D. Lee, and D. Srivastava. Group linkage. In ICDE, pages 496-505, 2007.
31. M. Pasca. Acquisition of categorized named entities for web search. In CIKM, pages 137-145, 2004.
32. S. Sarawagi and A. Kirpal. Efficient set joins on similarity predicates. In SIGMOD, 2004.
33. B. S. T. Bocek, E. Hunt. Fast Similarity Search in Large Dictionaries. Technical Report ifi-2007.02, Department of Informatics, University of Zurich, April 2007.
34. L. Tanabe and W. J. Wilbur. Generation of a large gene/protein lexicon by morphological pattern analysis. Journal of Bioinformatics and Computational Biology, 1(4):1-16, 2004.
35. Y. Tsuruoka and J. ichi Tsujii. Improving the performance of dictionary-based approaches in protein name recognition. Journal of Biomedical Informatics, 37(6):461-470,2004.
36. E. Ukkonen. Algorithms for approximate string matching. Information and Control, 64(1-3):100-118, 1985.
37. E. Ukkonen. Finding approximate patterns in strings. J. Algorithms, 6(1):132-137, 1985.
38. J. Wang, Z. Li, C. Cai, and Y. Chen. Assessment of approximate string matching in a biomedical text retrieval problem. Computers in Biology and Medicine, 35(8):717-724, 2005.
39. C. Xiao, W. Wang, and X. Lin. Ed-join: an efficient algorithm for similarity joins with edit distance constraints. PVLDB, 1(1):933-944, 2008.
40. C. Xiao, W. Wang, X. Lin, and J. X. Yu. Efficient similarity joins for near duplicate detection. In WWW, 2008.
41. X. Yang, B. Wang, and C. Li. Cost-based variablelength- gram selection for string collections to support approximate queries efficiently. In SIGMOD Conference, pages 353-364, 2008.
42. J. Zobel and P. W. Dart. Finding approximate matches in large lexicons. Softw., Pract. Exper., 25(3):331-345, 1995.