Search
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.
Citations
-
3
CrossRef
-
0
Web of Science
-
3
Scopus
Authors (2)
Cite as
Full text
download paper
downloaded 37 times
- Publication version
- Accepted or Published Version
- License
- Copyright (Springer-Verlag Berlin Heidelberg 2013)
Keywords
Details
- Category:
- Conference activity
- Type:
- materiały konferencyjne indeksowane w Web of Science
- Title of issue:
- Computational Collective Intelligence, Technologies and Applications strony 306 - 315
- Language:
- English
- Publication year:
- 2013
- Bibliographic description:
- Szymański J., Boiński T..: Improvement of Imperfect String Matching Based on Asymetric n-Grams, W: Computational Collective Intelligence, Technologies and Applications, 2013, Springer-Verlag Berlin Heidelberg,.
- DOI:
- Digital Object Identifier (open in new tab) 10.1007/978-3-642-40495-5_31
- Bibliography: test
-
show (11) hide
- 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 (2003) 44312-44319 open in new tab
- Hamming, R.: Error detecting and error correcting codes. Bell System technical journal 29 (1950) 147-160 open in new tab
- Lcvenshtcin, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. In: Soviet Physics-Doklady. Volume 10. (1966)
- Sulzberger, C.: Efficient implementation of the levenshtein-algorithm. http://www. levenshtein.net/ (2009) [Online: 28.02.2012].
- Damerau, F.J.: A technique for computer detection and correction of spelling errors. Com- mun. ACM 7 (1964) 171-176 open in new tab
- Hall, P., Dowling, G.: Approximate string matching. ACM Computing Surveys (CSUR) 12 (1980) 381-402 open in new tab
- Navarro, G., Baeza-Yates, R., Sutinen, E., Tarhio, J.: Indexing methods for approximate string matching. IEEE Data Engineering Bulletin 24 (2001) 19-27
- Atkinson, K.: Gnu aspell. http://aspell.net/ (2011) [Online: 07.03.2012]. open in new tab
- 10. WinEdt: Winedt dictionaries -english (uk). tug.ctan.org/tex-archive/ systems/win32/winedt/dict/uk.zip (2010) [Online: 14.03.2012]. open in new tab
- Deptula, M., Szymański, J., Krawczyk, H.: Interactive information search in text data col- lections, Springer (in print) (2012) open in new tab
- Verified by:
- Gdańsk University of Technology
seen 85 times
Recommended for you
Robust unsupervised georeferencing algorithm for aerial and satellite imagery
- K. Bruniecki,
- S. Dąbrowski,
- Ł. Kamiński
- + 2 authors
2011