| { |
| "paper_id": "W19-0309", |
| "header": { |
| "generated_with": "S2ORC 1.0.0", |
| "date_generated": "2023-01-19T06:26:02.111211Z" |
| }, |
| "title": "Neural and rule-based Finnish NLP models-expectations, experiments and experiences", |
| "authors": [ |
| { |
| "first": "Tommi", |
| "middle": [ |
| "A" |
| ], |
| "last": "Pirinen", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "Universit\u00e4t Hamburg Hamburger Zentrum f\u00fcr Sprachkorpora", |
| "location": { |
| "addrLine": "Max-Brauer-Allee 60", |
| "postCode": "D-22765", |
| "settlement": "Hamburg" |
| } |
| }, |
| "email": "tommi.antero.pirinen@uni-hamburg.de" |
| } |
| ], |
| "year": "", |
| "venue": null, |
| "identifiers": {}, |
| "abstract": "In this article I take a critical look at some recent results in the field of neural language modeling of Finnish in terms of popular shared tasks. One novel point of view I present is comparing the neural methods' results to traditional rule-based systems for the given tasks, since most of the shared tasks have concentrated on the supervised learning concept. The shared task results I re-evaluate, are morphological regeneration by SIGMORPHON 2016, universal dependency parsing by CONLL-2018 and a machine translation application that imitates WMT 2018 for German instead of English. The Uralic language used throughout is Finnish. I use out of the box, best performing neural systems and rule-based systems and evaluate their results. Tiivistelm\u00e4 T\u00e4ss\u00e4 artikkelissa tarkastelemme joitain hiljattaisia tuloksia niinkutsutuissa shared task-kilpailuissa suomen kielen hemroverkkomallien osalta. Yksi t\u00e4m\u00e4n artikkelin kontribuutioista on hermoverkkomallien tuottamien tulosten vertailu perinteisiin s\u00e4\u00e4nt\u00f6pohjaisiin kielimallituloksiin, sill\u00e4 shared task-kisailut p\u00e4\u00e4osin keskittyv\u00e4t t\u00e4ysin tai osittain hallitsemattomien mallien oppimisen konseptiin. Shared taskit joita t\u00e4ss\u00e4 artikkelissa tarkastelemme ovat SIGMORPHONin 2016 morfologisen uudelleengeneroinnin kisa, CONLL:n 2018 j\u00e4sennyskilpailu sek\u00e4 WMT 2018:n konek\u00e4\u00e4nn\u00f6skilpailu uudelleensovellettuna saksan kielelle. Uralilainen kieli jota k\u00e4yt\u00e4mme kaikissa kokeissa on suomi. J\u00e4rjestelm\u00e4t joita k\u00e4ytet\u00e4\u00e4n ovat avoimen l\u00e4hdekoodin j\u00e4rjestelmi\u00e4 jotka ovat olleet parhaita n\u00e4iss\u00e4 kilpailuissa.", |
| "pdf_parse": { |
| "paper_id": "W19-0309", |
| "_pdf_hash": "", |
| "abstract": [ |
| { |
| "text": "In this article I take a critical look at some recent results in the field of neural language modeling of Finnish in terms of popular shared tasks. One novel point of view I present is comparing the neural methods' results to traditional rule-based systems for the given tasks, since most of the shared tasks have concentrated on the supervised learning concept. The shared task results I re-evaluate, are morphological regeneration by SIGMORPHON 2016, universal dependency parsing by CONLL-2018 and a machine translation application that imitates WMT 2018 for German instead of English. The Uralic language used throughout is Finnish. I use out of the box, best performing neural systems and rule-based systems and evaluate their results. Tiivistelm\u00e4 T\u00e4ss\u00e4 artikkelissa tarkastelemme joitain hiljattaisia tuloksia niinkutsutuissa shared task-kilpailuissa suomen kielen hemroverkkomallien osalta. Yksi t\u00e4m\u00e4n artikkelin kontribuutioista on hermoverkkomallien tuottamien tulosten vertailu perinteisiin s\u00e4\u00e4nt\u00f6pohjaisiin kielimallituloksiin, sill\u00e4 shared task-kisailut p\u00e4\u00e4osin keskittyv\u00e4t t\u00e4ysin tai osittain hallitsemattomien mallien oppimisen konseptiin. Shared taskit joita t\u00e4ss\u00e4 artikkelissa tarkastelemme ovat SIGMORPHONin 2016 morfologisen uudelleengeneroinnin kisa, CONLL:n 2018 j\u00e4sennyskilpailu sek\u00e4 WMT 2018:n konek\u00e4\u00e4nn\u00f6skilpailu uudelleensovellettuna saksan kielelle. Uralilainen kieli jota k\u00e4yt\u00e4mme kaikissa kokeissa on suomi. J\u00e4rjestelm\u00e4t joita k\u00e4ytet\u00e4\u00e4n ovat avoimen l\u00e4hdekoodin j\u00e4rjestelmi\u00e4 jotka ovat olleet parhaita n\u00e4iss\u00e4 kilpailuissa.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Abstract", |
| "sec_num": null |
| } |
| ], |
| "body_text": [ |
| { |
| "text": "The popularity of the neural networks in natural language processing is at the moment climbing very rapidly to the extent that we commonly get to hear that non-neural methods should be abandoned. While naturally the majority of this hype is based on English-centric or mostly European NLP, there are some reports of good successes within the less resourced and more morphological languages, including Uralic languages. In this paper I compare directly the state-of-the-art methods between the neural and rule-based language processing for Finnish. I specifically devised experiments based on the following shared tasks and popular systems:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "\u2022 Generating morphology: Sigmorphon 2016 results (Cotterell et al., 2016) vs.", |
| "cite_spans": [ |
| { |
| "start": 49, |
| "end": 73, |
| "text": "(Cotterell et al., 2016)", |
| "ref_id": "BIBREF1" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "omorfi (Pirinen, 2015a) \u2022 Parsing of morphosyntax: Turku neural parser (Kanerva et al., 2018) vs. omorfi (Pirinen, 2015a) \u2022 Machine translation between Finnish and German: OpenNMT (Klein et al., 2017) vs. apertium-fin-deu (Pirinen, 2018) Comparing a few different tasks gives us a good overview of the state of the art in the neural processing of Finnish. Parsing tasks give an idea of the potential usability of the language models in various linguistic tasks, such as corpus annotation, whereas the machine translation task provides an important view on the full capacity of the models for a more wide-ranging language understanding task.", |
| "cite_spans": [ |
| { |
| "start": 7, |
| "end": 23, |
| "text": "(Pirinen, 2015a)", |
| "ref_id": "BIBREF9" |
| }, |
| { |
| "start": 71, |
| "end": 93, |
| "text": "(Kanerva et al., 2018)", |
| "ref_id": "BIBREF3" |
| }, |
| { |
| "start": 105, |
| "end": 121, |
| "text": "(Pirinen, 2015a)", |
| "ref_id": "BIBREF9" |
| }, |
| { |
| "start": 180, |
| "end": 200, |
| "text": "(Klein et al., 2017)", |
| "ref_id": "BIBREF5" |
| }, |
| { |
| "start": 222, |
| "end": 237, |
| "text": "(Pirinen, 2018)", |
| "ref_id": "BIBREF11" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "One of the contributions of this paper is to gain more insight of the similarities and differences of the traditional rule-based systems for the given tasks, since the shared tasks are virtually always earmarked for more or less supervised language learning, any evaluations between the neural and the rule-based systems are not so commonly found in the literature.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "The rest of article is organised as follows: in Section 2, I introduce the shared tasks and rule-based systems at large, in Section 3, I describe the systems used for the experiments, in Section 4, I describe the system setup, in Section 5, I go through the experiments and results, in Section 6, I perform the error analysis, in Section 7, I relate the results to current state of the art as well as practical usage and development of the systems and finally in Section 8, I summarise the findings.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "In recent years the neural network-based systems, especially so-called deep neural systems, have been brought forward as a solution to all natural language processing problems. Some results have also been provided for Uralic languages. In the case of morphology, there was a popular task of morphological generation as a shared task of the ACL 2016 SIGMORPHON workshop (Cotterell et al., 2016) , which included the Finnish generation, and showed some very promising results. In the context of the machine translation, the shared task of the WMT conference has had a Finnish task since 2015, and since 2017 the participants have predominantly been the neural systems (e.g. for 2018 c.f Bojar et al. (2018) ). For the morphosyntax, the popular shared task to test a parser with, is the CONLL task on the dependency parsing (Zeman et al., 2018) . What is common with these shared tasks, is that they are aimed for supervised learning of such language models, while in the Uralic NLP the predominant methodology is rule-based, expert-written systems (Moshagen et al., 2014) . In this article, I take a practical comparison of building and using the systems for the given tasks as well as a tool in actual linguistic research.", |
| "cite_spans": [ |
| { |
| "start": 369, |
| "end": 393, |
| "text": "(Cotterell et al., 2016)", |
| "ref_id": "BIBREF1" |
| }, |
| { |
| "start": 685, |
| "end": 704, |
| "text": "Bojar et al. (2018)", |
| "ref_id": "BIBREF0" |
| }, |
| { |
| "start": 821, |
| "end": 841, |
| "text": "(Zeman et al., 2018)", |
| "ref_id": "BIBREF12" |
| }, |
| { |
| "start": 1046, |
| "end": 1069, |
| "text": "(Moshagen et al., 2014)", |
| "ref_id": "BIBREF8" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Background", |
| "sec_num": "2" |
| }, |
| { |
| "text": "Omorfi 445,453 58 Apertium-fin-deu 13,119 93 Table 1 : Size of the dictionaries in rule-based systems.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 45, |
| "end": 52, |
| "text": "Table 1", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Words Rules", |
| "sec_num": null |
| }, |
| { |
| "text": "Omorfi 1 is a lexical database of Finnish, that can be compiled into a finite-state automaton for efficient parsing. Omorfi has wide support for morphological analysis and generation (matching the SIGMORPHON task of morphological regeneration) and parsing (matching the CONLL task for parsing). Apertium-fin-deu 2 is a handcrafted rule-based machine translation system based on omorfi, with an addition of a bilingual dictionary and some sets of bilingual rules. This can be used with the apertium tools to translate between German and Finnish. The default mode of operation in a rule-based system is often based on the concept of all possible hypotheses, this is in contrast to shared tasks, which are based on 1-best parsing instead; measuring the results is based on only a single hypothesis per token. To bridge this gap between rule-based morphology and shared tasks, I have used a combination of popular strategies implemented with python scripting language. 3 These strategies build in principle on both constraint grammar (Karlsson, 1990 ; Pirinen, 2015b) and my previous experiences with unigram models in rule-based morphologies (Lind\u00e9n and Pirinen, 2009) , it may, however, be noteworthy that at the time of the writing the solution described is very much a work in progress, so it should not be understood as having any specific advances over the above-referred previous experiments yet. Furthermore, to perform the SIGMORPHON and CONLL tasks I have written small python scripts to analyse and map the analyses between omorfi's formats and theirs. For machine translation I use the apertium command and discard the debugging symbols. Examples of the output mangling we perform can be seen in listing 1. As can be seen in the example, the token 7 (2017) has no rule-based dependency analysis, since it is not covered by the very basic dependency labeling script we use.", |
| "cite_spans": [ |
| { |
| "start": 965, |
| "end": 966, |
| "text": "3", |
| "ref_id": null |
| }, |
| { |
| "start": 1030, |
| "end": 1045, |
| "text": "(Karlsson, 1990", |
| "ref_id": "BIBREF4" |
| }, |
| { |
| "start": 1139, |
| "end": 1165, |
| "text": "(Lind\u00e9n and Pirinen, 2009)", |
| "ref_id": "BIBREF7" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Methods and Datasets", |
| "sec_num": "3" |
| }, |
| { |
| "text": "Some statistics of the rule-based dictionaries can be seen in the table 1. The Turku neural parsing pipeline (refered from now on to as TNPP) 4 is a recent, popular parser for a language-independent parsing of the dependency structures. They ranked highly in the 2018 CONLL shared task. For the experiments of this paper, I have downloaded the system following the instructions and have not changed any hyperparametres. The model used is fi_tdt.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Methods and Datasets", |
| "sec_num": "3" |
| }, |
| { |
| "text": "OpenNMT 5 is one of the many popular neural systems for machine translation. For these experiments I chose it because it provides usable python bindings and it seemed most robust in our early experiments.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Methods and Datasets", |
| "sec_num": "3" |
| }, |
| { |
| "text": "The training was performed based on the instructions in the Table 2 : Size of the corpora in sentences and no additional hyperparametre-tuning was performed. The training was based on europarl version 7 (Koehn, 2005) , pre-processed as suggested on their website 7 . The resulting corpus is summarised in Table 2 .", |
| "cite_spans": [ |
| { |
| "start": 203, |
| "end": 216, |
| "text": "(Koehn, 2005)", |
| "ref_id": "BIBREF6" |
| } |
| ], |
| "ref_spans": [ |
| { |
| "start": 60, |
| "end": 67, |
| "text": "Table 2", |
| "ref_id": null |
| }, |
| { |
| "start": 305, |
| "end": 312, |
| "text": "Table 2", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Methods and Datasets", |
| "sec_num": "3" |
| }, |
| { |
| "text": "An interesting part of this experiment is the setup, since one of the aspects we present in this paper is usability testing of the neural vs. traditional methods for use of an average Computational Uralist, I also want to get a feel of the user experience (UX).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Experimental setup", |
| "sec_num": "4" |
| }, |
| { |
| "text": "The system setup for all the systems is quite similar, all the free and open software used in these experiments are hosted by github. After cloning, the traditional rulebased systems rely on classical command-line installations, this means that user is expected to install dependencies the best they see and then run compilation of the data using configure and make scripts, and neural systems use python equivalents. In terms of dependencies, all systems are basically well covered with some easy way to install necessary dependencies with single command, such as pip or apt-get. A bit like rule-based systems, the neural systems need to \"compile\" i.e. learn neural network binaries from large data, in practice the experience for the end user is the same, except for the wait time, which is slightly longer for the neural-based systems. For Finnish analysers an option is provided to download readily compiled models, while for translation models there is no option. This is equally true for both neural and rule-based models. To parse or translate I have run the systems with default / suggested settings.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Experimental setup", |
| "sec_num": "4" |
| }, |
| { |
| "text": "To get an idea of intended mode of use (instant, batch processing over the weekend) of the systems and steps, I have collected some of our usage times in the table 3. The real bottleneck for our experiments was the neural machine translation training time, the multi-day training period is problematic in itself, but it is also fragile enough that minor impurities in parallel corpus may ruin the whole model which means that on typical use case user may need to train the model multiple times before reaching to a functional one.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Experimental setup", |
| "sec_num": "4" |
| }, |
| { |
| "text": "To know how much time to create a system takes from scratch it is also useful to know the amount of data is needed to build it; for rule-based systems this is the size of dictionary, and rule-sets, for neural system it is the training data set size. Both of these factors are especially interesting for Uralistic usage, since the availability of free and open data is rather scarce. The dictionaries are summarised in Table 1 and the corpora in Table 2 For ", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 418, |
| "end": 453, |
| "text": "Table 1 and the corpora in Table 2", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Experimental setup", |
| "sec_num": "4" |
| }, |
| { |
| "text": "I present an evaluation of the systems using the standard metrics from the shared tasks. For morphological generation, the shared task was evaluated by measuring average precisions over all languages, for this experiment I compare the results for Finnish on 1-best predictions only, as I am interested in specific comparison relevant for a single Uralic language. The results are summarized in table 4.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Evaluation", |
| "sec_num": "5" |
| }, |
| { |
| "text": "For morphosyntactic analysis the standard evaluations would be based on attachment scores, however, the rule-based system only creates partial dependency graphs with potentially ambiguous roots; this does not work with the official evaluation scripts, so I provide instead a raw 1-best precision result for the specific fields in the CONLL-U format. The results are shown in table 5; The lemma row corresponds 3rd CONLL-U column, UPOS 4th, Ufeats 6th, XPOS 5th, Dephead 7th, and Deplabel 8th. The match is made on strict equality on the string comparison of the whole content, i.e. no re-arranging or approximate matching is performed.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Evaluation", |
| "sec_num": "5" |
| }, |
| { |
| "text": "For machine translation the standard shared task evaluation method is to use wellknown metrics that compare translations to reference, specifically BLEU. In table 6 I measure the BLEU scores for europarl translations.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Evaluation", |
| "sec_num": "5" |
| }, |
| { |
| "text": "As a general trend I see that the precision of the neural systems as well as the BLEU score of the neural machine translation are above of the rule-based systems. I also wanted to know if there is any systematicity to the errors, that the different approaches make. Interesting way forward would be to gain some insight on how the errors for each system could be fixed if at all. One of the commonly mentioned advan- tages of a rule-based system is that it is predictable and easy to fix or extend; whether a missing form in generation or analysis is caused by a missing word in lexicon, a missing word-form in paradigm or ordering of the alternative forms, the solution is easy to see. With a neural system the possibilities are limited to adding more data or modifying hyperparametres. When looking at the errors in the morphological regeneration test for rule-based system, I can see several categories emerge: True OOV for lexemes missing from the database (e.g. ovovivivipaarisuus), Wrong paradigm for wordforms that are generated but with some errors, such as wrong vowel harmony or consonant gradation (e.g. manuskripteilt\u00e4 pro manuskripteilta (from manuscripts)) and Real allomorph / homograph for cases where the correct form is recalled but not at best-1 due to ambiguous lexeme or free allomorphy (for example, I generate k\u00f6ykist\u00e4m\u00e4isill\u00e4ns\u00e4 pro k\u00f6ykist\u00e4m\u00e4isill\u00e4\u00e4n (about to defeat), but both are equally acceptable). In the leftover category I found among others, actual bugs in the generation functionality. For example, I was unable to generate the forms of aliluutnantti (sub-lieutenant) since the generation function failed to take into account extra semantic tags it contains. 9 I sampled a total of 65 errors and the results can be seen in the table 7.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Error Analysis", |
| "sec_num": "6" |
| }, |
| { |
| "text": "In the dependency parsing task one of the most common errors in the rule-based system seems to be the Person=0 feature with 766 occurrences in the test set, as it is systematically ambiguous with Person=3 for all singulars, it is probably a true ambiguity in that there are not many context clues to disambiguate it. Another systematic source of errors seems to be the systematic ambiguity between auxiliary and common verbs, which also shows up in the parsing of copula structures and in the morphological features. Similarly, a common problem of rule-based systems in parsing tasks is the etymological systematic ambiguity created by derivation and lexicalisation, that Table 7 : Rule-based morphology generation errors classified. . affects participle above anything, but also less productive features. It would appear that OOV's do not contribute here greatly to the error mass, despite consisting total of 460 appearances the baseline guess of singular nominative nominal for the OOV's is surprisingly often sufficient. Looking at both rule-based and neural systems for MT, it is easy to tell that for example the OOV's constitute a large part of errors, and exist in most sentences. Judging the actual translation quality by sampling the sentences also reveals a quality that is overall not sufficient for computer aided translation or gisting, to the extent that I believe further analysis may not be fruitful without further development of the underlying models first.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 672, |
| "end": 679, |
| "text": "Table 7", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Error Analysis", |
| "sec_num": "6" |
| }, |
| { |
| "text": "One of the goals in this experiment was to find out how usable the neural and traditional models are for a computational linguist who might want to pick a state-ofthe-art parser off-the-shelf and use it for text analysis or translation related tasks. Based on my initial impression, I would probably recommend making use of the neural parsers for languages where enough training data is available, and aiming to make training data where it is not. However, for a low resource language, it might often be easier to create a sufficiently large dictionary with rule-based model than to curate realistic corpus and annotate it, and given that the results of a rule-based system are not such far from the state-of-the-art in neural systems for the given metrics, they should be well sufficient for parsing. On top of that, the resources created with a rule-based system are a part of necessary NLP system for language survival (writer's tools, electronic dictionaries) that neural systems do not offer it does not make sense to put all eggs in one neural network.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Discussion", |
| "sec_num": "7" |
| }, |
| { |
| "text": "One thing that has been left out of the experiment is what is required for developing a new system: dictionaries and grammars for rule-based systems, treebanks or parallel texts for the neural systems. These are available at the moment for the main Uralic languages: Finnish, Hungarian and Estonian, and to smaller extent also for Northern S\u00e1mi, Erzya. The question then remains, is it easier for a minority Uralic language to develop a treebank and a parallel corpus, or dictionaries and grammar, or both.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Discussion", |
| "sec_num": "7" |
| }, |
| { |
| "text": "One noteworthy point to the method of developing resources, as well as to our evaluation, is, that the original Turku dependency treebank was in fact developed based on the analyses provided by an old version of omorfi Haverinen et al. (2014) , 10 and that was used as a basis for building the UD-Finnish-TDT treebank, that is used as a model for the TNPP analyser. So a traditional way to build resources for neural parsers still requires an existing high-quality rule-based parser as well as a lot of native human annotation work on the one hand, on the other hand, the combination of rulebased parses and human annotation does result in a parser that is more precise at predicting in basic setup.", |
| "cite_spans": [ |
| { |
| "start": 219, |
| "end": 242, |
| "text": "Haverinen et al. (2014)", |
| "ref_id": "BIBREF2" |
| }, |
| { |
| "start": 245, |
| "end": 247, |
| "text": "10", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Discussion", |
| "sec_num": "7" |
| }, |
| { |
| "text": "One thing that might be a common expectation is, is that a rule-based systems that have been developed for a long time, should score very highly in basic tasks like morphological generation and parsing, since apart from real OOV's and bugs, correctly made morphology should virtually be able to generate 100 % of the wordforms in its dictionary. For the precision of 1-best analyses however, there can be small portion of word-forms that either exhibit unexpected (in terms that writer of rulebased parser had expected form to be ungrammatical) or free variation. For recall, which is typically the first goal for rule-based analyser, the value is nearer to the virtual 100 % (Pirinen, 2015a).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Discussion", |
| "sec_num": "7" |
| }, |
| { |
| "text": "One surprising thing I found out, that when testing the machine translations on a non-English pair, the out-of-the-box results for both approaches are very modest, suggesting that more work is needed to for a usable MT as a tool for Uralist than just picking off-the-shelf product at the moment. While our test was still based on non-Uralic language partly due to resource and time constraints, I believe the results will still give a good indication of the current state-of-the-art. Notably, it is not unlikely for a research group in Uralistics to need machine translations of German or for example Russian as well.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Discussion", |
| "sec_num": "7" |
| }, |
| { |
| "text": "So far, I have only used the precision and BLEU measures to evaluate the systems, it is likely that different metrics would show more favourable results for a rule-based systems that typically maximise recall or coverage first.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Discussion", |
| "sec_num": "7" |
| }, |
| { |
| "text": "One of the surprising finds that I had when fitting the rule-based systems to nonrule-based shared tasks is, is that I could repurpose the task as a new automatic continuous integration test set for the lexical database, and the tests have already proved useful for recognition several types of easily fixable errors in the database. I note that, in the rule-based system fixing the OOV-type errors and the paradigm type errors is typically a trivial fix of one line of code taking less than a minute, however, improving the allomorph selection or homograph disambiguation is an open research question.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Discussion", |
| "sec_num": "7" |
| }, |
| { |
| "text": "For future work I will study both the neural and rule-based systems further with hopefully intra-Uralic pairing as well, to find if it's plausible for actual use.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Discussion", |
| "sec_num": "7" |
| }, |
| { |
| "text": "I performed some experiments to find out what is the current state-of-the-art status between neural and rule-based methods for Finnish, I have found out that the neural methods perform admirably for all parsing approaches for the given test sets that they were designed for, but rule-based methods are also still within acceptable distance. For non-parsing task such as machine translation in Uralic languages the methods are probably not yet sufficient to be efficiently used as a tool for research, but further research and development is needed.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conclusion", |
| "sec_num": "8" |
| }, |
| { |
| "text": "https://flammie.github.io/omorfi/ 2 https://apertium.github.io/apertium-fin-deu 3 https://github.com/flammie/omorfi/tree/develop/src/python 4 https://turkunlp.github.io/Turku-neural-parser-pipeline/ 5 https://github.com/OpenNMT 6 https://github.com/OpenNMT/OpenNMT-py#quickstart", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "https://statmt.org/europarl/ 8 https://github.com/flammie/autostuff-moses-smt/", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "a bug has been since fixed but I include the original error analysis in the article for an interesting reference", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "we thank the anonymous reviewer for bringing point up", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| } |
| ], |
| "back_matter": [ |
| { |
| "text": "The author was employed by CLARIN-D during the writing of the article.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Acknowledgments", |
| "sec_num": null |
| } |
| ], |
| "bib_entries": { |
| "BIBREF0": { |
| "ref_id": "b0", |
| "title": "Findings of the 2018 conference on machine translation (wmt18)", |
| "authors": [ |
| { |
| "first": "Ond\u0159ej", |
| "middle": [], |
| "last": "Bojar", |
| "suffix": "" |
| }, |
| { |
| "first": "Christian", |
| "middle": [], |
| "last": "Federmann", |
| "suffix": "" |
| }, |
| { |
| "first": "Mark", |
| "middle": [], |
| "last": "Fishel", |
| "suffix": "" |
| }, |
| { |
| "first": "Yvette", |
| "middle": [], |
| "last": "Graham", |
| "suffix": "" |
| }, |
| { |
| "first": "Barry", |
| "middle": [], |
| "last": "Haddow", |
| "suffix": "" |
| }, |
| { |
| "first": "Philipp", |
| "middle": [], |
| "last": "Koehn", |
| "suffix": "" |
| }, |
| { |
| "first": "Christof", |
| "middle": [], |
| "last": "Monz", |
| "suffix": "" |
| } |
| ], |
| "year": 2018, |
| "venue": "Proceedings of the Third Conference on Machine Translation: Shared Task Papers", |
| "volume": "", |
| "issue": "", |
| "pages": "272--303", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Ond\u0159ej Bojar, Christian Federmann, Mark Fishel, Yvette Graham, Barry Haddow, Philipp Koehn, and Christof Monz. 2018. Findings of the 2018 conference on ma- chine translation (wmt18). In Proceedings of the Third Conference on Machine Trans- lation: Shared Task Papers. Association for Computational Linguistics, pages 272- 303. http://aclweb.org/anthology/W18-6401.", |
| "links": null |
| }, |
| "BIBREF1": { |
| "ref_id": "b1", |
| "title": "The sigmorphon 2016 shared task-morphological reinflection", |
| "authors": [ |
| { |
| "first": "Ryan", |
| "middle": [], |
| "last": "Cotterell", |
| "suffix": "" |
| }, |
| { |
| "first": "Christo", |
| "middle": [], |
| "last": "Kirov", |
| "suffix": "" |
| }, |
| { |
| "first": "John", |
| "middle": [], |
| "last": "Sylak-Glassman", |
| "suffix": "" |
| }, |
| { |
| "first": "David", |
| "middle": [], |
| "last": "Yarowsky", |
| "suffix": "" |
| }, |
| { |
| "first": "Jason", |
| "middle": [], |
| "last": "Eisner", |
| "suffix": "" |
| }, |
| { |
| "first": "Mans", |
| "middle": [], |
| "last": "Hulden", |
| "suffix": "" |
| } |
| ], |
| "year": 2016, |
| "venue": "Proceedings of the 14th SIGMORPHON Workshop on Computational Research in Phonetics, Phonology, and Morphology. Association for Computational Linguistics", |
| "volume": "", |
| "issue": "", |
| "pages": "10--22", |
| "other_ids": { |
| "DOI": [ |
| "10.18653/v1/W16-2002" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Ryan Cotterell, Christo Kirov, John Sylak-Glassman, David Yarowsky, Jason Eisner, and Mans Hulden. 2016. The sigmorphon 2016 shared task-morphological reinflec- tion. In Proceedings of the 14th SIGMORPHON Workshop on Computational Research in Phonetics, Phonology, and Morphology. Association for Computational Linguis- tics, pages 10-22. https://doi.org/10.18653/v1/W16-2002.", |
| "links": null |
| }, |
| "BIBREF2": { |
| "ref_id": "b2", |
| "title": "Building the essential resources for finnish: the turku dependency treebank", |
| "authors": [ |
| { |
| "first": "Katri", |
| "middle": [], |
| "last": "Haverinen", |
| "suffix": "" |
| }, |
| { |
| "first": "Jenna", |
| "middle": [], |
| "last": "Nyblom", |
| "suffix": "" |
| }, |
| { |
| "first": "Timo", |
| "middle": [], |
| "last": "Viljanen", |
| "suffix": "" |
| }, |
| { |
| "first": "Veronika", |
| "middle": [], |
| "last": "Laippala", |
| "suffix": "" |
| }, |
| { |
| "first": "Samuel", |
| "middle": [], |
| "last": "Kohonen", |
| "suffix": "" |
| }, |
| { |
| "first": "Anna", |
| "middle": [], |
| "last": "Missil\u00e4", |
| "suffix": "" |
| }, |
| { |
| "first": "Stina", |
| "middle": [], |
| "last": "Ojala", |
| "suffix": "" |
| }, |
| { |
| "first": "Tapio", |
| "middle": [], |
| "last": "Salakoski", |
| "suffix": "" |
| }, |
| { |
| "first": "Filip", |
| "middle": [], |
| "last": "Ginter", |
| "suffix": "" |
| } |
| ], |
| "year": 2014, |
| "venue": "Language Resources and Evaluation", |
| "volume": "48", |
| "issue": "3", |
| "pages": "493--531", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Katri Haverinen, Jenna Nyblom, Timo Viljanen, Veronika Laippala, Samuel Kohonen, Anna Missil\u00e4, Stina Ojala, Tapio Salakoski, and Filip Ginter. 2014. Building the essential resources for finnish: the turku dependency treebank. Language Resources and Evaluation 48(3):493-531.", |
| "links": null |
| }, |
| "BIBREF3": { |
| "ref_id": "b3", |
| "title": "Turku neural parser pipeline: An end-to-end system for the conll 2018 shared task", |
| "authors": [ |
| { |
| "first": "Jenna", |
| "middle": [], |
| "last": "Kanerva", |
| "suffix": "" |
| }, |
| { |
| "first": "Filip", |
| "middle": [], |
| "last": "Ginter", |
| "suffix": "" |
| }, |
| { |
| "first": "Niko", |
| "middle": [], |
| "last": "Miekka", |
| "suffix": "" |
| }, |
| { |
| "first": "Akseli", |
| "middle": [], |
| "last": "Leino", |
| "suffix": "" |
| }, |
| { |
| "first": "Tapio", |
| "middle": [], |
| "last": "Salakoski", |
| "suffix": "" |
| } |
| ], |
| "year": 2018, |
| "venue": "Proceedings of the CoNLL 2018 Shared Task: Multilingual Parsing from Raw Text to Universal Dependencies", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Jenna Kanerva, Filip Ginter, Niko Miekka, Akseli Leino, and Tapio Salakoski. 2018. Turku neural parser pipeline: An end-to-end system for the conll 2018 shared task. In Proceedings of the CoNLL 2018 Shared Task: Multilingual Parsing from Raw Text to Universal Dependencies. Association for Computational Linguistics.", |
| "links": null |
| }, |
| "BIBREF4": { |
| "ref_id": "b4", |
| "title": "Constraint grammar as a framework for parsing unrestricted text", |
| "authors": [ |
| { |
| "first": "Fred", |
| "middle": [], |
| "last": "Karlsson", |
| "suffix": "" |
| } |
| ], |
| "year": 1990, |
| "venue": "Proceedings of the 13th International Conference of Computational Linguistics", |
| "volume": "3", |
| "issue": "", |
| "pages": "168--173", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Fred Karlsson. 1990. Constraint grammar as a framework for parsing unrestricted text. In H. Karlgren, editor, Proceedings of the 13th International Conference of Com- putational Linguistics. Helsinki, volume 3, pages 168-173.", |
| "links": null |
| }, |
| "BIBREF5": { |
| "ref_id": "b5", |
| "title": "OpenNMT: Open-source toolkit for neural machine translation", |
| "authors": [ |
| { |
| "first": "Guillaume", |
| "middle": [], |
| "last": "Klein", |
| "suffix": "" |
| }, |
| { |
| "first": "Yoon", |
| "middle": [], |
| "last": "Kim", |
| "suffix": "" |
| }, |
| { |
| "first": "Yuntian", |
| "middle": [], |
| "last": "Deng", |
| "suffix": "" |
| }, |
| { |
| "first": "Jean", |
| "middle": [], |
| "last": "Senellart", |
| "suffix": "" |
| }, |
| { |
| "first": "Alexander", |
| "middle": [ |
| "M" |
| ], |
| "last": "Rush", |
| "suffix": "" |
| } |
| ], |
| "year": 2017, |
| "venue": "Proc. ACL", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": { |
| "DOI": [ |
| "10.18653/v1/P17-4012" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Guillaume Klein, Yoon Kim, Yuntian Deng, Jean Senellart, and Alexander M. Rush. 2017. OpenNMT: Open-source toolkit for neural machine translation. In Proc. ACL. https://doi.org/10.18653/v1/P17-4012.", |
| "links": null |
| }, |
| "BIBREF6": { |
| "ref_id": "b6", |
| "title": "Europarl: A parallel corpus for statistical machine translation", |
| "authors": [ |
| { |
| "first": "Philipp", |
| "middle": [], |
| "last": "Koehn", |
| "suffix": "" |
| } |
| ], |
| "year": 2005, |
| "venue": "MT summit", |
| "volume": "5", |
| "issue": "", |
| "pages": "79--86", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Philipp Koehn. 2005. Europarl: A parallel corpus for statistical machine translation. In MT summit. volume 5, pages 79-86.", |
| "links": null |
| }, |
| "BIBREF7": { |
| "ref_id": "b7", |
| "title": "Weighting finite-state morphological analyzers using HFST tools", |
| "authors": [ |
| { |
| "first": "Krister", |
| "middle": [], |
| "last": "Lind\u00e9n", |
| "suffix": "" |
| }, |
| { |
| "first": "Tommi", |
| "middle": [], |
| "last": "Pirinen", |
| "suffix": "" |
| } |
| ], |
| "year": 2009, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Krister Lind\u00e9n and Tommi Pirinen. 2009. Weighting finite-state mor- phological analyzers using HFST tools. In Bruce Watson, Derrick Courie, Loek Cleophas, and Pierre Rautenbach, editors, FSMNLP 2009. http://www.ling.helsinki.fi/klinden/pubs/fsmnlp2009weighting.pdf.", |
| "links": null |
| }, |
| "BIBREF8": { |
| "ref_id": "b8", |
| "title": "Open-source infrastructures for collaborative work on under-resourced languages", |
| "authors": [ |
| { |
| "first": "Sjur", |
| "middle": [], |
| "last": "Moshagen", |
| "suffix": "" |
| }, |
| { |
| "first": "Jack", |
| "middle": [], |
| "last": "Rueter", |
| "suffix": "" |
| }, |
| { |
| "first": "Tommi", |
| "middle": [], |
| "last": "Pirinen", |
| "suffix": "" |
| }, |
| { |
| "first": "Trond", |
| "middle": [], |
| "last": "Trosterud", |
| "suffix": "" |
| }, |
| { |
| "first": "Francis", |
| "middle": [ |
| "M" |
| ], |
| "last": "Tyers", |
| "suffix": "" |
| } |
| ], |
| "year": 2014, |
| "venue": "Proceedings ofTh e Ninth International Conference on Language Resources and Evaluation, LREC", |
| "volume": "", |
| "issue": "", |
| "pages": "71--77", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Sjur Moshagen, Jack Rueter, Tommi Pirinen, Trond Trosterud, and Francis M Tyers. 2014. Open-source infrastructures for collaborative work on under-resourced lan- guages. In Proceedings ofTh e Ninth International Conference on Language Resources and Evaluation, LREC. pages 71-77.", |
| "links": null |
| }, |
| "BIBREF9": { |
| "ref_id": "b9", |
| "title": "Development and use of computational morphology of finnish in the open source and open science era: Notes on experiences with omorfi development", |
| "authors": [ |
| { |
| "first": "", |
| "middle": [], |
| "last": "Tommi A Pirinen", |
| "suffix": "" |
| } |
| ], |
| "year": 2015, |
| "venue": "SKY Journal of Linguistics", |
| "volume": "28", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Tommi A Pirinen. 2015a. Development and use of computational morphology of finnish in the open source and open science era: Notes on experiences with omorfi development. SKY Journal of Linguistics 28.", |
| "links": null |
| }, |
| "BIBREF10": { |
| "ref_id": "b10", |
| "title": "Using weighted finite state morphology with visl cg-3-some experiments with free open source finnish resources", |
| "authors": [ |
| { |
| "first": "", |
| "middle": [], |
| "last": "Tommi A Pirinen", |
| "suffix": "" |
| } |
| ], |
| "year": 2015, |
| "venue": "Proceedings of the Workshop on \"Constraint Grammar-methods, tools and applications", |
| "volume": "113", |
| "issue": "", |
| "pages": "29--33", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Tommi A Pirinen. 2015b. Using weighted finite state morphology with visl cg-3-some experiments with free open source finnish resources. In Proceedings of the Work- shop on \"Constraint Grammar-methods, tools and applications\" at NODALIDA 2015, May 11-13, 2015, Institute of the Lithuanian Language, Vilnius, Lithuania. Link\u00f6ping University Electronic Press, 113, pages 29-33.", |
| "links": null |
| }, |
| "BIBREF11": { |
| "ref_id": "b11", |
| "title": "Rule-based machine-translation between finnish and german", |
| "authors": [ |
| { |
| "first": "", |
| "middle": [], |
| "last": "Tommi A Pirinen", |
| "suffix": "" |
| } |
| ], |
| "year": 2018, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Tommi A Pirinen. 2018. Rule-based machine-translation between finnish and german.", |
| "links": null |
| }, |
| "BIBREF12": { |
| "ref_id": "b12", |
| "title": "Conll 2018 shared task: Multilingual parsing from raw text to universal dependencies", |
| "authors": [ |
| { |
| "first": "Daniel", |
| "middle": [], |
| "last": "Zeman", |
| "suffix": "" |
| }, |
| { |
| "first": "Jan", |
| "middle": [], |
| "last": "Haji{\u010d}", |
| "suffix": "" |
| }, |
| { |
| "first": "Martin", |
| "middle": [], |
| "last": "Popel", |
| "suffix": "" |
| }, |
| { |
| "first": "Martin", |
| "middle": [], |
| "last": "Potthast", |
| "suffix": "" |
| }, |
| { |
| "first": "Milan", |
| "middle": [], |
| "last": "Straka", |
| "suffix": "" |
| }, |
| { |
| "first": "Filip", |
| "middle": [], |
| "last": "Ginter", |
| "suffix": "" |
| }, |
| { |
| "first": "Joakim", |
| "middle": [], |
| "last": "Nivre", |
| "suffix": "" |
| }, |
| { |
| "first": "Slav", |
| "middle": [], |
| "last": "Petrov", |
| "suffix": "" |
| } |
| ], |
| "year": 2018, |
| "venue": "Proceedings of the CoNLL 2018 Shared Task: Multilingual Parsing from Raw Text to Universal Dependencies", |
| "volume": "", |
| "issue": "", |
| "pages": "1--21", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Daniel Zeman, Jan Haji{\u010d}, Martin Popel, Martin Potthast, Milan Straka, Filip Ginter, Joakim Nivre, and Slav Petrov. 2018. Conll 2018 shared task: Multilingual parsing from raw text to universal dependencies. In Proceedings of the CoNLL 2018 Shared Task: Multilingual Parsing from Raw Text to Universal Dependencies. Association for Computational Linguistics, pages 1-21. http://aclweb.org/anthology/K18-2001.", |
| "links": null |
| } |
| }, |
| "ref_entries": { |
| "TABREF1": { |
| "type_str": "table", |
| "content": "<table><tr><td>Phase, System</td><td>omorfi</td><td>TNPP</td><td colspan=\"2\">apertium OpenNMT</td></tr><tr><td>Compiling</td><td>15 minutes</td><td colspan=\"2\">-40 seconds</td><td>>5 days</td></tr><tr><td>(Downloading)</td><td>yes</td><td>yes</td><td>no</td><td>no</td></tr><tr><td>Parsing / translating</td><td colspan=\"2\">5 minutes 10 minutes</td><td colspan=\"2\">5 seconds 30 minutes</td></tr><tr><td>(Speed)</td><td>5 sents/s</td><td colspan=\"3\">3 sents/s 324 sents/s 0.9 sents/s</td></tr><tr><td>Model size</td><td>25 MiB</td><td>770 MiB</td><td>33 MiB</td><td>7420 MiB</td></tr></table>", |
| "text": "my OpenNMT setup I have created an autotools-based model builder / test runner, that is available in github for repeatability purposes 8 .", |
| "html": null, |
| "num": null |
| }, |
| "TABREF2": { |
| "type_str": "table", |
| "content": "<table><tr><td colspan=\"4\">Test set Baseline Winning system Omorfi</td></tr><tr><td>Task 1</td><td>64.45</td><td>97.30</td><td>93.92</td></tr><tr><td>Task 2</td><td>59.59</td><td>97.40</td><td>93.20</td></tr><tr><td>Task 3</td><td>56.95</td><td>96.56</td><td>92.18</td></tr></table>", |
| "text": "Usage times of rule-based and neural systems, time-units are indicated in the table. For TNPP I have found no documentation on how to repeat model building or what time it has taken. Sents/s stands for average sentences per second. Model sizes gives you the total size of binaries on disk in binary-prefixed bytes (by ls -h).", |
| "html": null, |
| "num": null |
| }, |
| "TABREF3": { |
| "type_str": "table", |
| "content": "<table/>", |
| "text": "", |
| "html": null, |
| "num": null |
| }, |
| "TABREF5": { |
| "type_str": "table", |
| "content": "<table><tr><td colspan=\"3\">: 1-best precisions of Turku neural parsing system and omorfi. The numbers</td></tr><tr><td colspan=\"3\">were measured with our script since the official test script does not handle partial</td></tr><tr><td>dependency graphs or multiple roots.</td><td/><td/></tr><tr><td>Language pair</td><td colspan=\"2\">OpenNMT Apertium</td></tr><tr><td>German to Finnish</td><td>7.09</td><td>0.6</td></tr><tr><td>Finnish to German</td><td>7.12</td><td>0.3</td></tr></table>", |
| "text": "", |
| "html": null, |
| "num": null |
| }, |
| "TABREF6": { |
| "type_str": "table", |
| "content": "<table/>", |
| "text": "Automatic translation evaluations, metrics from WMT shared tasks 2018 and corpora from europarl evaluation section. BLEU scores have been measured with the tool mteval-14.perl.", |
| "html": null, |
| "num": null |
| } |
| } |
| } |
| } |
