{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T12:06:58Z","timestamp":1779106018377,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540297406","type":"print"},{"value":"9783540322412","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11575832_13","type":"book-chapter","created":{"date-parts":[[2005,10,13]],"date-time":"2005-10-13T10:12:50Z","timestamp":1129198370000},"page":"115-126","source":"Crossref","is-referenced-by-count":190,"title":["N-Gram Similarity and Distance"],"prefix":"10.1007","author":[{"given":"Grzegorz","family":"Kondrak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"Brew, C., McKelvie, D.: Word-pair extraction for lexicography. In: Proc. of the 2nd Intl Conf. on New Methods in Language Processing, pp. 45\u201355 (1996)"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"306","DOI":"10.2307\/3212444","volume":"12","author":"V. Chv\u00e1tal","year":"1975","unstructured":"Chv\u00e1tal, V., Sankoff, D.: Longest common subsequences of two random sequences. Journal of Applied Probability\u00a012, 306\u2013315 (1975)","journal-title":"Journal of Applied Probability"},{"key":"13_CR3","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge (2001)","edition":"2"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Hewson, J.: A computer-generated dictionary of proto-Algonquian, Hull, Canadian Museum of Civilization, Quebec (1993)","DOI":"10.2307\/j.ctv16qn2"},{"issue":"12","key":"13_CR5","doi-asserted-by":"publisher","first-page":"1214","DOI":"10.1097\/00005650-199912000-00005","volume":"37","author":"B.L. Lambert","year":"1999","unstructured":"Lambert, B.L., Lin, S.-J., Chang, K.-Y., Gandhi, S.K.: Similarity As a Risk Factor in Drug-Name Confusion Errors: The Look-Alike (Orthographic) and Sound-Alike (Phonetic) Model. Medical Care\u00a037(12), 1214\u20131225 (1999)","journal-title":"Medical Care"},{"issue":"9","key":"13_CR6","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1109\/34.232078","volume":"15","author":"A. Marzal","year":"1993","unstructured":"Marzal, A., Vidal, E.: Computation of normalized edit distance and applications. IEEE Trans. Pattern Analysis and Machine Intelligence\u00a015(9), 926\u2013932 (1993)","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence"},{"key":"13_CR7","unstructured":"Melamed, I.D.: Manual annotation of translational equivalence: The Blinker project. Technical Report IRCS #98-07, University of Pennsylvania (1998)"},{"issue":"1","key":"13_CR8","first-page":"107","volume":"25","author":"I.D. Melamed","year":"1999","unstructured":"Melamed, I.D.: Bitext maps and alignment via pattern recognition. Computational Linguistics\u00a025(1), 107\u2013130 (1999)","journal-title":"Computational Linguistics"},{"key":"13_CR9","volume-title":"Time warps, string edits, and macromolecules: the theory and practice of sequence comparison","year":"1983","unstructured":"Sankoff, D., Kruskal, J.B. (eds.): Time warps, string edits, and macromolecules: the theory and practice of sequence comparison. Addison-Wesley, Reading (1983)"},{"key":"13_CR10","volume-title":"Computing Patterns in Strings","author":"B. Smyth","year":"2003","unstructured":"Smyth, B.: Computing Patterns in Strings. Pearson, London (2003)"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Tufis, D.: A cheap and fast way to build useful translation lexicons. In: Proc. of the 19th Intl Conf. on Computational Linguistics, pp. 1030\u20131036 (2002)","DOI":"10.3115\/1072228.1072230"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-3975(92)90143-4","volume":"92","author":"E. Ukkonen","year":"1992","unstructured":"Ukkonen, E.: Approximate string-matching with q-grams and maximal matches. Theoretical Computer Science\u00a092, 191\u2013211 (1992)","journal-title":"Theoretical Computer Science"},{"key":"13_CR13","unstructured":"Use caution \u2014 avoid confusion. United States Pharmacopeial Convention Quality Review, No. 76 (March 2001), Available from \n                    \n                      http:\/\/www.bhhs.org\/pdf\/qr76.pdf"},{"issue":"1","key":"13_CR14","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R.A. Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. Journal of the Association for Computing Machinery\u00a021(1), 168\u2013173 (1974)","journal-title":"Journal of the Association for Computing Machinery"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11575832_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:42:51Z","timestamp":1619491371000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11575832_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540297406","9783540322412"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11575832_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}