{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:46:35Z","timestamp":1740181595397,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,7,27]],"date-time":"2024-07-27T00:00:00Z","timestamp":1722038400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,27]],"date-time":"2024-07-27T00:00:00Z","timestamp":1722038400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-024-03093-9","type":"journal-article","created":{"date-parts":[[2024,7,27]],"date-time":"2024-07-27T07:02:06Z","timestamp":1722063726000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Renaissance of Fuzzy and Fast Matching Entity with DSHS Algorithm"],"prefix":"10.1007","volume":"5","author":[{"given":"Venkatram","family":"Kari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3246-5243","authenticated-orcid":false,"given":"Geetha Mary","family":"Amalanathan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,27]]},"reference":[{"key":"3093_CR1","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.cmpb.2018.05.007","volume":"162","author":"A Idri","year":"2018","unstructured":"Idri A, Benhar H, Fern\u00e1ndez-Alem\u00e1n JL, Kadi I. A systematic map of medical data preprocessing in knowledge discovery. Comput Methods Programs Biomed. 2018;162:69\u201385. https:\/\/doi.org\/10.1016\/j.cmpb.2018.05.007.","journal-title":"Comput Methods Programs Biomed"},{"key":"3093_CR2","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.procs.2018.03.057","volume":"129","author":"A Luo","year":"2018","unstructured":"Luo A, Gao S, Xu Y. Deep Semantic Match Model for Entity linking using knowledge graph and text. Procedia Comput Sci. 2018;129:110\u20134. https:\/\/doi.org\/10.1016\/j.procs.2018.03.057.","journal-title":"Procedia Comput Sci"},{"key":"3093_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.neucom.2016.03.089","volume":"210","author":"O Peled","year":"2016","unstructured":"Peled O, Fire M, Rokach L, Elovici Y. Matching entities across online social networks. Neurocomputing. 2016;210:91\u2013106. https:\/\/doi.org\/10.1016\/j.neucom.2016.03.089.","journal-title":"Neurocomputing"},{"key":"3093_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-01835-0","author":"F Nauman","year":"2022","unstructured":"Nauman F, Herschel M. An introduction to duplicate detection. Springer Nat. 2022. https:\/\/doi.org\/10.1007\/978-3-031-01835-0.","journal-title":"Springer Nat"},{"key":"3093_CR5","unstructured":"Charras C, Lecroq T. Handbook of exact string matching algorithms. Citeseer. 2004."},{"key":"3093_CR6","unstructured":"FUOCO SM, Ganci JM Jr, Trim CM, Zeng J. Phonetic patterns for fuzzy matching in natural language processing, ed: Google Patents. 2022; U.S. Patent No. 11,397,856."},{"key":"3093_CR7","doi-asserted-by":"publisher","unstructured":"Agbehadji IE, Yang H, Fong S, Millham R. The Comparative Analysis of Smith-Waterman Algorithm with Jaro-Winkler Algorithm for the Detection of Duplicate Health Related Records. In: International Conference on Advances in Big Data, Computing and Data Communication Systems (icABCD). 2018;1:1\u201310; https:\/\/doi.org\/10.1109\/ICABCD.2018.8465458.","DOI":"10.1109\/ICABCD.2018.8465458"},{"key":"3093_CR8","unstructured":"Samuelsson A. Weighting edit Distance to improve spelling correction in music entity search. Semantic Scholar. 2017;69927834."},{"key":"3093_CR9","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/3-540-36618-0_22","volume":"1","author":"B Bigi","year":"2003","unstructured":"Bigi B. Using kullback-leibler distance for text categorization. Eur Conf Inform Retr. 2003;1:305\u201319. https:\/\/doi.org\/10.1007\/3-540-36618-0_22.","journal-title":"Eur Conf Inform Retr"},{"key":"3093_CR10","first-page":"107","volume":"1","author":"C Snae","year":"2007","unstructured":"Snae C. A comparison and analysis of name matching algorithms. Int J Comput Inform Eng. 2007;1:107\u201312.","journal-title":"Int J Comput Inform Eng"},{"issue":"1","key":"3093_CR11","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1093\/ietisy\/e89-d.1.332","volume":"89","author":"R Gong","year":"2006","unstructured":"Gong R, Chan TKY. Syllable alignment: a novel model for phonetic string search. IEICE Trans Inf Syst. 2006;89(1):332\u20139. https:\/\/doi.org\/10.1093\/ietisy\/e89-d.1.332.","journal-title":"IEICE Trans Inf Syst"},{"key":"3093_CR12","doi-asserted-by":"publisher","unstructured":"Soo J, Frieder O. On foreign name search. In: European Conference on Information Retrieval. 2010;1:483\u2013494; https:\/\/doi.org\/10.1007\/978-3-642-12275-0_42.","DOI":"10.1007\/978-3-642-12275-0_42"},{"key":"3093_CR13","first-page":"072","volume":"1","author":"Z Fan","year":"2004","unstructured":"Fan Z. Matching character variables by sound: a closer look at Soundex function and sounds-like operator. SAS\u00ae Users Group Inst. 2004;1:072\u201329.","journal-title":"SAS\u00ae Users Group Inst"},{"key":"3093_CR14","doi-asserted-by":"publisher","first-page":"497","DOI":"10.28945\/1076","volume":"6","author":"C Snae","year":"2009","unstructured":"Snae C, Br\u00fcckner M. Novel phonetic name matching algorithm with a statistical ontology for analysing names given in accordance with Thai astrology. Issues Informing Sci Inform Technol. 2009;6:497\u2013515.","journal-title":"Issues Informing Sci Inform Technol"},{"key":"3093_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jss.2017.03.003","volume":"128","author":"DG Mestre","year":"2017","unstructured":"Mestre DG, Pires CES, Nascimento DC, de Queiroz ARM, Santos VB, Araujo TB. An efficient spark-based adaptive windowing for entity matching. J Syst Softw. 2017;128:1\u201310. https:\/\/doi.org\/10.1016\/j.jss.2017.03.003.","journal-title":"J Syst Softw"},{"key":"3093_CR16","doi-asserted-by":"crossref","unstructured":"Christen P. Data matching: concepts and techniques for record linkage, entity resolution, and duplicate detection. Springer Science & Business Media; 1;2012.","DOI":"10.1007\/978-3-642-31164-2"},{"issue":"32","key":"3093_CR17","doi-asserted-by":"publisher","first-page":"8499","DOI":"10.1073\/pnas.1703440114","volume":"114","author":"J Kubanek","year":"2017","unstructured":"Kubanek J. Optimal decision making and matching are tied through diminishing returns. Proc Natl Acad Sci. 2017;114(32):8499\u2013504. https:\/\/doi.org\/10.1073\/pnas.1703440114.","journal-title":"Proc Natl Acad Sci"},{"key":"3093_CR18","doi-asserted-by":"publisher","first-page":"3526","DOI":"10.1145\/3308558.3314121","volume":"1","author":"B Hou","year":"2019","unstructured":"Hou B. Gradual machine learning for entity resolution. World Wide Web Conf. 2019;1:3526\u201330. https:\/\/doi.org\/10.1145\/3308558.3314121.","journal-title":"World Wide Web Conf"},{"key":"3093_CR19","first-page":"862","volume":"1","author":"W Shen","year":"2005","unstructured":"Shen W, Li X, Doan A. Constraint-based entity matching. AAAI. 2005;1:862\u20137.","journal-title":"AAAI"},{"key":"3093_CR20","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-319-10933-6_23","volume":"1","author":"Z Shen","year":"2014","unstructured":"Shen Z, Wang Q. Entity Resolution with Weighted constraints. Cham Springer. 2014;1:308\u201322. https:\/\/doi.org\/10.1007\/978-3-319-10933-6_23.","journal-title":"Cham Springer"},{"key":"3093_CR21","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/978-3-540-69534-9_41","volume":"1","author":"E Ioannou","year":"2008","unstructured":"Ioannou E, Nieder\u00e9e C, Nejdl W. Probabilistic entity linkage for heterogeneous information spaces. Int Conf Adv Inform Syst Eng. 2008;1:556\u201370. https:\/\/doi.org\/10.1007\/978-3-540-69534-9_41.","journal-title":"Int Conf Adv Inform Syst Eng"},{"key":"3093_CR22","doi-asserted-by":"publisher","first-page":"61","DOI":"10.7250\/csimq.2018-16.04","volume":"16","author":"A Saeedi","year":"2018","unstructured":"Saeedi A, Nentwig M, Peukert E, Rahm E. Scalable matching and clustering of entities with FAMER. Complex Syst Inf Model Q. 2018;16:61\u201383. https:\/\/doi.org\/10.7250\/csimq.2018-16.04.","journal-title":"Complex Syst Inf Model Q"},{"key":"3093_CR23","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/3183713.3196926","volume":"1","author":"S Mudgal","year":"2018","unstructured":"Mudgal S. Deep learning for entity matching: a design space exploration. Proc 2018 Int Conf Manage Data. 2018;1:19\u201334. https:\/\/doi.org\/10.1145\/3183713.3196926.","journal-title":"Proc 2018 Int Conf Manage Data"},{"key":"3093_CR24","doi-asserted-by":"publisher","first-page":"1808","DOI":"10.48550\/arXiv.1808.07699","volume":"1","author":"N Kolitsas","year":"2018","unstructured":"Kolitsas N, Ganea O-E, Hofmann T. End-to-end neural entity linking. arXiv Preprint arXiv. 2018;1:1808. https:\/\/doi.org\/10.48550\/arXiv.1808.07699.","journal-title":"arXiv Preprint arXiv"},{"key":"3093_CR25","doi-asserted-by":"publisher","unstructured":"Io H, Lee C. Chatbots and conversational agents: A bibliometric analysis. IEEE International Conference on Industrial Engineering and Engineering Management (IEEM). 2017;1:215\u2013219;https:\/\/doi.org\/10.1109\/IEEM.2017.8289883.","DOI":"10.1109\/IEEM.2017.8289883"},{"key":"3093_CR26","doi-asserted-by":"publisher","unstructured":"Konda P, Das S, Doan A, Ardalan A, Ballard JR, Li H, Panahi F, Zhang H, Naughton J, Prasad S, Krishnan G. Magellan: toward building entity matching management systems over data science stacks. Proceedings of the VLDB Endowment. 2016;9(13):1581-4 https:\/\/doi.org\/10.14778\/3007263.3007314.","DOI":"10.14778\/3007263.3007314"},{"key":"3093_CR27","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1145\/2488388.2488415","volume":"1","author":"N Dalvi","year":"2013","unstructured":"Dalvi N, Rastogi V, Dasgupta A, Das Sarma A, Sarlos T. Optimal hashing schemes for entity matching. Proc 22nd Int Conf World Wide Web. 2013;1:295\u2013306. https:\/\/doi.org\/10.1145\/2488388.2488415.","journal-title":"Proc 22nd Int Conf World Wide Web"},{"issue":"2","key":"3093_CR28","doi-asserted-by":"publisher","first-page":"189","DOI":"10.14778\/3149193.3149199","volume":"11","author":"R Singh","year":"2017","unstructured":"Singh R, Meduri VV, Elmagarmid A, Madden S, Papotti P, Quian\u00e9-Ruiz JA, Solar-Lezama A, Tang N. Synthesizing entity matching rules by examples. Proc VLDB Endow. 2017;11(2):189\u2013202. https:\/\/doi.org\/10.14778\/3149193.3149199.","journal-title":"Proc VLDB Endow"},{"issue":"4","key":"3093_CR29","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/MIC.2010.58","volume":"14","author":"H Kopcke","year":"2010","unstructured":"Kopcke H, Thor A, Rahm E. Learning-based approaches for matching web data entities. IEEE Internet Comput. 2010;14(4):23\u201331.","journal-title":"IEEE Internet Comput"},{"key":"3093_CR30","doi-asserted-by":"crossref","unstructured":"Khan AA, Bourouis S, Kamruzzaman MM, Hadjouni M, Shaikh ZA, Laghari AA, Elmannai H, Dhahbi S. Data security in healthcare industrial internet of things with blockchain. IEEE Sens J. 2023; https:\/\/ieeexplore.ieee.org\/document\/10123409.","DOI":"10.1109\/JSEN.2023.3273851"},{"key":"3093_CR31","doi-asserted-by":"publisher","unstructured":"Li H, Feng L, Li S, Hao F, Zhang CJ, Song Y, Chen L. On Leveraging Large Language Models for Enhancing Entity Resolution. 2024;1:2401; https:\/\/doi.org\/10.48550\/arXiv.2401.03426.","DOI":"10.48550\/arXiv.2401.03426"},{"key":"3093_CR32","doi-asserted-by":"publisher","unstructured":"Nananukul N, Sisaengsuwanchai K, Kejriwal M. Cost-Efficient Prompt Engineering for Unsupervised Entity Resolution. 2024; https:\/\/doi.org\/10.21203\/rs.3.rs-4177791\/v1.","DOI":"10.21203\/rs.3.rs-4177791\/v1"},{"key":"3093_CR33","doi-asserted-by":"publisher","unstructured":"Chu X, Ilyas IF, Krishnan S, Wang J. Data cleaning: Overview and emerging challenges. Proceedings of the. 2016 International Conference on Management of Data. 2016;1:2201\u20132206; https:\/\/doi.org\/10.1145\/2882903.2912574.","DOI":"10.1145\/2882903.2912574"},{"key":"3093_CR34","first-page":"20","volume":"1","author":"M Neun","year":"2004","unstructured":"Neun M, Weibel R, Burghardt D. Data enrichment for adaptive generalisation. ICA Workshop Generalisation Multiple Representation. 2004;1:20\u20131.","journal-title":"ICA Workshop Generalisation Multiple Representation"},{"key":"3093_CR35","first-page":"41","volume":"1","author":"Y Lin","year":"2016","unstructured":"Lin Y, Liu Z, Sun M. Knowledge representation learning with entities, attributes and relations. Ethnicity. 2016;1:41\u201352. https:\/\/nlp.csai.tsinghua.edu.cn\/~lyk\/publications\/ijcai2016_krear.pdf.","journal-title":"Ethnicity"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-024-03093-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-024-03093-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-024-03093-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,27]],"date-time":"2024-07-27T07:02:24Z","timestamp":1722063744000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-024-03093-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,27]]},"references-count":35,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2024,8]]}},"alternative-id":["3093"],"URL":"https:\/\/doi.org\/10.1007\/s42979-024-03093-9","relation":{},"ISSN":["2661-8907"],"issn-type":[{"type":"electronic","value":"2661-8907"}],"subject":[],"published":{"date-parts":[[2024,7,27]]},"assertion":[{"value":"17 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors whose names mentioned in the article, certify that they have NO affiliations with or involvement in any organization or entity with any financial interest (such as honoraria; educational grants; participation in speakers\u2019 bureaus; membership, employment, consultancies, stock ownership, or other equity interest; and expert testimony or patent-licensing arrangements), or non-financial interest (such as personal or professional relationships, affiliations, knowledge or beliefs) in the subject matter or materials discussed in this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"734"}}