{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T21:10:06Z","timestamp":1751836206202,"version":"3.41.0"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319996165"},{"type":"electronic","value":"9783319996172"}],"license":[{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-319-99617-2_9","type":"book-chapter","created":{"date-parts":[[2018,9,3]],"date-time":"2018-09-03T09:36:35Z","timestamp":1535967395000},"page":"135-150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Real-Time Comparable Phrases Searching Via the Levenshtein Distance with the Use of CUDA Technology"],"prefix":"10.1007","author":[{"given":"Witold","family":"\u017borski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bartosz","family":"Drogosiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,1]]},"reference":[{"issue":"3","key":"9_CR1","doi-asserted-by":"publisher","first-page":"1804","DOI":"10.1109\/TIT.2011.2174961","volume":"58","author":"KAS Abdel-Ghaffar","year":"2012","unstructured":"Abdel-Ghaffar, K.A.S., Paluncic, F., Ferreira, H.C., Clarke, W.A.: On Helberg\u2019s generalization of the Levenshtein code for multiple deletion\/insertion error correction. IEEE Trans. Inf. Theory 58(3), 1804\u20131808 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Andoni A., Onak K.: Approximating edit distance in near-linear time. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, pp. 199\u2013204. ACM (2009)","DOI":"10.1145\/1536414.1536444"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Backurs A., Indyk P.: Edit distance cannot be computed in strongly subquadratic time (unless SETH is false). In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, pp. 51\u201358. ACM (2015)","DOI":"10.1145\/2746539.2746612"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Chowdhury, S.D., Bhattacharya, U., Parui, S.K.: Online handwriting recognition using Levenshtein distance metric. In: 12th International Conference on Document Analysis and Recognition (ICDAR) (2013)","DOI":"10.1109\/ICDAR.2013.24"},{"issue":"3","key":"9_CR5","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1145\/363958.363994","volume":"7","author":"FJ Damerau","year":"1964","unstructured":"Damerau, F.J.: A technique for computer detection and correction of spelling errors. Commun. ACM 7(3), 171\u2013176 (1964)","journal-title":"Commun. ACM"},{"issue":"12","key":"9_CR6","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1049\/iet-ipr.2016.0186","volume":"10","author":"J Dong","year":"2016","unstructured":"Dong, J., Liu, H.: Semi-real-time algorithm for fast pattern matching. IET Image Proc. 10(12), 979\u2013985 (2016)","journal-title":"IET Image Proc."},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13160-012-0089-6","volume":"30","author":"O Fujita","year":"2013","unstructured":"Fujita, O.: Metrics based on average distance between sets. Jpn. J. Ind. Appl. Math. 30(1), 1\u201319 (2013)","journal-title":"Jpn. J. Ind. Appl. Math."},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Gaikwad, S., Bogiri, N.: Levenshtein distance algorithm for efficient and effective XML duplicate detection. In: International Conference on Computer, Communication and Control (IC4), pp. 1\u20135 (2015)","DOI":"10.1109\/IC4.2015.7375698"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Harish Kumar, B.T., Vibha, L., Venugopal, K.R.: Web page access prediction using hierarchical clustering based on modified Levenshtein distance and higher order Markov model. In: IEEE Region 10 Symposium (TENSYMP), pp. 1\u20136 (2016)","DOI":"10.1109\/TENCONSpring.2016.7519368"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Kim S.-H., Cho H.-G.: Position-restricted approximate string matching with metric Hamming distance. In: IEEE International Conference on Big Data and Smart Computing (BigComp), pp. 108\u2013114 (2017)","DOI":"10.1109\/BIGCOMP.2017.7881724"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Konstantinidis S.: Computing the Levenshtein distance of a regular language. In: IEEE Information Theory Workshop (2005)","DOI":"10.1109\/ITW.2005.1531868"},{"issue":"5323","key":"9_CR12","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1038\/234034a0","volume":"234","author":"M Levandowsky","year":"1971","unstructured":"Levandowsky, M., Winter, D.: Distance between sets. Nature 234(5323), 34\u201335 (1971)","journal-title":"Nature"},{"key":"9_CR13","first-page":"707","volume":"10","author":"VI Levenshtein","year":"1966","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Sov. Phys. Dokl. 10, 707\u2013710 (1966)","journal-title":"Sov. Phys. Dokl."},{"key":"9_CR14","unstructured":"Nagata, J.: Modern General Topology, 3rd edn., vol. 33. Elsevier Science Publishers BV, Amsterdam (1985)"},{"issue":"1","key":"9_CR15","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G Navarro","year":"2001","unstructured":"Navarro, G.: A guided tour to approximate string matching. ACM Comput. Surv. (CSUR) 33(1), 31\u201388 (2001)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Nemmour, H., Chibani, Y.: New Jaccard-distance based support vector machine kernel for handwritten digit recognition. In: 3rd International Conference on Information and Communication Technologies: From Theory to Applications, pp. 1\u20134 (2008)","DOI":"10.1109\/ICTTA.2008.4530078"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Nyirarugira, C., Choi, H.-R., Kim, J.Y., Hayes M., Kim, T.Y.: Modified Levenshtein distance for real-time gesture recognition. In: 6th International Congress on Image and Signal Processing (CISP), pp. 974\u2013979 (2013)","DOI":"10.1109\/CISP.2013.6745306"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Medhat, D., Hassan, A., Salama C.: A hybrid cross-language name matching technique using novel modified Levenshtein distance. In: Tenth International Conference on Computer Engineering and Systems (ICCES), pp. 204\u2013209 (2015)","DOI":"10.1109\/ICCES.2015.7393046"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Shao, M.-M., Qian, D.-M.: The Application of Levenshtein algorithm in the examination of the question bank similarity. In: International Conference on Robots and Intelligent System (ICRIS), pp. 422\u2013424 (2016)","DOI":"10.1109\/ICRIS.2016.88"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Sk\u0142odowski, P., \u017borski W.: Movement tracking in terrain conditions accelerated with CUDA. In: Proceedings of the Federated Conference on Computer Science and Information Systems, pp. 709\u2013717 (2014)","DOI":"10.15439\/2014F282"},{"issue":"6","key":"9_CR21","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1016\/S0031-3203(01)00118-2","volume":"35","author":"S-H Cha","year":"2002","unstructured":"Cha, S.-H., Srihari, S.N.: On measuring the distance between histograms. Pattern Recogn. 35(6), 1355\u20131370 (2002)","journal-title":"Pattern Recogn."},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"RA Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. J. Assoc. Comput. Mach. 21, 168\u2013173 (1974)","journal-title":"J. Assoc. Comput. Mach."},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Putra, M.E.W., Supriana, I.: Structural offline handwriting character recognition using Levenshtein distance. In: International Conference on Electrical Engineering and Informatics (ICEEI) (2015)","DOI":"10.1109\/ICEEI.2015.7352465"},{"issue":"6","key":"9_CR24","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1109\/TPAMI.2007.1078","volume":"29","author":"L Yujian","year":"2007","unstructured":"Yujian, L., Bo, L.: A normalized Levenshtein distance metric. IEEE Trans. Pattern Anal. Mach. Intell. 29(6), 1091\u20131095 (2007)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Zhu, H., Cao, Y., Zhou, Z., Gong, M.: Parallel multi-temporal remote sensing image change detection on GPU. In: IEEE 26th International Parallel and Distributed Processing Symposium Workshops and PhD Forum (IPDPSW) (2012)","DOI":"10.1109\/IPDPSW.2012.234"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"\u017borski, W.: The hough transform application including its hardware implementation. In: Advanced Concepts for Intelligent Vision Systems: Proceedings of the 7th International Conference, Lecture Notes in Computer Science, vol. 3708, pp. 460\u2013467. Springer (2005)","DOI":"10.1007\/11558484_58"},{"key":"9_CR27","unstructured":"NVIDIA, CUDA C Programming Guide, March 2018, PG-02829-001_v9.1. https:\/\/docs.nvidia.com\/cuda\/pdf\/CUDA_C_Programming_Guide.pdf"},{"key":"9_CR28","unstructured":"NVIDIA, CUDA C Best Practices Guide, March 2018, DG-05603-001_v9.1. https:\/\/docs.nvidia.com\/cuda\/pdf\/CUDA_C_Best_Practices_Guide.pdf"}],"container-title":["Advances in Intelligent Systems and Computing","Engineering Software Systems: Research and Praxis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99617-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T20:29:16Z","timestamp":1751833756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99617-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,1]]},"ISBN":["9783319996165","9783319996172"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99617-2_9","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2018,9,1]]}}}