{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T19:05:32Z","timestamp":1760123132253,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030880804"},{"type":"electronic","value":"9783030880811"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-88081-1_48","type":"book-chapter","created":{"date-parts":[[2021,9,29]],"date-time":"2021-09-29T11:07:08Z","timestamp":1632913628000},"page":"643-654","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Universal Programs for Stemming, Segmentation, Morphological Analysis of Turkic Words"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9878-981X","authenticated-orcid":false,"given":"Ualsher","family":"Tukeyev","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2023-1573","authenticated-orcid":false,"given":"Aidana","family":"Karibayeva","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9660-6928","authenticated-orcid":false,"given":"Aliya","family":"Turganbayeva","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0728-905X","authenticated-orcid":false,"given":"Dina","family":"Amirova","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,30]]},"reference":[{"key":"48_CR1","unstructured":"Tukeyev, U.: Automaton models of the morphology analysis and the completeness of the endings of the Kazakh language. In: Proceedings of the International Conference \u201cTurkic languages processing\u201d TURKLANG-2015, pp. 91\u2013100. Kazan, Tatarstan, Russia, 17\u201319 Sep 2015 (in Russian)"},{"key":"48_CR2","unstructured":"Porter Stemming for Russian language. https:\/\/eigenein.xyz\/snowball\/Russian_stemming_algorithm (2015)"},{"key":"48_CR3","unstructured":"Segalovich, I.: A fast morphological algorithm with unknown word guessing induced by a dictionary for a web search. In: Proceedings of the International Conference on Machine Learning; Models, Technologies and Applications, MLMTA 2003, pp. 273\u2013280. Las Vegas, Nevada, USA (2003)"},{"issue":"3","key":"48_CR4","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1108\/00330330610681295","volume":"40","author":"P Willett","year":"2006","unstructured":"Willett, P.: The Porter stemming algorithm: then and now. Program Electron. Library Inf. Syst. B 40(3), 219\u2013223 (2006)","journal-title":"Program Electron. Library Inf. Syst. B"},{"key":"48_CR5","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.procs.2016.04.056","volume":"81","author":"Y Yeong","year":"2016","unstructured":"Yeong, Y., Tan, T., Mohammad, S.: Using dictionary and lemmatizer to improve low resource English-Malay statistical machine translation system. Procedia Comput. Sci. 81, 243\u2013249 (2016)","journal-title":"Procedia Comput. Sci."},{"key":"48_CR6","doi-asserted-by":"crossref","unstructured":"Gupta, V., Joshi, N., Mathur, I.: Rule based stemmer in Urdu. In: Proceedings of 4th International Conference on Computer and Communication Technology (ICCCT), pp. 129\u2013132 (2013)","DOI":"10.1109\/ICCCT.2013.6749615"},{"key":"48_CR7","doi-asserted-by":"publisher","unstructured":"Suryani, A.A., Widyantoro D.H., Purwarianti A., Sudaryat Y.: The rule-based Sundanese stemmer. ACM Trans. Asian Low Resour. Lang. Inf. Process. 17(4) Article No. 27 (2018). https:\/\/doi.org\/10.1145\/3195634","DOI":"10.1145\/3195634"},{"key":"48_CR8","doi-asserted-by":"crossref","unstructured":"Briakou, E., Carpuat, M.: The University of Maryland\u2019s Kazakh\u2013English neural machine translation system at WMT19. In: Proceedings of the Fourth Conference on Machine Translation, pp. 134\u2013140. Florence, Italy (2019)","DOI":"10.18653\/v1\/W19-5308"},{"key":"48_CR9","doi-asserted-by":"crossref","unstructured":"Casas N., Fonollosa, J.A.R., Escolano, C., Basta, C., Costa-juss\u00e0, M.R.: The TALP-UPC machine translation systems for WMT19 news translation task: pivoting techniques for low resource MT. In: Proceedings of the Fourth Conference on Machine Translation (WMT19), pp. 155\u2013162. Florence, Italy (2019)","DOI":"10.18653\/v1\/W19-5311"},{"key":"48_CR10","doi-asserted-by":"crossref","unstructured":"Littell, P., Lo, C., Larkin, S., Stewart, D.: Multi-source transformer for Kazakh-Russian-English neural machine translation. In: Proceedings of the Fourth Conference on Machine Translation (WMT19), pp. 267\u2013274. Florence, Italy (2019)","DOI":"10.18653\/v1\/W19-5326"},{"key":"48_CR11","doi-asserted-by":"crossref","unstructured":"Kocmi, T., Bojar, O.: CUNI submission for low-resource languages in WMT news 2019. In: Proceedings of the Fourth Conference on Machine Translation (WMT19), pp. 234\u2013240. Florence, Italy (2019)","DOI":"10.18653\/v1\/W19-5322"},{"key":"48_CR12","doi-asserted-by":"crossref","unstructured":"S\u00e1nchez-Cartagena, V., P\u00e9rez-Ortiz, J.A, S\u00e1nchez-Mart\u00ednez, F.: The Universitat d\u2019Alacant submissions to the English-to-Kazakh news translation task at WMT 2019. In: Proceedings of the Fourth Conference on Machine Translation (WMT19). Florence, Italy (2019)","DOI":"10.18653\/v1\/W19-5339"},{"key":"48_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/3-540-38076-0_26","volume-title":"Advances in Informatics","author":"G Petasis","year":"2003","unstructured":"Petasis, G., Karkaletsis, V., Farmakiotou, D., Androutsopoulos, I., Spyropoulo, C.D.: A Greek morphological lexicon and its exploitation by natural language processing applications. In: Manolopoulos, Y., Evripidou, S., Kakas, A.C. (eds.) PCI 2001. LNCS, vol. 2563, pp. 401\u2013419. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-38076-0_26"},{"key":"48_CR14","unstructured":"Brown, D.P., Evans, N., Tiberius, C., Corbett, G.G.: A large-scale inheritance based morphological lexicon for Russian. In: Erjavec, T., Vitas, D. (eds) Proceedings of the Workshop on Morphological Processing of Slavic Languages, 10th Conference of the European Chapter of the Association for Computational Linguistics. Budapest (2003)"},{"key":"48_CR15","unstructured":"Sagot, B., Walther, G.: A morphological lexicon for the Persian language. In: Proceedings of the 7th Language Resources and Evaluation Conference (LREC 2010). La Valette, Malta (2010)"},{"key":"48_CR16","doi-asserted-by":"crossref","unstructured":"Buys, J., Botha, J.: Cross-lingual morphological tagging for low-resource languages. In: Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics, vol. 1, pp. 1954\u20131964 (2016)","DOI":"10.18653\/v1\/P16-1184"},{"key":"48_CR17","unstructured":"Klyachko, E., Sorokin A., Krizhanovsky, N., Krizhanovsky, A., Ryazanskaya, G.: LowResourceEval-2019: a shared task on morphological analysis for low-resource languages. Dialog 2019, Issue 18, Supplementary volume, pp. 45\u201362 (2020)"},{"key":"48_CR18","doi-asserted-by":"crossref","unstructured":"Shi, X., Padhi, I., Knight, K.: Does string-based neural MT learn source syntax? In: Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing, pp. 1526\u20131534. Austin, Texas (2016)","DOI":"10.18653\/v1\/D16-1159"},{"key":"48_CR19","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1007\/978-3-030-63119-2_60","volume-title":"Advances in Computational Collective Intelligence","author":"U Tukeyev","year":"2020","unstructured":"Tukeyev, U., Karibayeva, A.: Inferring the complete set of Kazakh endings as a language resource. In: Hernes, M., Wojtkiewicz, K., Szczerbicki, E. (eds.) ICCCI 2020. CCIS, vol. 1287, pp. 741\u2013751. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-63119-2_60"},{"key":"48_CR20","doi-asserted-by":"crossref","unstructured":"Tukeyev, U., Turganbayeva, A., Abduali, B., Rakhimova, D., Amirova, D., Karibayeva, A.: Lexicon-free stemming for Kazakh language information retrieval. In: Proceeding of 12th International Conference on Application of Information and Communication Technologies (AICT), pp. 95\u201398. Almaty (2018)","DOI":"10.1109\/ICAICT.2018.8747021"},{"issue":"1","key":"48_CR21","doi-asserted-by":"publisher","first-page":"1856500","DOI":"10.1080\/23311916.2020.1856500","volume":"7","author":"U Tukeyev","year":"2020","unstructured":"Tukeyev, U., Karibayeva, A., Zhumanov, Z.: Morphological segmentation method for turkic language neural machine translation. Cogent Eng. 7(1), 1856500 (2020). https:\/\/doi.org\/10.1080\/23311916.2020.1856500","journal-title":"Cogent Eng."},{"key":"48_CR22","unstructured":"NLP-KazNU. http:\/\/github.com\/NLP-KAZNU"}],"container-title":["Lecture Notes in Computer Science","Computational Collective Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-88081-1_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,29]],"date-time":"2021-09-29T11:28:38Z","timestamp":1632914918000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-88081-1_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030880804","9783030880811"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-88081-1_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCCI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Collective Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rhodos","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccci2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccci.pwr.edu.pl\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"231","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"58","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}