{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:43:11Z","timestamp":1725565391005},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540225645"},{"type":"electronic","value":"9783540277798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27779-8_20","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T20:16:34Z","timestamp":1284581794000},"page":"229-241","source":"Crossref","is-referenced-by-count":2,"title":["Testing Word Similarity: Language Independent Approach with Examples from Romance"],"prefix":"10.1007","author":[{"given":"Mikhail","family":"Alexandrov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xavier","family":"Blanco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Makagonov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","volume-title":"Modern Information Retrieval","author":"R. Baeza-Yates","year":"1999","unstructured":"Baeza-Yates, R., Ribero-Neto, B.: Modern Information Retrieval. Addison-Wesley, Reading (1999)"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Cramer, H.: Mathematical methods of statistics, Cambridge (1946)","DOI":"10.1515\/9781400883868"},{"issue":"3","key":"20_CR3","first-page":"167","volume":"6","author":"A. Gelbukh","year":"2003","unstructured":"Gelbukh, A.: Exact and approximate prefis search under access locality requirements for morphological analysis and spelling correction. Computaci\u00f3n y Sistemas\u00a06(3), 167\u2013182 (2003)","journal-title":"Computaci\u00f3n y Sistemas"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/3-540-44686-9_33","volume-title":"Computational Linguistics and Intelligent Text Processing","author":"A. Gelbukh","year":"2001","unstructured":"Gelbukh, A., Sidorov, G.: Zipf and Heaps Laws\u2019 Coefficients Depend on Language. In: Gelbukh, A. (ed.) CICLing 2001. LNCS, vol.\u00a02004, pp. 332\u2013335. Springer, Heidelberg (2001)"},{"key":"20_CR5","first-page":"105","volume":"29","author":"A. Gelbukh","year":"2002","unstructured":"Gelbukh, A., Sidorov, G.: Morphological Analysis of Inflective Languages through Generation. Procesamiento de Lenguaje Natural\u00a0(29), 105\u2013112 (2002)","journal-title":"Procesamiento de Lenguaje Natural"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/3-540-36456-0_21","volume-title":"Computational Linguistics and Intelligent Text Processing","author":"A. Gelbukh","year":"2003","unstructured":"Gelbukh, A., Sidorov, G.: Approach to construction of automatic morphological analysis systems for inflective languages with little effort. In: Gelbukh, A. (ed.) CICLing 2003. LNCS, vol.\u00a02588, pp. 215\u2013220. Springer, Heidelberg (2003)"},{"key":"20_CR7","unstructured":"Ivahnenko, A.:: Manual on typical algorithms of modeling. Tehnika Publ., Kiev (1980) (in Russian)"},{"key":"20_CR8","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-45433-0_33","volume-title":"Advances in Natural Language Processing","author":"P. Makagonov","year":"2002","unstructured":"Makagonov, P., Alexandrov, M.: Constructing empirical formulas for testing word similarity by the inductive method of model self-organization. In: Ranchhold, Mamede (eds.) Advances in Natural Language Processing. LNCS (LNAI), vol.\u00a02379, pp. 239\u2013247. Springer, Heidelberg (2002)"},{"key":"20_CR9","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1108\/eb046814","volume":"14","author":"M. Porter","year":"1980","unstructured":"Porter, M.: An algorithm for suffix stripping. Program\u00a014, 130\u2013137 (1980)","journal-title":"Program"}],"container-title":["Lecture Notes in Computer Science","Natural Language Processing and Information Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27779-8_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:20:21Z","timestamp":1605759621000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27779-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540225645","9783540277798"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27779-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}