Skip to main content

Improvement of Imperfect String Matching Based on Asymmetric n-Grams

  • Conference paper
Computational Collective Intelligence. Technologies and Applications (ICCCI 2013)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8083))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Manning, C.D., Raghavan, P., Schütze, H.: Introduction to Information Retrieval. Cambridge University Press (2008)

    Google Scholar 

  2. 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)

    Article  Google Scholar 

  3. Hamming, R.: Error detecting and error correcting codes. Bell System Technical Journal 29, 147–160 (1950)

    Article  MathSciNet  Google Scholar 

  4. Lcvenshtcin, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics-Doklady 10 (1966)

    Google Scholar 

  5. Sulzberger, C.: Efficient implementation of the levenshtein-algorithm (2009), http://www.levenshtein.net/ (February 28, 2012)

  6. Damerau, F.J.: A technique for computer detection and correction of spelling errors. Commun. ACM 7, 171–176 (1964)

    Article  Google Scholar 

  7. Hall, P., Dowling, G.: Approximate string matching. ACM Computing Surveys (CSUR) 12, 381–402 (1980)

    Article  MathSciNet  Google Scholar 

  8. Navarro, G., Baeza-Yates, R., Sutinen, E., Tarhio, J.: Indexing methods for approximate string matching. IEEE Data Engineering Bulletin 24, 19–27 (2001)

    Google Scholar 

  9. Atkinson, K.: Gnu aspell (2011), http://aspell.net/ (March 07, 2012)

  10. WinEdt: Winedt dictionaries - english (uk) (2010), tug.ctan.org/tex-archive/systems/win32/winedt/dict/uk.zip (March 14, 2012)

  11. 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)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics