{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T10:37:19Z","timestamp":1777891039019,"version":"3.51.4"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,10,18]],"date-time":"2021-10-18T00:00:00Z","timestamp":1634515200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,10,18]],"date-time":"2021-10-18T00:00:00Z","timestamp":1634515200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"crossref","award":["Summer of Code"],"award-info":[{"award-number":["Summer of Code"]}],"id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","award":["Summer of Code"],"award-info":[{"award-number":["Summer of Code"]}],"id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Machine Translation"],"published-print":{"date-parts":[[2021,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper presents an overview of Apertium, a free and open-source rule-based machine translation platform. Translation in Apertium happens through a pipeline of modular tools, and the platform continues to be improved as more language pairs are added. Several advances have been implemented since the last publication, including some new optional modules: a module that allows rules to process recursive structures at the structural transfer stage, a module that deals with contiguous and discontiguous multi-word expressions, and a module that resolves anaphora to aid translation. Also highlighted is the hybridisation of Apertium through statistical modules that augment the pipeline, and statistical methods that augment existing modules. This includes morphological disambiguation, weighted structural transfer, and lexical selection modules that learn from limited data. The paper also discusses how a platform like Apertium can be a critical part of access to language technology for so-called low-resource languages, which might be ignored or deemed unapproachable by popular corpus-based translation technologies. Finally, the paper presents some of the released and unreleased language pairs, concluding with a brief look at some supplementary Apertium tools that prove valuable to users as well as language developers. All Apertium-related code, including language data, is free\/open-source and available at <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"https:\/\/github.com\/apertium\">https:\/\/github.com\/apertium<\/jats:ext-link>.<\/jats:p>","DOI":"10.1007\/s10590-021-09260-6","type":"journal-article","created":{"date-parts":[[2021,10,19]],"date-time":"2021-10-19T00:07:34Z","timestamp":1634602054000},"page":"475-502","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Recent advances in Apertium, a free\/open-source rule-based machine translation platform for low-resource languages"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1284-4836","authenticated-orcid":false,"given":"Tanmai","family":"Khanna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1452-8204","authenticated-orcid":false,"given":"Jonathan N.","family":"Washington","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6108-2220","authenticated-orcid":false,"given":"Francis M.","family":"Tyers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5873-7270","authenticated-orcid":false,"given":"Sevilay","family":"Bayatl\u0131","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9847-8111","authenticated-orcid":false,"given":"Daniel G.","family":"Swanson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1207-5395","authenticated-orcid":false,"given":"Tommi A.","family":"Pirinen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6585-5902","authenticated-orcid":false,"given":"Irene","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4555-5742","authenticated-orcid":false,"given":"H\u00e8ctor","family":"Al\u00f2s i Font","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,18]]},"reference":[{"key":"9260_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.3384\/nejlt.2000-1533.1642","volume":"4","author":"L Antonsen","year":"2017","unstructured":"Antonsen L, Trosterud T, Tyers FM (2017) A North Saami to South Saami machine translation prototype. Lecture Notes Artif Intell 4:11\u201327. https:\/\/doi.org\/10.3384\/nejlt.2000-1533.1642","journal-title":"Lecture Notes Artif Intell"},{"key":"9260_CR2","doi-asserted-by":"crossref","unstructured":"Baldwin B (1997) CogNIAC: high precision coreference with limited knowledge and linguistic resources. In: Proceedings of a Workshop on Operational Factors in Practical, Robust Anaphora Resolution for Unrestricted Texts, Association for Computational Linguistics, pp 38\u201345, 10.3115\/1598819.1598825, http:\/\/portal.acm.org\/citation.cfm?doid=1598819.1598825","DOI":"10.3115\/1598819.1598825"},{"key":"9260_CR3","unstructured":"Bayatli S, Karanfil G, G\u00f6k\u0131rmak M, Tyers FM (2018a) Finite-state morphological analysis for Gagauz. In: Proceedings of the Eleventh International Conference on Language Resources and Evaluation (LREC 2018), European Language Resources Association (ELRA), Miyazaki, Japan, https:\/\/www.aclweb.org\/anthology\/L18-1411"},{"key":"9260_CR4","unstructured":"Bayatli S, Kurnaz S, Salimzianov I, Washington JN, Tyers FM (2018b) Rule-based machine translation from Kazakh to Turkish. In: European Association for Machine Translation (EAMT), pp 49\u201358"},{"issue":"2","key":"9260_CR5","doi-asserted-by":"publisher","first-page":"309","DOI":"10.6688\/JISE.202003_36(2).0010","volume":"36","author":"S Bayatli","year":"2020","unstructured":"Bayatli S, Kurnaz S, Ali A, Washington JN, Tyers FM (2020) Unsupervised weighting of transfer rules in rule-based machine translation using maximum-entropy approach. J Inf Sci Eng 36(2):309\u2013322. https:\/\/doi.org\/10.6688\/JISE.202003_36(2).0010","journal-title":"J Inf Sci Eng"},{"key":"9260_CR6","unstructured":"Bick E, Didriksen T (2015) CG-3 - beyond classical constraint grammar. In: Proceedings of the 20th Nordic Conference of Computational Linguistics, NODALIDA 2015(May), pp 11\u201313 (2015) Vilnius. Link\u00f6ping University Electronic Press, Link\u00f6pings universitet, Lithuania, pp 31\u201339"},{"key":"9260_CR7","unstructured":"Cherivirala S, Chiplunkar S, Washington J, Unhammer K (2018) Apertium\u2019s web toolchain for low-resource language technology. In: Proceedings of the AMTA 2018 Workshop on Technologies for MT of Low Resource Languages (LoResMT 2018), pp 53\u201362, https:\/\/www.aclweb.org\/anthology\/W18-2207\/"},{"issue":"4","key":"9260_CR8","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1162\/COLI\\_a\\_00302","volume":"43","author":"M Constant","year":"2017","unstructured":"Constant M, Eryi\u011fit G, Monti J, van der Plas L, Ramisch C, Rosner M, Todirascu A (2017) Multiword expression processing: a survey. Comput Linguist 43(4):837\u2013892. https:\/\/doi.org\/10.1162\/COLI_a_00302","journal-title":"Comput Linguist"},{"key":"9260_CR60","doi-asserted-by":"crossref","unstructured":"Cutting D, Kupiec J, Pedersen J, Sibun P (1992) A practical part-of-speech tagger. In: Proceeding of the 3rd conference on applied natural language processing. Trento, pp 133\u2013140","DOI":"10.3115\/974499.974523"},{"key":"9260_CR9","unstructured":"Faridee AZM, Tyers FM (2009) Development of a morphological analyser for Bengali. In: P\u00e9rez-Ortiz J, S\u00e1nchez-Mart\u00ednez F, Tyers F (eds) Proceedings of the First International Workshop on Free\/Open-Source Rule-Based Machine Translation, Universidad de Alicante. Departamento de Lenguajes y Sistemas Inform\u00e1ticos, Alicante, Spain, pp 43\u201350"},{"issue":"2","key":"9260_CR10","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10590-011-9090-0","volume":"25","author":"ML Forcada","year":"2011","unstructured":"Forcada ML, Ginest\u00ed-Rosell M, Nordfalk J, O\u2019Regan J, Ortiz-Rojas S, P\u00e9rez-Ortiz JA, S\u00e1nchez-Mart\u00ednez F, Ram\u00edrez-S\u00e1nchez G, Tyers FM (2011) Apertium: a free\/open-source platform for rule-based machine translation. Mach Transl 25(2):127\u2013144","journal-title":"Mach Transl"},{"key":"9260_CR11","doi-asserted-by":"crossref","unstructured":"Fronteddu G, Al\u00f2s i Font H, Tyers FM (2017) Una eina per a una llengua en proc\u00e9s d\u2019estandarditzaci\u00f3: el traductor autom\u00e0tic catal\u00e0\u2013sard. Linguam\u00e1tica 9(3):3\u201320","DOI":"10.21814\/lm.9.2.255"},{"key":"9260_CR12","unstructured":"G\u00f6k\u0131rmak M, Tyers FM, Washington JN (2019) A free\/open-source rule-based machine translation system for Crimean Tatar to Turkish. In: Proceedings of the 2nd Workshop on Technologies for MT of Low Resource Languages (LoResMT 2019, at Machine Translation Summit XVII), pp 24\u201331, https:\/\/www.aclweb.org\/anthology\/W19-68#page=30"},{"key":"9260_CR13","unstructured":"Ivanova S, Katinskaia A, Yangarber R (2019) Tools for supporting language learning for Sakha. In: Proceedings of the 22nd Nordic Conference on Computational Linguistics, Link\u00f6ping University Electronic Press, Turku, Finland, pp 155\u2013163, https:\/\/www.aclweb.org\/anthology\/W19-6117"},{"key":"9260_CR14","unstructured":"Johnson R, Pirinen TA, Puolakainen T, Tyers F, Trosterud T, Unhammer K (2017) North-S\u00e1mi to Finnish rule-based machine translation system. In: Proceedings of the 21st Nordic Conference on Computational Linguistics, NoDaLiDa, 22-24 May 2017, Gothenburg, Sweden, Link\u00f6ping University Electronic Press, 131, pp 115\u2013122"},{"key":"9260_CR15","doi-asserted-by":"crossref","unstructured":"Karlsson F, Voutilainen A, Heikkil\u00e4 J, Anttila A (1995) Constraint Grammar: a language-independent system for parsing unrestricted text, vol 4. Walter de Gruyter","DOI":"10.1515\/9783110882629"},{"key":"9260_CR16","unstructured":"Katinskaia A, Nouri J, Yangarber R (2018) Revita: a language-learning platform at the intersection of ITS and CALL. In: Proceedings of LREC: 11th International Conference on Language Resources and Evaluation, Miyazaki, Japan"},{"issue":"10","key":"9260_CR17","doi-asserted-by":"publisher","first-page":"e77056","DOI":"10.1371\/journal.pone.0077056","volume":"8","author":"A Kornai","year":"2013","unstructured":"Kornai A (2013) Digital language death. PLoS ONE 8(10):e77056. https:\/\/doi.org\/10.1371\/journal.pone.0077056","journal-title":"PLoS ONE"},{"key":"9260_CR18","unstructured":"Lappin S, Leass HJ (1994) An algorithm for pronominal anaphora resolution. Comput Linguist 20(4):535\u2013561"},{"key":"9260_CR19","doi-asserted-by":"crossref","unstructured":"Lee H, Chang A, Peirsman Y, Chambers N, Surdeanu M, Jurafsky D (2013) Deterministic coreference resolution based on entity-centric, precision-ranked rules. Comput Linguist 39(4):885\u2013916","DOI":"10.1162\/COLI_a_00152"},{"key":"9260_CR20","doi-asserted-by":"crossref","unstructured":"Lind\u00e9n K, Axelson E, Hardwick S, Silfverberg M, Pirinen T (2011) HFST\u2013framework for compiling and applying morphologies. In: Proceedings of Second International Workshop on Systems and Frameworks for Computational Morphology, pp 67\u201385","DOI":"10.1007\/978-3-642-23138-4_5"},{"key":"9260_CR21","doi-asserted-by":"publisher","unstructured":"Lo\u00e1iciga S, Wehrli \u00c9 (2015) Rule-based pronominal anaphora treatment for machine translation. In: Proceedings of the Second Workshop on Discourse in Machine Translation, Association for Computational Linguistics, pp 86\u201393, https:\/\/doi.org\/10.18653\/v1\/W15-2512, http:\/\/aclweb.org\/anthology\/W15-2512","DOI":"10.18653\/v1\/W15-2512"},{"key":"9260_CR23","unstructured":"Mart\u00edn-Mor A (2017) Technologies for endangered languages: the languages of Sardinia as a case in point. mTm J 9:365\u2013386"},{"key":"9260_CR24","unstructured":"Mart\u00ednez FS (2008) Using unsupervised corpus-based methods to build rule-based machine translation systems. phdthesis, Universidad de Alicante, https:\/\/www.dlsi.ua.es\/\/~fsanchez\/pub\/thesis\/thesis-sin.pdf"},{"key":"9260_CR25","unstructured":"Mart\u00ednez Cort\u00e9s JP, O\u2019Regan J, Tyers F (2012) Free\/open source shallow-transfer based machine translation for Spanish and Aragonese. In: Proceedings of the Eight International Conference on Language Resources and Evaluation (LREC\u201912), European Language Resources Association (ELRA)"},{"key":"9260_CR22","unstructured":"Marting M, Unhammer KB (2014) FST trimming: ending dictionary redundancy in Apertium. In: Proceedings of the 9th conference on language resources and evaluation, pp 19\u201324"},{"key":"9260_CR26","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1023\/A:1011184828072","volume":"14","author":"R Mitkov","year":"1999","unstructured":"Mitkov R (1999) Multilingual anaphora resolution. Mach Transl 14:281\u2013299","journal-title":"Mach Transl"},{"key":"9260_CR27","unstructured":"Moseley C (ed) (2010) Atlas of the World\u2019s Languages in Danger, 3rd edn. UNESCO, http:\/\/www.unesco.org\/languages-atlas\/index.php"},{"key":"9260_CR28","unstructured":"Otte P, Tyers FM, (2011) Rapid rule-based machine translation between Dutch and Afrikaans. In: EAMT, (2011) proceedings of the 15th conference of the European Association for Machine Translation, 30\u201331 May 2011. Belgium, Leuven"},{"key":"9260_CR29","unstructured":"Peradin H, Tyers FM (2012) A rule-based machine translation system from Serbo-Croatian to Macedonian. In: Third international workshop on free\/open-source rule-based machine translation (Free RBMT 2012), pp 55\u201363"},{"key":"9260_CR30","unstructured":"Pirinen TA (2019) Workflows for kickstarting RBMT in virtually no-resource situation. In: Proceedings of the 2nd workshop on technologies for MT of low resource languages"},{"key":"9260_CR31","doi-asserted-by":"crossref","unstructured":"Ravishankar V, Tyers FM (2017) Finite-state morphological analysis for Marathi. In: Proceedings of the 13th international conference on finite state methods and natural language processing","DOI":"10.18653\/v1\/W17-4006"},{"key":"9260_CR32","unstructured":"Salimzyanov I, Washington JN, Tyers FM (2013) A free\/open-source Kazakh-Tatar machine translation system. In: Sima\u2019an K, Forcada M, Grasmick D, Depraetere H, Way A (eds) Proceedings of the XIV machine translation summit. European Association for Machine Translation, pp 175\u2013182, http:\/\/www.mt-archive.info\/10\/MTS-2013-Salimzyanov.pdf"},{"key":"9260_CR35","doi-asserted-by":"publisher","unstructured":"S\u00e1nchez-Cartagena VM, P\u00e9rez-Ortiz JA, S\u00e1nchez-Mart\u00ednez F (2015) A generalised alignment template formalism and its application to the inference of shallow-transfer machine translation rules from scarce bilingual corpora. Comput Speech Lang 32(1):46\u201390 https:\/\/doi.org\/10.1016\/j.csl.2014.10.003","DOI":"10.1016\/j.csl.2014.10.003"},{"key":"9260_CR36","unstructured":"S\u00e1nchez-Mart\u00ednez F, Forcada ML (2007) Automatic induction of shallow-transfer rules for open-source machine translation. In: Way A, Gawronska B (eds) Proceedings of the 11th conference on theoretical and methodological issues in machine translation (TMI 2007), Sk\u00f6vde University Studies in Informatics, 2007(1):181\u2013190"},{"key":"9260_CR37","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1613\/jair.2735","volume":"34","author":"F S\u00e1nchez-Mart\u00ednez","year":"2009","unstructured":"S\u00e1nchez-Mart\u00ednez F, Forcada ML (2009) Inferring shallow-transfer machine translation rules from small parallel corpora. J Artif Intell Res 34:605\u2013635","journal-title":"J Artif Intell Res"},{"key":"9260_CR38","doi-asserted-by":"publisher","unstructured":"S\u00e1nchez-Mart\u00ednez F, Ney H (2006) Using alignment templates to infer shallow-transfer machine translation rules. In: Salakoski T, Ginter F, Pyysalo S, Pahikkala T (eds) Advances in natural language processing, vol 4139, Springer, Berlin Heidelberg, pp 756\u2013767, https:\/\/doi.org\/10.1007\/11816508_75, http:\/\/link.springer.com\/10.1007\/11816508_75","DOI":"10.1007\/11816508_75"},{"key":"9260_CR39","doi-asserted-by":"crossref","unstructured":"S\u00e1nchez-Mart\u00ednez F, P\u00e9rez-Ortiz JA, Forcada ML (2006) Speeding up target language driven part-of-speech tagger training for machine translation. In: Proceedings of the 5th Mexican International conference on artificial intelligence, MICAI 2006, pp 844\u2013854","DOI":"10.1007\/11925231_81"},{"key":"9260_CR40","unstructured":"S\u00e1nchez-Mart\u00ednez F, Armentano-Oller C, P\u00e9rez-Ortiz JA, Forcada ML (2007) Training part-of-speech taggers to build machine translation systems for less-resourced language pairs. In: Procesamiento del Lenguaje Natural, (XXIII Congreso de la Sociedad Espa\u00f1ola de Procesamiento del Lenguaje Natural, Sevilla, Spain, 10-12\/09\/2007, pp 257\u2013264"},{"key":"9260_CR33","unstructured":"Saykhunov M, Khusainov R, Ibragimov T (2019) Slo\u017enosti pri sozdanii tekstovogo korpusa ob\u2019jomom boleje 400 mln tokenov. In: Finno-ugorskij mir v polietni\u010dnom prostranstve Rossii: kulturnoje nasledije i novyje vyzovy: sbornik statej po materialam VI Vserossijskoj nau\u010dnoj konferencii finno-ugrovedov, UdmFITS UrO RAN, pp 548\u2013554"},{"key":"9260_CR34","unstructured":"Swanson DG, Washington JN, Tyers FM, Forcada ML (2021) A tree-based structural transfer module for the Apertium machine translation platform. Machine Translation (in press)"},{"key":"9260_CR41","unstructured":"Translators without Borders (2016) Translators without Borders develops world\u2019s first crisis-specific machine translation for Kurdish. Slator https:\/\/slator.com\/press-releases\/translators-without-borders-develops-the-worlds-first-crisis-specific-machine-translation-system-for-kurdish-languages\/"},{"key":"9260_CR42","unstructured":"Trosterud T, Unhammer KB (2012) Evaluating North S\u00e1mi to Norwegian assimilation RBMT. In: Third international workshop on free\/open-source rule-based machine translation (FreeRBMT 2012), pp 13\u201325"},{"key":"9260_CR43","unstructured":"Trouilleux F (2002) A rule-based pronoun resolution system for French. 4th Discourse Anaphora and Anaphor Resolution Colloquium p\u00a07"},{"key":"9260_CR44","unstructured":"Tyers FM (2009) Rule-based augmentation of training data in Breton\u2013French statistical machine translation. In: Proceedings of the 13th annual conference of the european association of machine translation, EAMT09, pp 213\u2013218"},{"key":"9260_CR45","unstructured":"Tyers FM (2010) Rule-based Breton to French machine translation. In: Proceeedings of the 14th annual conference of the European association of machine translation, EAMT10, pp 174\u2013181"},{"key":"9260_CR46","doi-asserted-by":"publisher","first-page":"57","DOI":"10.2478\/v10108-009-0016-4","volume":"91","author":"FM Tyers","year":"2009","unstructured":"Tyers FM, Donnelly K (2009) apertium-cy\u2014a collaboratively-developed free RBMT system for Welsh to English. Prague Bull Math Linguist 91:57\u201366","journal-title":"Prague Bull Math Linguist"},{"key":"9260_CR47","unstructured":"Tyers FM, Wiechetek L, Trosterud T (2009) Developing prototypes for machine translation between two S\u00e1mi languages. In: Proceedings of the 13th Annual Conference of the European Association of Machine Translation, EAMT09, pp 120\u2013128"},{"key":"9260_CR48","unstructured":"Tyers FM, S\u00e1nchez-Mart\u00ednez F, Forcada ML, et al. (2012a) Flexible finite-state lexical selection for rule-based machine translation. In: Proceedings of the 16th EAMT Conference, European association for machine translation"},{"key":"9260_CR49","unstructured":"Tyers FM, Washington JN, Salimzyanov I, Batalov R (2012b) A prototype machine translation system for Tatar and Bashkir based on free\/open-source components. In: First workshop on language resources and technologies for Turkic languages, p\u00a011"},{"key":"9260_CR50","unstructured":"Tyers FM, S\u00e1nchez-Mart\u00ednez F, Forcada ML (2014) Unsupervised training of maximum-entropy models for lexical selection in rule-based machine translation. In: Proceedings of the 18th annual conference of the european association for machine translation, pp 145\u2013153"},{"key":"9260_CR51","doi-asserted-by":"publisher","unstructured":"Tyers FM, Fronteddu G, Al\u00f2s i Font H, Mart\u00edn-Mor A (2017) Rule-based machine translation for the Italian\u2013Sardinian language pair. Prague Bull Math Linguist pp 221\u2013232 https:\/\/doi.org\/10.1515\/pralin-2017-0022","DOI":"10.1515\/pralin-2017-0022"},{"key":"9260_CR52","unstructured":"Washington JN, Salimzianov I, Tyers FM, G\u00f6k\u0131rmak M, Ivanova S, Kuyruk\u00e7u O (to appear) Free\/open-source technologies for Turkic languages developed in the Apertium project. In: Proceedings of the seventh international conference on computer processing of Turkic languages (TurkLang 2019)"},{"key":"9260_CR53","doi-asserted-by":"crossref","unstructured":"Zeldes A, Zhang S (2016) When annotation schemes change rules help: A configurable approach to coreference resolution beyond ontonotes. In: Proceedings of the NAACL2016 workshop on coreference resolution beyond ontonotes (CORBON), pp 92\u2013101","DOI":"10.18653\/v1\/W16-0713"},{"key":"9260_CR54","doi-asserted-by":"publisher","unstructured":"Zhang Y, Clark S (2011) Syntactic processing using the generalized perceptron and beam search. Comput Linguistic 37(1):105\u2013151 https:\/\/doi.org\/10.1162\/coli_a_00037","DOI":"10.1162\/coli_a_00037"}],"container-title":["Machine Translation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10590-021-09260-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10590-021-09260-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10590-021-09260-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T07:11:22Z","timestamp":1643008282000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10590-021-09260-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,18]]},"references-count":55,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["9260"],"URL":"https:\/\/doi.org\/10.1007\/s10590-021-09260-6","relation":{},"ISSN":["0922-6567","1573-0573"],"issn-type":[{"value":"0922-6567","type":"print"},{"value":"1573-0573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,18]]},"assertion":[{"value":"17 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 October 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}