| { |
| "paper_id": "W17-0114", |
| "header": { |
| "generated_with": "S2ORC 1.0.0", |
| "date_generated": "2023-01-19T04:20:27.304641Z" |
| }, |
| "title": "Improving Coverage of an Inuktitut Morphological Analyzer Using a Segmental Recurrent Neural Network", |
| "authors": [ |
| { |
| "first": "Jeffrey", |
| "middle": [ |
| "C" |
| ], |
| "last": "Micher", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "Army Research Laboratory", |
| "institution": "US", |
| "location": { |
| "addrLine": "2800 Powder Mill Road Adelphi", |
| "postCode": "20783", |
| "region": "MD" |
| } |
| }, |
| "email": "jeffrey.c.micher.civ@mail.mil" |
| } |
| ], |
| "year": "", |
| "venue": null, |
| "identifiers": {}, |
| "abstract": "Languages such as Inuktitut are particularly challenging for natural language processing because of polysynthesis, abundance of grammatical features represented via morphology, morphophonemics, dialect variation, and noisy data. We make use of an existing morphological analyzer, the Uqailaut analyzer, and a dataset, the Nunavut Hansards, and experiment with improving the analyzer via bootstrapping of a segmental recurrent neural network onto it. We present results of the accuracy of this approach which works better for a coarse-grained analysis than a fine-grained analysis. We also report on accuracy of just the \"closed-class\" suffix parts of the Inuktitut words, which are better than the overall accuracy on the full words.", |
| "pdf_parse": { |
| "paper_id": "W17-0114", |
| "_pdf_hash": "", |
| "abstract": [ |
| { |
| "text": "Languages such as Inuktitut are particularly challenging for natural language processing because of polysynthesis, abundance of grammatical features represented via morphology, morphophonemics, dialect variation, and noisy data. We make use of an existing morphological analyzer, the Uqailaut analyzer, and a dataset, the Nunavut Hansards, and experiment with improving the analyzer via bootstrapping of a segmental recurrent neural network onto it. We present results of the accuracy of this approach which works better for a coarse-grained analysis than a fine-grained analysis. We also report on accuracy of just the \"closed-class\" suffix parts of the Inuktitut words, which are better than the overall accuracy on the full words.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Abstract", |
| "sec_num": null |
| } |
| ], |
| "body_text": [ |
| { |
| "text": "Inuktitut is a polysynthetic language, and is part of the Inuit language dialect continuum spoken in Arctic North America 1 . It is one of the official languages of the territory of Nunavut, Canada and is used widely in government and educational documents there. Despite its elevated status of official language, very little research on natural language processing of Inuktitut has been carried out. On the one hand, the complexity of Inuktitut makes it challenging for typical natural language processing applications. On the other hand, Inuktitut may only be spoken by around 23,000 people as a first language, 2 and as a result, receives minimal commercial attention. The National Research Council of Canada has produced a very important morphological analyzer for Inuktitut. We make use of this analyzer and propose a neural network approach to enhancing its output. This paper is organized as follows: first we talk about the nature of Inuktitut, focusing on polysynthesis, abundance of grammatical suffixes, morphophonemics, and spelling. Second, we describe the Uqailaut morphological analyzer for Inuktitut. Third, we describe the Nunavut Hansard dataset used in the current experiments. Forth, we describe an approach to enhancing the morphological analysis based on a segmental recurrent neural network architecture, with character sequences as input. Finally, we present ongoing experimental research results.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "The Eskimo-Aleut language family, to which Inuktitut belongs, is the canonical language family for exemplifying what is meant by polysynthesis. Peter Stephen DuPonceau coined the term in 1819 to describe the structural characteristics of languages in the Americas, and it further became part of Edward Sapir's classic linguistic typology distinctions. 3 Polysynthetic languages show a high degree of synthesis, more so than other synthetic languages, in that single words in a polysynthetic language can express what is usually expressed in full clauses in other languages. Not only are these languages highly inflected, but they show a high degree of incorporation as well. In Figure 1 we see an example of a sentence in Inuktitut, Qanniqlaunngikkalauqtuqlu aninngittunga., consisting of two words, and we break those words down into their component morphemes.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 678, |
| "end": 686, |
| "text": "Figure 1", |
| "ref_id": "FIGREF0" |
| } |
| ], |
| "eq_spans": [], |
| "section": "Polysynthesis", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "Qanniqlaunngikkalauqtuqlu qanniq-lak-uq-nngit-galauq-tuq-lu snow-a_little-frequently-NOT-although-3.IND.S-and \"And even though it's not snowing a great deal,\" aninngittunga ani-nngit-junga go_out-NOT-1.IND.S \"I'm not going out\" In this example, two Inuktitut words express what is expressed by two complete clauses in English. The first Inuktitut word shows how many morphemes representing a variety of grammatical and semantic functions (quantity, \"a_little\", frequency \"frequently\", negation, and concession) as well as grammatical inflection (3 rd person indicative singular), can be added onto a root (\"snow\"), in addition to a clitic (\"and\"), and the second word shows the same, but to a lesser degree.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Polysynthesis", |
| "sec_num": "2.1" |
| }, |
| { |
| "text": "Morphology in Inuktitut is used to express a variety of abundant grammatical features. Among those features expressed are: eight verbs \"moods\" (declarative, gerundive, interrogative, imperative, causative, conditional, frequentative, dubitative) ; two distinct sets of subject and subject-object markers, per mood; four persons; three numbers, (singular, dual, plural); eight \"cases\" on nouns: nominative (absolutive), accusative, genitive (ergative), dative (\"to\"), ablative (\"from\"), locative (\"at, on, in\"), similaris (\"as\"), and vialis (\"through\"), and noun possessors (with number and person variations). In addition, demonstratives show a greater variety of dimensions than most languages, including location, directionality, specificity, and previous mention. The result of a language that uses morphology (usually suffixes) to express such a great number of variation is an abundance of word types and very sparse data sets.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Abundance of grammatical suffixes", |
| "sec_num": "2.2" |
| }, |
| { |
| "text": "In addition to the abundance of morphological suffixes that Inuktitut roots can take on, the morphophonemics of Inuktitut are quite complex. Each morpheme in Inuktitut dictates the possible sound changes that can occur to its left, and/or to itself. As a result, morphological analysis cannot proceed as mere segmentation, but rather, each surface segmentation must map back to an underlying morpheme. In this paper, we refer to these different morpheme forms as 'surface' morphemes and 'deep' morphemes. The example below demonstrates some of the typical morphophonemic alternations that can occur in an Inuktitut word, using the word mivviliarumalauqturuuq, 'he said he wanted to go to the landing strip': We proceed from the end to the beginning to explain the morphophonemic rules. 'guuq' is a regressive assimilator, acting on the point of articulation, and it also deletes. So 'guuq' changes to 'ruuq' and deletes the preceding consonant 'q' of 'juq.' 'juq shows an alternation in its first consonant, which appears as 't' after a consonant, and 'j' otherwise. 'lauq' is neutral after a vowel, so there is no change. 'juma' is like 'guuq', a regressive assimilator on the point of articulation, and it deletes. So 'juma' becomes 'ruma,' and the 'q' of the preceding morpheme is deleted. 'liaq' is a deleter, so the preceding 'vik' becomes 'vi.' Finally, 'vik' regressively assimilates a preceding't' completely, so 'mit' becomes 'miv.' 4", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Morphophonemics", |
| "sec_num": "2.3" |
| }, |
| { |
| "text": "The fourth aspect of Inuktitut which contributes to the challenge of processing it with a computer is the abundance of spelling variation seen in the electronically available texts. Three aspects of spelling variation must be taken into account. First, Inuktitut, like all languages, can be divided into a number of different dialects. Dorais, (1990) lists ten: Uummarmiutun, Siglitun, Inuinnaqtun, Natsilik, Kivallirmiutun, Aivilik, North Baffin, South Baffin, Arctic Quebec, and Laborador. The primary distinction between the dialects is phonological, which is reflected in spelling. See Dorais (1990) for a discussion of dialect variation. Second, a notable error on the part of the designers of the Romanized transcription system has produced a confusion between 'r's and 'q's. It is best explained in a quote by Mick Third, an inspection of the word types that cannot be analyzed by the Uqailaut analyzer reveals that transcribers and translators do not adhere to a single standard of spelling. As an example, the root for 'hamlet', borrowed from English, appears in a variety of spelling variations in the Nunavut Hansard dataset. The Uqailaut root unique ID is \"Haammalat/1n\", mapped to the surface form \"Haammalat\". However, in the dataset, surface forms abound: Haamalaujunut, Haamlaujunut, Hamalakkunnit, Hammakkut, Hammalakkunnut, Hammalat, and Hmlatni. In sum, the combination of polysynthesis, abundance of grammatical morphemes, morphophonemics, and spelling variation, make Inuktitut a particularly challenging language for natural language processing. In this work, we hope to begin to develop methods to overcome these challenges.", |
| "cite_spans": [ |
| { |
| "start": 336, |
| "end": 350, |
| "text": "Dorais, (1990)", |
| "ref_id": "BIBREF1" |
| }, |
| { |
| "start": 590, |
| "end": 603, |
| "text": "Dorais (1990)", |
| "ref_id": "BIBREF1" |
| }, |
| { |
| "start": 1286, |
| "end": 1364, |
| "text": "Haamlaujunut, Hamalakkunnit, Hammakkut, Hammalakkunnut, Hammalat, and Hmlatni.", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Dialect differences / spelling variation", |
| "sec_num": "2.4" |
| }, |
| { |
| "text": "The work on morphological processing is abundant, so here we simply present a selected subset. Creutz and Lagus (2006) present an unsupervised approach to learning morphological segmentation, relying on a minimum description length principle (Morfessor). Kohonen et al, (2010) use a semi-supervised version of Morfessor on English and Finnish segmentation tasks to make use of unlabeled data. Narasimhan et al. (2015) use an unsupervised method to learn morphological \"chains\" (which extend base forms available in the lexicon) and report results on English, Arabic, and Turkish. Neural network approaches to morphological processing include a number of neural model types. Among then, Wang, et al. (2016) use Long Short Term Memory (LSTM) neural morphological analyzers to learn segmentations from unsupervised text, by exploiting windows of characters to capture context and report results on Hebrew and Arabic. Malouf (2016) uses LSTM neural networks to learn morphological paradigms for several morphologically complex languages (Finnish, Russian, Irish, Khaling, and Maltese). One recent work which may come close to the challenge of segmentation and labeling for Inuktitut is presented by Morita et al. (2014) who use a Recurrent Neural Network Language Model during morphological analysis of unsegmented, morphologically complex languages such as Japanese.", |
| "cite_spans": [ |
| { |
| "start": 95, |
| "end": 118, |
| "text": "Creutz and Lagus (2006)", |
| "ref_id": "BIBREF0" |
| }, |
| { |
| "start": 393, |
| "end": 417, |
| "text": "Narasimhan et al. (2015)", |
| "ref_id": "BIBREF7" |
| }, |
| { |
| "start": 686, |
| "end": 705, |
| "text": "Wang, et al. (2016)", |
| "ref_id": "BIBREF8" |
| }, |
| { |
| "start": 914, |
| "end": 927, |
| "text": "Malouf (2016)", |
| "ref_id": "BIBREF4" |
| }, |
| { |
| "start": 1195, |
| "end": 1215, |
| "text": "Morita et al. (2014)", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Related work", |
| "sec_num": "3" |
| }, |
| { |
| "text": "However, none of the studies to date have attempted to improve analysis for polysynthetic languages such as Inuktitut. Given the complexity of Inuktitut, we proceed initially by bootstrapping from an available analyzer.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Related work", |
| "sec_num": "3" |
| }, |
| { |
| "text": "A morphological analyzer exists for Inuktitut called the Uqailaut analyzer. It was created by Beno\u00eet Farley at the National Research Council of Canada and is freely available for use from the Uqailaut website 6 .", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "The Uqailaut morphological analyzer", |
| "sec_num": "4" |
| }, |
| { |
| "text": "The analyzer was used as downloaded, with no alterations to the source code whatsoever. It is a finite state transducer, which takes a word as input and returns a set of analyses on multiple lines. Each morpheme returned in an analysis is delineated by curly braces and contains the surface form of the morpheme, followed by a colon, followed by a unique ID for that morpheme. The unique ID contains the deep (dictionary) form of the morpheme, followed by a forward slash, followed by any specific morphological information. For example, processing the word 'saqqitaujuq' yields:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "The Uqailaut morphological analyzer", |
| "sec_num": "4" |
| }, |
| { |
| "text": "{saqqi:saqqik/1v}{ta:jaq/1vn}{u:u/1nv}{juq:juq/1vn} {saqqi:saqqik/1v}{ta:jaq/1vn}{u:u/1nv}{juq:juq/tv-ger-3s} See the README file provided with the Uqailaut analyzer for specifics about the codes used in the unique ID for a morpheme. 7", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "The Uqailaut morphological analyzer", |
| "sec_num": "4" |
| }, |
| { |
| "text": "A parallel Inuktitut-English dataset originated during the ACL 2003 Workshop entitled \"Building and Using Parallel Texts: Data-driven Machine Translation and Beyond 8 \" and was made available during this workshop. The data was subsequently used for a shared task on alignment that took place in the same workshop in 2005 9 . The dataset was assembled and aligned, and is described in Martin et al., (2003) . The dataset is available from the web 10 , and was downloaded from there.", |
| "cite_spans": [ |
| { |
| "start": 384, |
| "end": 405, |
| "text": "Martin et al., (2003)", |
| "ref_id": "BIBREF5" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Nunavut Hansard dataset", |
| "sec_num": "5" |
| }, |
| { |
| "text": "Since the morphological analyzer is not sensitive to context, all of the unique types from the Inuktitut side of the Nunavut Hansard were collected and prepared for analysis. Punctuation was tokenized beyond the initial tokenization provided in the dataset to facilitate processing. Types that contained an alphabetic string concatenated with a numeral (either an unwanted processing error or a numeral with grammatical inflexion) which would have failed in morphological analysis, were filtered out. A total of 287,858 types were successfully processed by the analyzer, leaving 125,695 types unprocessed, of which 124,189 were truly not processed by the analyzer (the remaining 1506 types yielded various processing errors). The number of types not processed was around 30% of the total types collected from the corpus. ", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Morphological processing of the Nunavut Hansard dataset", |
| "sec_num": "6" |
| }, |
| { |
| "text": "The goal of the current research is to provide an analysis for the 30% of word types that the analyzer fails on without completely rebuilding the underlying analyzer. The purpose of this approach is to determine whether morphological analysis for such a complex, polysynthetic language can be learned from annotated data when only limited annotated data or a less-thanoptimal, incomplete analyzer is available. We make use of the word types that were successfully analyzed into one single, unambiguous analysis as training data for a neural network morphological analyzer for the remaining unanalyzed word types. Following Kong et. al (2015) , we make use of a segmental recurrent neural network (SRNN) that can be used to map character input to analysis output. The input to the network is the individual characters of the word type to be analyzed. Output from the network is a sequence of labels annotated with the number of characters that each label covers. For example, the word type, \"qauqujaujunu\", is analyzed to \"ROOT:3 LEX:2 LEX:2 LEX:1 LEX:2 GRAM:2\" which then can be converted to qau/ROOT qu/LEX ja/LEX u/LEX ju/LEX nu/GRAM, to provide a surface segmentation and morphological analysis information in the form of a coarse-grained label. Thus the SRNN can be used to perform segment labeling in addition to simple segmentation.", |
| "cite_spans": [ |
| { |
| "start": 623, |
| "end": 641, |
| "text": "Kong et. al (2015)", |
| "ref_id": "BIBREF3" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Enhancing the output of the analyzer", |
| "sec_num": "7" |
| }, |
| { |
| "text": "We train two separate neural analyzers. The first outputs a coarse-grained label indicating the type of each analyzed morpheme, as in the example in the previous paragraph. The second outputs the unique ID of each morpheme (formatted slightly differently from what the Uqailaut analyzer produces due to processing constraints). The output from analyzing the word \"qauqujaujunu\" would be \"qau_1v:3 qu_2vv:2 jaq_1vn:2 u_1nv:1 juq_1vn:2 nut_tndat-p:2.\" The fine-grained labels consist of various bits of grammatical information, such as root type, lexical postbase type, or grammatical ending type with noun case or verb mood indicators. Over the dataset used in the experiments here, 1691 fine-grained labels were counted.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Enhancing the output of the analyzer", |
| "sec_num": "7" |
| }, |
| { |
| "text": "Training data for the neural network is provided by the Inuktitut side of the Nunavut Hansard corpus. All word types were analyzed by the Uqailaut morphological analyzer. Word types having a single analysis were used in the training set, since this subset of word types can be argued to be the most correctly analyzed set out of what is available. (Further experiments could make use of the types that have ambiguous, i.e. two or more analyses, as the training data, for example.) This subset consists of approximately 26K word types. For the \"Coarse-Grained\" model, 25,897 types were used. The Uqailaut analysis for each type was converted into a simple \"surfaceform/label,\" for each morpheme. A total of sixteen labels resulted from this conversion (listed in For the \"Fine-Grained\" model, the full unique ID was used, with 1691 labels present in the set of analyses. Because the SRNN program did not allow for unseen labels when running in test mode, selection of the dev and test sets was not random and proceeded as follows: First, under the assumption that the greatest variation of labels would occur in the roots of the word types,", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Enhancing the output of the analyzer", |
| "sec_num": "7" |
| }, |
| { |
| "text": "(the \"open-class\" morphemes, versus the \"closed-class\" lexical post-base, grammatical endings, and clitics), the selection proceeded based on root labels. Of the 1,198 unique root labels, 898 occurred in two or more word types. For example, the root label \"qauq_1v\" occurs in six types, \"qaurniq,\" \"qaunimautilik,\" \"qauqujaujut,\" \"qauqujaulluni,\" \"qauqujaujunu\" and \"qauvitaq.\" At least 1 of each of these types per root label was placed in the dev/test pool, with the remaining types containing that root label being assigned to the train set. To select which of the two or more types to put into each set, the longest (in terms of number of morphemes in the type) was selected for the dev/test pool, with the remaining going into the train set. Then, the dev/test pool was split into two sets of 449 items each.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Enhancing the output of the analyzer", |
| "sec_num": "7" |
| }, |
| { |
| "text": "The program implementing the SRNN reports precision, recall, and f-measure calculated over segmentations alone (seg), or segmentations with tagging (tag). Table 2 shows the results on the two held-out sets for the two different models. As would be expected, the model producing a coarse-grained output performs better than the model producing a fine-grained output. The model only has to decide between 16 labels in the former, versus 1691 labels in the latter. In addition, it should be kept in mind that the dev and test sets for the two models are not the same, due to the processing constraints of the program implementing the SRNN.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 155, |
| "end": 162, |
| "text": "Table 2", |
| "ref_id": "TABREF4" |
| } |
| ], |
| "eq_spans": [], |
| "section": "Results", |
| "sec_num": "8" |
| }, |
| { |
| "text": "Most of the mislabeling errors occurred in the root morphemes of the analyzed words. As was mentioned above, the set of root morphemes can be likened to the set of \"open-class\" vocabulary, whereas the remaining morphemes (suffixes) of words are \"closed-class.\" In order to attempt to filter out the randomness effect of trying to identify \"open-class\" root morphemes, scores were calculated over the output of the Fine-Grained model leaving out the roots. As expected, these scores (suffixes only) are higher than those measured on the full words (root+suffixes), yet still fall below 90% accuracy.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Accuracy on non-root morphemes", |
| "sec_num": "8.1" |
| }, |
| { |
| "text": "In this work in progress, we have proposed a method of improving the coverage of an existing morphological analyzer for the Inuktitut language using an SRNN bootstrapped from a portion of the analyses of words in a corpus. We show accuracy scores on two models, yielding coarse-, or fine-grained labels. Accuracy scores are also calculated on just the \"closed-class\" suffix strings (removing the \"open-class\" roots) which show a slight improvement over accuracy on the full words. Further experimentation is needed to refine the accuracy of this approach and to begin to develop methods of processing this highly complex, polysynthetic language.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conclusion", |
| "sec_num": "9" |
| }, |
| { |
| "text": "https://en.wikipedia.org/wiki/Inuit_languages", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "http://nunavuttourism.com/aboutnunavut/welcome-to-nunavut 3 https://en.wikipedia.org/wiki/Polysynthetic_languag e", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "http://www.inuktitutcomputing.ca/Technocrats/ILF T.php#morphology", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "http://www.inuktitutcomputing.ca/Technocrats/ILF T.php#morphology", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "http://www.inuktitutcomputing.ca/Uqailaut/.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| } |
| ], |
| "back_matter": [], |
| "bib_entries": { |
| "BIBREF0": { |
| "ref_id": "b0", |
| "title": "Unsupervised models for morpheme segmentation and morphology learning", |
| "authors": [ |
| { |
| "first": "M", |
| "middle": [], |
| "last": "Creutz", |
| "suffix": "" |
| }, |
| { |
| "first": "K", |
| "middle": [], |
| "last": "Lagus", |
| "suffix": "" |
| } |
| ], |
| "year": 2006, |
| "venue": "ACM Transactions on Speech and Language Processing", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Creutz, M. and Lagus, K., 2006. Unsupervised models for morpheme segmentation and morphology learn- ing. ACM Transactions on Speech and Language Processing.", |
| "links": null |
| }, |
| "BIBREF1": { |
| "ref_id": "b1", |
| "title": "The Canadian Inuit and their Language", |
| "authors": [ |
| { |
| "first": "L", |
| "middle": [], |
| "last": "Dorais", |
| "suffix": "" |
| } |
| ], |
| "year": 1990, |
| "venue": "Arctic Languages, An Awakening", |
| "volume": "", |
| "issue": "", |
| "pages": "185--289", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Dorais, L., 1990. \"The Canadian Inuit and their Lan- guage,\" in Arctic Languages, An Awakening, Ed. Dirmid R. F. Collins, Unesco, pp. 185-289.", |
| "links": null |
| }, |
| "BIBREF2": { |
| "ref_id": "b2", |
| "title": "Semisupervised learning of concatenative morphology", |
| "authors": [ |
| { |
| "first": "O", |
| "middle": [], |
| "last": "Kohonen", |
| "suffix": "" |
| }, |
| { |
| "first": "S", |
| "middle": [], |
| "last": "Virpioja", |
| "suffix": "" |
| }, |
| { |
| "first": "K", |
| "middle": [], |
| "last": "Lagus", |
| "suffix": "" |
| } |
| ], |
| "year": 2010, |
| "venue": "Proceedings of the 11 th Meeting of the ACL Special Interest Group on Computational Morphology and Phonology", |
| "volume": "", |
| "issue": "", |
| "pages": "78--86", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Kohonen, O., Virpioja, S., and Lagus, K., 2010. Semi- supervised learning of concatenative morphology. In Proceedings of the 11 th Meeting of the ACL Spe- cial Interest Group on Computational Morphology and Phonology, pp. 78-86. Association for Compu- tational Linguistics.", |
| "links": null |
| }, |
| "BIBREF3": { |
| "ref_id": "b3", |
| "title": "Segmental recurrent neural networks", |
| "authors": [ |
| { |
| "first": "L", |
| "middle": [], |
| "last": "Kong", |
| "suffix": "" |
| }, |
| { |
| "first": "C", |
| "middle": [], |
| "last": "Dyer", |
| "suffix": "" |
| }, |
| { |
| "first": "N", |
| "middle": [], |
| "last": "Smith", |
| "suffix": "" |
| } |
| ], |
| "year": 2015, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": { |
| "arXiv": [ |
| "arXiv:1511.06018" |
| ] |
| }, |
| "num": null, |
| "urls": [], |
| "raw_text": "Kong, L., Dyer, C., and Smith, N., 2015. Segmental recurrent neural networks, arXiv preprint arXiv:1511.06018.", |
| "links": null |
| }, |
| "BIBREF4": { |
| "ref_id": "b4", |
| "title": "Generating morphological paradigms with a recurrent neural network", |
| "authors": [ |
| { |
| "first": "R", |
| "middle": [], |
| "last": "Malouf", |
| "suffix": "" |
| } |
| ], |
| "year": 2016, |
| "venue": "San Diego Linguistic Papers", |
| "volume": "6", |
| "issue": "", |
| "pages": "122--129", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Malouf, R., 2016. Generating morphological para- digms with a recurrent neural network, San Diego Linguistic Papers 6, 122-129.", |
| "links": null |
| }, |
| "BIBREF5": { |
| "ref_id": "b5", |
| "title": "Aligning and Using an English-Inuktitut Parallel Corpus", |
| "authors": [ |
| { |
| "first": "J", |
| "middle": [], |
| "last": "Martin", |
| "suffix": "" |
| }, |
| { |
| "first": "H", |
| "middle": [], |
| "last": "Johnson", |
| "suffix": "" |
| }, |
| { |
| "first": "B", |
| "middle": [], |
| "last": "Farley", |
| "suffix": "" |
| }, |
| { |
| "first": "A", |
| "middle": [], |
| "last": "Maclachlan", |
| "suffix": "" |
| } |
| ], |
| "year": 2003, |
| "venue": "HLT-NAACL Workshop: Building and Using Parallel Texts Data Driven Machine Translation and Beyond", |
| "volume": "", |
| "issue": "", |
| "pages": "115--118", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Martin, J., Johnson, H., Farley, B., and Maclachlan, A., 2003, Aligning and Using an English-Inuktitut Parallel Corpus, HLT-NAACL Workshop: Build- ing and Using Parallel Texts Data Driven Machine Translation and Beyond, pp. 115-118, Edmonton, May-June 2003.", |
| "links": null |
| }, |
| "BIBREF6": { |
| "ref_id": "b6", |
| "title": "Morphological Analysis for Unsegmented Languages using Recurrent Neural Network Language Model", |
| "authors": [ |
| { |
| "first": "H", |
| "middle": [], |
| "last": "Morita", |
| "suffix": "" |
| }, |
| { |
| "first": "D", |
| "middle": [], |
| "last": "Kawahara", |
| "suffix": "" |
| }, |
| { |
| "first": "S", |
| "middle": [], |
| "last": "Kurohashi", |
| "suffix": "" |
| } |
| ], |
| "year": 2015, |
| "venue": "Proceedings of the Conference on Empirical Methods in Natural Language Processing", |
| "volume": "", |
| "issue": "", |
| "pages": "2292--2297", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Morita, H., Kawahara, D., and Kurohashi, S., 2015. Morphological Analysis for Unsegmented Lan- guages using Recurrent Neural Network Language Model, Association for Computational Linguistics, Proceedings of the Conference on Empirical Meth- ods in Natural Language Processing, pp. 2292- 2297, Lisbon, Portugal.", |
| "links": null |
| }, |
| "BIBREF7": { |
| "ref_id": "b7", |
| "title": "An Unsupervised Method for Uncovering Morphological Chains", |
| "authors": [ |
| { |
| "first": "K", |
| "middle": [], |
| "last": "Narasimhan", |
| "suffix": "" |
| }, |
| { |
| "first": "R", |
| "middle": [], |
| "last": "Barzilay", |
| "suffix": "" |
| }, |
| { |
| "first": "T", |
| "middle": [], |
| "last": "Jaakkola", |
| "suffix": "" |
| } |
| ], |
| "year": 2015, |
| "venue": "Transactions of the Association for Computational Linguistics", |
| "volume": "", |
| "issue": "", |
| "pages": "157--167", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Narasimhan, K., Barzilay, R., and Jaakkola, T., 2015. An Unsupervised Method for Uncovering Morpho- logical Chains. Transactions of the Association for Computational Linguistics, [S.l.], v. 3, pp. 157- 167.", |
| "links": null |
| }, |
| "BIBREF8": { |
| "ref_id": "b8", |
| "title": "Morphological segmentation with window LSTM neural networks", |
| "authors": [ |
| { |
| "first": "L", |
| "middle": [], |
| "last": "Wang", |
| "suffix": "" |
| }, |
| { |
| "first": "Z", |
| "middle": [], |
| "last": "Cao", |
| "suffix": "" |
| }, |
| { |
| "first": "Y", |
| "middle": [], |
| "last": "Xia", |
| "suffix": "" |
| }, |
| { |
| "first": "G", |
| "middle": [], |
| "last": "De Melo", |
| "suffix": "" |
| } |
| ], |
| "year": 2016, |
| "venue": "Proceedings of AAAI", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Wang, L., Cao, Z., Xia, Y., and de Melo, G., 2016. Morphological segmentation with window LSTM neural networks. In Proceedings of AAAI.", |
| "links": null |
| } |
| }, |
| "ref_entries": { |
| "FIGREF0": { |
| "uris": null, |
| "type_str": "figure", |
| "num": null, |
| "text": "Inuktitut Words Analyzed" |
| }, |
| "FIGREF1": { |
| "uris": null, |
| "type_str": "figure", |
| "num": null, |
| "text": "Inuktitut word: mivviliarumalauqturuuq Surface segmentation miv-vi-lia-ruma-lauq-tu-ruuq Deep form segmentation mit-vik-liaq-juma-lauq-juq-guuq Gloss land-place-go_to-want-PAST-3.IND.S-he_says Figure 2: Morphophonemic Example" |
| }, |
| "FIGREF2": { |
| "uris": null, |
| "type_str": "figure", |
| "num": null, |
| "text": "Sample Analyzer Output" |
| }, |
| "FIGREF3": { |
| "uris": null, |
| "type_str": "figure", |
| "num": null, |
| "text": "http://www.inuktitutcomputing.ca/Uqailaut/ 8 http://web.eecs.umich.edu/~mihalcea/wpt/ 9 http://www.statmt.org/wpt05/ 10 http://www.inuktitutcomputing.ca/NunavutHansar d/ info.php" |
| }, |
| "TABREF0": { |
| "num": null, |
| "content": "<table><tr><td>Mallon: 5</td></tr><tr><td>It's a long story, but I'll shorten it. Back in</td></tr><tr><td>1976, at the ICI standardization conference,</td></tr><tr><td>because of my belief that it was a good idea to</td></tr><tr><td>mirror the Assimilation of Manner in the or-</td></tr><tr><td>thography, it was decided to use q for the first</td></tr><tr><td>consonant in voiceless clusters, and r for the</td></tr><tr><td>first consonant in voiced and nasal clusters.</td></tr><tr><td>That was a mistake. That particular distinction</td></tr><tr><td>does not come natural to Inuit writers, (possi-</td></tr><tr><td>bly because of the non-phonemic status of [\u0274].)</td></tr><tr><td>Public signs, newspaper articles, government</td></tr><tr><td>publications, children's literature produced by</td></tr><tr><td>the Department of</td></tr></table>", |
| "text": "Education, all are littered with qs where there should be rs, and rs where there should be qs. Kativik did the right thing in switching to the use of rs medially, with qs left for word initial and word final. When things settle down, maybe Nunavut will make that change. It won't affect the keyboard or the fonts, but it will reduce spelling errors among the otherwise literate by about 30%.", |
| "html": null, |
| "type_str": "table" |
| }, |
| "TABREF1": { |
| "num": null, |
| "content": "<table><tr><td colspan=\"2\">). A development (dev) set and a test</td></tr><tr><td colspan=\"2\">set of 1000 items each were randomly held out</td></tr><tr><td>from training.</td><td/></tr><tr><td>ROOT</td><td>root (noun or verb)</td></tr><tr><td>LEX</td><td>lexical postbase</td></tr><tr><td>GRAM</td><td>grammatical suffix</td></tr><tr><td>CL</td><td>clitic</td></tr><tr><td>ADV</td><td>adverb</td></tr><tr><td>CONJ</td><td>conjunction</td></tr><tr><td>EXCLAM</td><td>exclamation</td></tr><tr><td colspan=\"2\">PR, RP, PRP pronoun</td></tr><tr><td>AD</td><td>demonstrative adverb</td></tr><tr><td>PD</td><td>demonstrative pronoun</td></tr><tr><td>RAD</td><td>demonstrative adverb root</td></tr><tr><td>RPD</td><td>demonstrative pronoun root</td></tr><tr><td>TAD</td><td>demonstrative adverb suffix</td></tr><tr><td>TPD</td><td>demonstrative pronoun suffix</td></tr></table>", |
| "text": "", |
| "html": null, |
| "type_str": "table" |
| }, |
| "TABREF2": { |
| "num": null, |
| "content": "<table/>", |
| "text": "", |
| "html": null, |
| "type_str": "table" |
| }, |
| "TABREF4": { |
| "num": null, |
| "content": "<table/>", |
| "text": "Accuracy scores on full words", |
| "html": null, |
| "type_str": "table" |
| }, |
| "TABREF5": { |
| "num": null, |
| "content": "<table><tr><td>Model</td><td>Set</td><td>seg/tag</td><td>Precision</td><td>Recall</td><td>F-</td></tr><tr><td/><td/><td/><td/><td/><td>measure</td></tr><tr><td>Fine-</td><td>dev</td><td>seg</td><td>0.8838</td><td>0. 8860</td><td>0.8849</td></tr><tr><td>Grained</td><td/><td/><td/><td/><td/></tr><tr><td>roots</td><td/><td>tag</td><td>0.8178</td><td>0.8199</td><td>0.8188</td></tr><tr><td>absent</td><td/><td/><td/><td/><td/></tr><tr><td>in scoring</td><td>test</td><td>seg</td><td>0.8560</td><td>0.8807</td><td>0.8682</td></tr><tr><td/><td/><td>tag</td><td>0.7922</td><td>0.8151</td><td>0.8035</td></tr></table>", |
| "text": "displays these results.", |
| "html": null, |
| "type_str": "table" |
| }, |
| "TABREF6": { |
| "num": null, |
| "content": "<table/>", |
| "text": "Accuracy scores on suffixes only", |
| "html": null, |
| "type_str": "table" |
| } |
| } |
| } |
| } |
