A fast and accurate method for approximate string search

ACL-HLT 2011 - Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies

Volumn 1, Issue , 2011, Pages 52-61

  Wang, Ziqi ^a   Xu, Gu ^b   Li, Hang ^b   Zhang, Ming ^a  

^a PEKING UNIVERSITY   (China)

^b MICROSOFT RESEARCH ASIA   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CANDIDATE GENERATION; CONDITIONAL PROBABILITY DISTRIBUTIONS; LARGE SCALE DATA; LEARNING METHODS; LOGLINEAR MODEL; LOSS FUNCTIONS; PROBABILISTIC APPROACHES; RETRIEVAL ALGORITHMS; RULE SET; STRING SEARCH;

ALGORITHMS; PROBABILITY DISTRIBUTIONS;

COMPUTATIONAL LINGUISTICS;

EID: 84858063047     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Farooq Ahmad and Grzegorz Kondrak. 2005. Learning a spelling error model from search query logs. In Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing, HLT '05, pages 955-962, Morristown, NJ, USA. Association for Computational Linguistics.
2. Alfred V. Aho and Margaret J. Corasick. 1975. Efficient string matching: an aid to bibliographic search. Commun. ACM, 18:333-340, June.
3. Alexander Behm, Shengyue Ji, Chen Li, and Jiaheng Lu. 2009. Space-constrained gram-based indexing for efficient approximate string search. In Proceedings of the 2009 IEEE International Conference on Data Engineering, pages 604-615,Washington, DC, USA. IEEE Computer Society.
4. Eric Brill and Robert C. Moore. 2000. An improved error model for noisy channel spelling correction. In Proceedings of the 38th Annual Meeting on Association for Computational Linguistics, ACL '00, pages 286-293, Morristown, NJ, USA. Association for Computational Linguistics.
5. Qing Chen, Mu Li, and Ming Zhou. 2007. Improving query spelling correction using web search re- sults. In Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, pages 181-189.
6. Andrew R. Golding and Dan Roth. 1999. A winnowbased approach to context-sensitive spelling correction. Mach. Learn., 34:107-130, February.
7. Aminul Islam and Diana Inkpen. 2009. Real-word spelling correction using google web it 3-grams. In Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 3 - Volume 3, EMNLP '09, pages 1241-1249, Morristown, NJ, USA. Association for Computational Linguistics.
8. Rosie Jones, Benjamin Rey, Omid Madani, and Wiley Greiner. 2006. Generating query substitutions. In Proceedings of the 15th international conference on World Wide Web, WWW '06, pages 387-396, New York, NY, USA. ACM. (Pubitemid 46946631)
9. Mu Li, Yang Zhang, Muhua Zhu, and Ming Zhou. 2006. Exploring distributional similarity based models for query spelling correction. In Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics, ACL-44, pages 1025-1032, Morristown, NJ, USA. Association for Computational Linguistics.
10. Chen Li, Bin Wang, and Xiaochun Yang. 2007. Vgram: improving performance of approximate queries on string collections using variable-length grams. In Proceedings of the 33rd international conference on Very large data bases, VLDB '07, pages 303-314. VLDB Endowment.
11. Chen Li, Jiaheng Lu, and Yiming Lu. 2008. Efficient merging and filtering algorithms for approximate string searches. In Proceedings of the 2008 IEEE 24th International Conference on Data Engineering, pages 257-266, Washington, DC, USA. IEEE Computer Society.
12. Andrew McCallum, Kedar Bellare, and Fernando Pereira. 2005. A conditional random field for discriminativelytrained finite-state string edit distance. In Conference on Uncertainty in AI (UAI).
13. Stoyan Mihov and Klaus U. Schulz. 2004. Fast approximate search in large dictionaries. Comput. Linguist., 30:451-477, December. (Pubitemid 41399544)
14. Naoaki Okazaki, Yoshimasa Tsuruoka, Sophia Ananiadou, and Jun'ichi Tsujii. 2008. A discriminative candidate generator for string transformations. In Proceedings of the Conference on Empirical Methods in Natural Language Processing, EMNLP '08, pages 447-456, Morristown, NJ, USA. Association for Computational Linguistics.
15. Jose Oncina and Marc Sebban. 2005. Learning unbiased stochastic edit distance in the form of a memoryless finite-state transducer. In International Joint Conferenceon Machine Learning (2005). Workshop: Grammatical Inference Applications: Successes and Future Challenges.
16. Eric Sven Ristad and Peter N. Yianilos. 1998. Learning string-edit distance. IEEE Trans. Pattern Anal. Mach. Intell., 20:522-532, May. (Pubitemid 128741331)
17. Johannes Schaback and Fang Li. 2007. Multi-level feature extraction for spelling correction. In IJCAI-2007 Workshop on Analytics for Noisy Unstructured Text Data, pages 79-86, Hyderabad, India.
18. Kristina Toutanova and Robert C. Moore. 2002. Pronunciation modeling for improved spelling correction. In Proceedings of the 40th Annual Meeting on Association for Computational Linguistics, ACL '02, pages 144-151, Morristown, NJ, USA. Association for Computational Linguistics.
19. Rares Vernica and Chen Li. 2009. Efficient top-k algorithms for fuzzy search in string collections. In Proceedings of the First International Workshop on Keyword Search on Structured Data, KEYS '09, pages 9-14, New York, NY, USA. ACM.
20. Casey Whitelaw, Ben Hutchinson, Grace Y. Chung, and Gerard Ellis. 2009. Using the web for language independent spellchecking and autocorrection. In Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 2 - Volume 2, EMNLP '09, pages 890-899, Morristown, NJ, USA. Association for Computational Linguistics.
21. Xiaochun Yang, Bin Wang, and Chen Li. 2008. Costbased variable-length-gram selection for string collections to support approximate queries efficiently. In Proceedings of the 2008 ACM SIGMOD international conference on Management of data, SIGMOD '08, pages 353-364, New York, NY, USA. ACM.
22. Zhenglu Yang, Jianjun Yu, and Masaru Kitsuregawa. 2010. Fast algorithms for top-k approximate string matching. In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI '10, pages 1467-1473.