{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:07:08Z","timestamp":1774987628168,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030141318","type":"print"},{"value":"9783030141325","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,3,6]],"date-time":"2019-03-06T00:00:00Z","timestamp":1551830400000},"content-version":"tdm","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":[[2020]]},"DOI":"10.1007\/978-3-030-14132-5_11","type":"book-chapter","created":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T03:59:54Z","timestamp":1551758394000},"page":"137-150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Application of Distance Measurement NLP Methods for Address and Location Matching in Logistics"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5093-3453","authenticated-orcid":false,"given":"Leo","family":"Mrsic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,6]]},"reference":[{"issue":"1","key":"11_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"Gonzalo Navarro","year":"2001","unstructured":"Navarro, G.: A guided tour to approximate string matching (PDF). ACM Comput. Surv. 33(1), 31\u201388 (2001). CiteSeerX 10.1.1.452.6317. https:\/\/doi.org\/10.1145\/375360.375365","journal-title":"ACM Computing Surveys"},{"issue":"1","key":"11_CR2","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"Robert A. Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. J. ACM 21(1), 168\u2013173 (1974). https:\/\/doi.org\/10.1145\/321796.321811 (Author, F.: Article title. Journal 2(5), 99\u2013110 (2016))","journal-title":"Journal of the ACM"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Backurs, A., Indyk, P.: Edit distance cannot be computed in strongly subquadratic time (unless SETH is false). In: Forty-Seventh Annual ACM on Symposium on Theory of Computing (STOC) (2015). arXiv:1412.0348. Bibcode:2014arXiv1412.0348B","DOI":"10.1145\/2746539.2746612"},{"issue":"6","key":"11_CR4","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1137\/0216067","volume":"16","author":"K Abrahamson","year":"1987","unstructured":"Abrahamson, K.: Generalized string matching. SIAM J. Comput. 16(6), 1039\u20131051 (1987). https:\/\/doi.org\/10.1137\/0216067","journal-title":"SIAM J. Comput."},{"key":"11_CR5","unstructured":"Alstrup, S., Brodal, G.S., Rauhe, T.: Pattern matching in dynamic texts. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 819\u2013828, 09\u201311 Jan 2000, San Francisco, California, USA (2000)"},{"key":"11_CR6","unstructured":"Andoni, A., Krauthgamer, R., Onak, K.: Polylogarithmic approximation for edit distance and the asymmetric query complexity. IEEE Symp. Foundations of Computer Science (FOCS) (2010). arXiv:1005.4033. Bibcode:2010arXiv1005.4033A. CiteSeerX 10.1.1.208.2079"},{"key":"11_CR7","unstructured":"Levenshtein, I.: Binary codes capable of correcting deletions, insertions and reversals. Doklady Akademii Nauk SSSR 163(4), 845\u2013848 (1965) also Soviet Physics Doklady 10(8) 707\u2013710 (1966)"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"p443","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"SB Needleman","year":"1970","unstructured":"Needleman, S.B., Wunsch, C.D.: A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol. 48, p443\u2013p453 (1970)","journal-title":"J. Mol. Biol."},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1007\/BF01759076","volume":"6","author":"RJ Anderson","year":"1991","unstructured":"Anderson, R.J., Miller, G.L.: Deterministic parallel list ranking. Algorithmica 6, 859\u2013868 (1991)","journal-title":"Algorithmica"},{"key":"11_CR10","unstructured":"Cole, R., Hariharan, R.: Approximate string matching: a simpler faster algorithm. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 463\u2013472, 25-27 Jan 1998, San Francisco, California, USA (1998)"},{"key":"11_CR11","unstructured":"Henzinger, M., Raghavan, P., Rajagopalan, S.: Computing on data streams. Tech. Rep. SRC 1998-011, DEC Systems Research Centre (1998)"},{"key":"11_CR12","volume-title":"Text Algorithms","author":"M Crochemore","year":"1994","unstructured":"Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press Inc., New York (1994)"},{"key":"11_CR13","unstructured":"Goel, A., Indyk, P., Varadarajan, K.: Reductions among high dimensional proximity problems. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 769\u2013778, 07\u201309 Jan 2001, Washington, DC, USA (2001)"},{"key":"11_CR14","doi-asserted-by":"publisher","unstructured":"Goldberg, A., Plotkin, S., Shannon, G.: Parallel symmetry-breaking in sparse graphs. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pp. 315\u2013324, Jan 1987, New York, New York, USA (1987). https:\/\/doi.org\/10.1145\/28395.28429","DOI":"10.1145\/28395.28429"},{"key":"11_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"Dan Gusfiel","year":"1997","unstructured":"Gusfiel, Dan: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York (1997)"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Indyk, P.: Stable distributions, pseudorandom generators, embeddings and data stream computation. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, p. 189, 12\u201314 Nov 2000 (2000)","DOI":"10.1109\/SFCS.2000.892082"},{"issue":"2","key":"11_CR17","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"Richard M. Karp","year":"1987","unstructured":"Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM J. Res. Dev. 31(2), 249\u2013260 (1987). https:\/\/doi.org\/10.1147\/rd.312.0249","journal-title":"IBM Journal of Research and Development"},{"issue":"2-3","key":"11_CR18","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0304-3975(86)90178-7","volume":"43","author":"GM Landau","year":"1986","unstructured":"Landau, G.M., Vishkin, U.: Efficient string matching with k mismatches. Theor. Comput. Sci. 43(2-3), 239\u2013249 (1986)","journal-title":"Theor. Comput. Sci."},{"issue":"8","key":"11_CR19","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(8), 707\u2013710 (1966)","journal-title":"Sov. Phys. Dokl."},{"key":"11_CR20","unstructured":"Sankoff, D., Kruskal, J.B.: Time Warps, String Edits and Macromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley (1983)"},{"issue":"2","key":"11_CR21","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0196-6774(89)90010-2","volume":"10","author":"Gad M Landau","year":"1989","unstructured":"Landau, G.M., Vishkin, U.: Fast parallel and serial approximate string matching. J. Algorithms 10(2), 157\u2013169 (1989) https:\/\/doi.org\/10.1016\/0196-6774(89)90010-2","journal-title":"Journal of Algorithms"},{"key":"11_CR22","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","volume":"20","author":"WJ Masek","year":"1980","unstructured":"Masek, W.J., Paterson, M.S.: A faster algorithm computing string edit distances. J. Comput. Syst. Sci. 20, 18\u201331 (1980)","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Shapira, D., Storer, J.A.: Edit distance with move operations. In: Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching, pp. 85\u201398, 03\u201305 July 2002 (2002)","DOI":"10.1007\/3-540-45452-7_9"},{"key":"11_CR24","unstructured":"Mrsic, L., Skansi, S., Kopal, R.: Preliminary study for a survey-based fuzzy membership function definition for imprecise quantification in Croatia. In: Central European Conference on Information and Intelligent Systems (2018). ISSN 1847-2001, e-ISSN 1848-2295"},{"key":"11_CR25","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-319-53153-3_11","volume-title":"Intelligent Decision Support Systems for Sustainable Computing","author":"Leo Mr\u0161i\u0107","year":"2017","unstructured":"Mrsic, L., Kopal, R., Klepac, G.: Analyzing slavic textual sentiment using deep convolutional neural networks. In: Intelligent Decision Support Systems for Sustainable Computing: Paradigms and Applications, vol. 705, pp. 207\u2013224 (2017). https:\/\/doi.org\/10.1007\/978-3-319-53153-3_11"}],"container-title":["Studies in Computational Intelligence","Intelligent Information and Database Systems: Recent Developments"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-14132-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:33:38Z","timestamp":1774985618000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-14132-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,6]]},"ISBN":["9783030141318","9783030141325"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-14132-5_11","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"value":"1860-949X","type":"print"},{"value":"1860-9503","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3,6]]},"assertion":[{"value":"6 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACIIDS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Conference on Intelligent Information and Database Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yogyakarta","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Indonesia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aciids2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aciids.pwr.edu.pl\/2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}