{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:59:41Z","timestamp":1742918381647,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642042348"},{"type":"electronic","value":"9783642042355"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04235-5_36","type":"book-chapter","created":{"date-parts":[[2009,8,25]],"date-time":"2009-08-25T06:34:37Z","timestamp":1251182077000},"page":"413-427","source":"Crossref","is-referenced-by-count":4,"title":["Comparison of String Distance Metrics for Lemmatisation of Named Entities in Polish"],"prefix":"10.1007","author":[{"given":"Jakub","family":"Piskorski","sequence":"first","affiliation":[]},{"given":"Marcin","family":"Sydow","sequence":"additional","affiliation":[]},{"given":"Karol","family":"Wieloch","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","unstructured":"Piskorski, J., Sydow, M.: Usability of String Distance Metrics for Name Matching Tasks in Polish. In: Proceedings of LTC 2007, Pozna\u0144, Poland (2007)"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Piskorski, J., Sydow, M., Kup\u015b\u0107, A.: Lemmatization of Polish Person Names. In: Proceedings of the ACL 2007 Workshop on Balto-Slavonic Natural Language Processing 2007 (BSNLP 2007), Prague, Czech Republic (2007)","DOI":"10.3115\/1567545.1567551"},{"key":"36_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-540-72035-5_27","volume-title":"Business Information Systems","author":"J. Piskorski","year":"2007","unstructured":"Piskorski, J., Sydow, M.: String distance metrics for reference matching and search query correction. In: Abramowicz, W. (ed.) BIS 2007. LNCS, vol.\u00a04439, pp. 353\u2013365. Springer, Heidelberg (2007)"},{"key":"36_CR4","unstructured":"Morton, T.: Coreference for NLP Applications. In: Proceedings of ACL (1997)"},{"key":"36_CR5","unstructured":"Cohen, W., Ravikumar, P., Fienberg, S.: A Comparison of String Distance Metrics for Name-Matching Tasks. In: Proceedings of IJCAI-2003 Workshop on Information Integration on the Web (IIWeb-2003), Acapulco, Mexico, pp. 73\u201378 (2003)"},{"key":"36_CR6","unstructured":"Cohen, E., Ravikumar, P., Fienberg, S.: A Comparison of String Metrics for Matching Names and Records. KDD Work. on Data Cleaning, Object Consolid (2003)"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Christen, P.: A Comparison of Personal Name Matching: Techniques and Practical Issues. Technical report, TR-CS-06-02, Computer Science Laboratory, The Australian National University, Canberra, Australia (2006)","DOI":"10.1109\/ICDMW.2006.2"},{"key":"36_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/11558637_13","volume-title":"Intelligent Media Technology for Communicative Intelligence","author":"J. Piskorski","year":"2005","unstructured":"Piskorski, J.: Named-entity recognition for polish with sProUT. In: Bolc, L., Michalewicz, Z., Nishida, T. (eds.) IMTCI 2004. LNCS (LNAI), vol.\u00a03490, pp. 122\u2013133. Springer, Heidelberg (2005)"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Elmagaramid, A., Ipeirotis, P., Verykios, V.: Duplicate Record Detection: A Survey. IEEE Transactions on Knowledge and Data Engineering\u00a019(1) (2007)","DOI":"10.1109\/TKDE.2007.250581"},{"key":"36_CR10","unstructured":"Piskorski, J., Wieloch, K., Sydow, M.: On Knowledge-poor Methods for Person Name Matching and Lemmatization for Highly Inflectional Languages. Information Retrieval: Special Issue on non-English Web Search (to appear, 2009)"},{"issue":"4","key":"36_CR11","first-page":"845","volume":"163","author":"V. Levenshtein","year":"1965","unstructured":"Levenshtein, V.: Binary Codes for Correcting Deletions, Insertions, and Reversals. Doklady Akademii Nauk SSSR\u00a0163(4), 845\u2013848 (1965)","journal-title":"Doklady Akademii Nauk SSSR"},{"issue":"3","key":"36_CR12","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"S. Needleman","year":"1970","unstructured":"Needleman, S., Wunsch, C.: A General Method Applicable to Search for Similarities in the Amino Acid Sequence of Two Proteins. Molec. Biol. J.\u00a048(3), 443\u2013453 (1970)","journal-title":"Molec. Biol. J."},{"key":"36_CR13","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"T.F. Smith","year":"1981","unstructured":"Smith, T.F., Waterman, M.S.: Identification of Common Molecular Subsequences. J. Mol. Biol.\u00a0147, 195\u2013197 (1981)","journal-title":"J. Mol. Biol."},{"key":"36_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/3-540-45735-6_24","volume-title":"String Processing and Information Retrieval","author":"I. Bartolini","year":"2002","unstructured":"Bartolini, I., Ciaccia, P., Patella, M.: String matching with metric trees using an approximate distance. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol.\u00a02476, pp. 271\u2013283. Springer, Heidelberg (2002)"},{"key":"36_CR15","unstructured":"Winkler, W.: The State of Record Linkage and Current Research Problems. Technical report, U.S. Bureau of the Census, Washington, DC (1999)"},{"issue":"1","key":"36_CR16","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(1), 191\u2013211 (1992)","journal-title":"Theoretical Computer Science"},{"key":"36_CR17","unstructured":"Gravano, L., Ipeirotis, P., Jagadish, H., Koudas, N., Muthukrishnan, S., Pietarinen, L., Srivastava, D.: Using q-grams in a DBMS for Approximate String Processing. IEEE Data Engineering Bulletin 24(4), 28\u201334 (2001)"},{"key":"36_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-540-39984-1_19","volume-title":"String Processing and Information Retrieval","author":"H. Keskustalo","year":"2003","unstructured":"Keskustalo, H., Pirkola, A., Visala, K., Lepp\u00e4nen, E., J\u00e4rvelin, K.: Non-adjacent digrams improve matching of cross-lingual spelling variants. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds.) SPIRE 2003. LNCS, vol.\u00a02857, pp. 252\u2013265. Springer, Heidelberg (2003)"},{"key":"36_CR19","unstructured":"Monge, A., Elkan, C.: The Field Matching Problem: Algorithms and Applications. In: Proceedings of Knowledge Discovery and Data Mining 1996, pp. 267\u2013270 (1996)"}],"container-title":["Lecture Notes in Computer Science","Human Language Technology. Challenges of the Information Society"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04235-5_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:17:45Z","timestamp":1558268265000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04235-5_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642042348","9783642042355"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04235-5_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}