Abstract
Typical approaches to string comparing treats them as either different or identical without taking into account the possibility of misspelling of the word. In this article we present an approach we used for improvement of imperfect string matching that allows one to reconstruct potential string distortions. The proposed method increases the quality of imperfect string matching, allowing the lookup of misspelled words without significant impact on computational effectiveness. The paper presents the proposed method, experimental data sets and obtained results of comparison to state of the art methods.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Manning, C.D., Raghavan, P., Schütze, H.: Introduction to Information Retrieval. Cambridge University Press (2008)
Saxena, S., Jónsson, Z., Dutta, A.: Small rnas with imperfect match to endogenous mrna repress translation. Journal of Biological Chemistry 278, 44312–44319 (2003)
Hamming, R.: Error detecting and error correcting codes. Bell System Technical Journal 29, 147–160 (1950)
Lcvenshtcin, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics-Doklady 10 (1966)
Sulzberger, C.: Efficient implementation of the levenshtein-algorithm (2009), http://www.levenshtein.net/ (February 28, 2012)
Damerau, F.J.: A technique for computer detection and correction of spelling errors. Commun. ACM 7, 171–176 (1964)
Hall, P., Dowling, G.: Approximate string matching. ACM Computing Surveys (CSUR) 12, 381–402 (1980)
Navarro, G., Baeza-Yates, R., Sutinen, E., Tarhio, J.: Indexing methods for approximate string matching. IEEE Data Engineering Bulletin 24, 19–27 (2001)
Atkinson, K.: Gnu aspell (2011), http://aspell.net/ (March 07, 2012)
WinEdt: Winedt dictionaries - english (uk) (2010), tug.ctan.org/tex-archive/systems/win32/winedt/dict/uk.zip (March 14, 2012)
Deptuła, M., Szymański, J., Krawczyk, H.: Interactive information search in text data collections. In: Bembenik, R., Skonieczny, Ł., Rybiński, H., Kryszkiewicz, M., Niezgódka, M. (eds.) Intell. Tools for Building a Scientific Information. SCI, vol. 467, pp. 25–40. Springer, Heidelberg (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Szymański, J., Boiński, T. (2013). Improvement of Imperfect String Matching Based on Asymmetric n-Grams. In: Bǎdicǎ, C., Nguyen, N.T., Brezovan, M. (eds) Computational Collective Intelligence. Technologies and Applications. ICCCI 2013. Lecture Notes in Computer Science(), vol 8083. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40495-5_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-40495-5_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40494-8
Online ISBN: 978-3-642-40495-5
eBook Packages: Computer ScienceComputer Science (R0)