What transfers in morphological inflection? Experiments with analogical models (2021)

Abstract: We investigate how abstract processes like suffixation can be learned from morphological inflection task data using an analogical memory-based framework. In this framework, the inflection target form is specified by providing an example inflection of another word in the language. We show that this model is capable of near-baseline performance on the SigMorphon 2020 inflection challenge. Such a model can make predictions for unseen languages, allowing us to perform one-shot inflection on natural languages and investigate morphological transfer with synthetic probes. Accuracy for one-shot transfer can be unexpectedly high for some target languages (88% in Shona) and language families (53% across Romance). Probe experiments show that the model learns partially generalizable representations of prefixation, suffixation and reduplication, aiding its ability to transfer. We argue that the degree of generality of these process representations also helps to explain transfer results from previous research.

## introduction morphological transfer learning has proven to be a powerful and effective technique for improving the performance of inflection models on underresourced languages. the beneficial effects of transfer between source and target languages are known to be higher when the two are closely related @xcite or typologically similar @xcite , mediated by the effect of script @xcite . but these effects are not always consistent; a variety of researchers report failure of transfer between closely related languages, or surprising successes with rather dissimilar ones (sec 2). pushing forward our understanding of these cases requires a more nuanced understanding of what is transferred by morphological transfer learning-that is, what abstract representational concepts do inflection networks acquire and how are these shared across languages? this is a difficult question to address in the standard framework for inflection @xcite , in which morphosyntactic properties are closely tied to their specific exponents in a particular language as well as to the more abstract processes by which these exponents are applied. in such a network, it is difficult to test whether a generic suffixation operation has been learned, without reference to a particular form/feature mapping, for instance between the maori passive feature pass and the spelling of a particular passive suffix -tia. suffixing as a generic operation is much more likely to be useful in another language than the individual suffix. this work decouples these representational pieces by performing inflection in an analogical, memory-based framework. 1 in this framework, inflection instances do not have tags; rather, they include an instance of the desired mapping with respect to a different lemma (figure 1 ). for example, to produce a passive maori verb, the system takes an example verb with its passive and completes the four-part analogy: lemma : target :: exemplar lemma : exemplar target. the advantage of this redefinition of the task is that, in principle, the system does not need to learn anything about the individual affixes of a particular language, since these can be copied from the exemplar. thus, it is possible to investigate how well such a system has learned a particular morphological process such as suffixation, which is expected to be present in a variety of languages. 2 section 5 shows that this analogical framework for inflection can predict inflections across a variety of languages, demonstrating reasonable performance on the sigmorphon 2020 multilingual benchmark @xcite . section 6 describes one-shot learning experiments, performing language transfer without fine-tuning, and shows that for languages with concatenative affixes, oneshot transfer can be more effective than previously thought. section 7 studies the system's ability to apply different types of morphological processes using constructed stimuli, showing that some configurations are capable of learning generic and transferable representations of processes including prefixing, suffixing and reduplication. ## related work the overall positive effect of transfer learning is well established @xcite . previous research has also evaluated how the choice of source language affects the performance in the target. while there is a robust trend for related languages to perform better, there are also many reports of exceptions. @xcite finds that hungarian is a better source for english than german and a better source for spanish than italian. she concludes that matching the target language's default affix placement (prefixing/suffixing) is important, and that agglutinative languages might be beneficial to transfer learning in general, but that genetic relatedness is not always a necessary or sufficient for effective transfer. @xcite also find that hungarian and turkish are good source languages for a surprising variety of unrelated targets. rather than attribute this to agglutination, they propose that these languages lead to good transfer because of their large datasets and difficulty as tasks. further puzzling results come from @xcite , who find that italian data does not improve performance in closely related ladin or neapolitan foot_2 once monolingual hallucinated data is available, and that latvian is as good a source for scots gaelic as its relative irish. previous analyses of transfer learning have attempted to differentiate the contributions of various parts of the model through factored vocabularies or ciphering @xcite . these methods give disjoint representations to characters and tags in the source and target languages, or disrupt the mapping between them. low-level correspondence between character sets is the most important factor for successful transfer in very lowresource settings, but models with disjoint character representations still succeed at transfer once at least 200 target examples are available, indicating that higher-level information is also transferred and contributes to performance. kann et al. (2017b) also represents a prior oneshot morphological learning experiment. their setting is not quite the same as the one here; they assume access to a single inflected form in half the paradigm cells in their target language (spanish) which are used to fine-tune a pretrained system. because their system uses the conventional tagbased framework, they are capable of filling cells for which no example is available (zero-shot learning), while the memory-based system presented here is not. on the other hand, the current work does not use fine-tuning or require target-language data at training time. they evaluate inflection on both seen and unseen cells as a function of five source languages, four of which are in the romance family. the best one-shot transfer within romance scores 44% exact match, the worst 13%. transfer from unrelated arabic scores 0%. one-shot learning experiments in this work use a much larger set of languages, and although performance in the typical case is similar, the best results are substantially better. the memory-based design of the current work is rooted in cognitive theories of morphological processing. the widely accepted dual route model of morphological processing postulates that the mind retrieves familiar inflected forms from memory as well as synthesizing forms from scratch @xcite @xcite . it has often been claimed that memorized forms of specific words are central to the structure of inflection classes @xcite @xcite . in such a theory, production of a form of a rare lemma is guided by the memory of the appropriate forms of common ones. additional evidence for this view comes from historical changes in which one word's paradigm is analogically remodeled on another's @xcite . @xcite evaluate a model very similar to this one (a transformer in which target forms of other words, which they term "cross-table" examples, are provided as part of the input). they lemma target @xmath0;pass waiatatia memory-based waiata karanga : karangatia waiatatia waiata kaukau : kaukauria waiatatia figure 1 : differing inputs for inflection models, eliciting the passive of the maori verb waiata "sing". the memorybased system relies on an exemplar verb as the target specifier; shown here are karanga "call", which takes a matching suffix, and kaukau "swim", which mismatches. ## exemplar selection the system uses instances generated as described in figure 1 , separating the lemma, exemplar lemma and exemplar form with punctuation characters. each instance also contains two features indicating the language and language family of the example (e.g. lang mao, fam austronesian). the selection of the exemplar is critical to the model's performance. ideally, the lemma and the exemplar inflect in the same way, reducing the inflection task to copying. but this is not always the case. for example, maori verbs fall into inflection classes, as shown in figure 1 ; when the exemplar comes from a different class than the lemma, copying will yield an invalid output, so the model has to guess which class the input belongs to. 4 this paper presents experiments using two settings: in random selection, the exemplar lemma is chosen arbitrarily from the set of training lemma/form pairs for the appropriate language and cell. this makes the task difficult, but allows the model to learn to cope with the distribution of inputs it will face at test time. in similarity-based selection, each source lemma is paired with an exemplar for which the transductions are highly similar. this makes the task easy, but since it relies on access to the true target form, it can be used only for model training, not for testing. 5 all models are evaluated using instances generated using random selection. to perform similarity-based selection, each lemma is aligned with its target form in the training data in order to extract an edit rule @xcite . (for the first memory-based example in figure 1 , both words have the same edit rule -+tia.) the selected exemplar/form pair uses the same edit rule, if possible. during training, a lemma is allowed to act as its own exemplar, so that there is always at least one candidate. however, words in the test set must be given exemplars from the training set. if a cell in the test set does not appear in the training set, no prediction can be made; in this case, the system outputs the lemma. extending the model to cover this case is discussed below as future work. 6 ## model design the system uses the character-based transformer @xcite ) as its learning model; this is a sequence-to-sequence transformer @xcite tuned for morphological tasks, and serves as a strong official baseline for the sigmorphon 2020 task. moreover, transformers are known to perform well in the few-shot setting @xcite . all default hyperparameters 7 match those of @xcite . as discussed in prior work @xcite , it is important to pretrain the model to predispose it to copy strings. to ensure this, the system is trained on a synthetic dataset. each synthetic instance is generated within a random character set. the instance consists of a random pseudo-lemma and pseudo-exemplar created by sampling word using random selection. to avoid this issue, no training scores are reported in this paper. 6 in the sigmorphon 2020 datasets, this rarely occurs in practice. ≥ 99% of target cells are covered in all languages except ingrian (98%), evenki (96%), and notably ludic (61%). 7 including 4 layers, batches of 64, and the learning rate schedule. the sigmorphon 2020 data is divided into "development languages" (45 languages in 5 families: austronesian, germanic, niger-congo, oto-manguean and uralic) and "surprise languages" (45 more languages, including some members of development families as well as unseen families). data from all the "development languages", plus the synthetic examples from the previous stage, is used to train a multilingual model, which is finetuned family. finally the family models are finetuned by language. during multilingual training and per-family tuning, the dataset is balanced to contain 20,000 instances per language; languages with more training instances than this are subsampled, while languages with fewer are upsampled by sampling multiple exemplars (with replacement) for each lemma/target pair. for the final languagespecific fine-tuning stage, all instances from the specific language are used. ## fine-tuned results this section shows the test results for fully finetuned models on the development languages. neither model achieves the same performance as the baseline (90%), although the random-exemplar model (89%) comes quite close. the similarexemplar model (57%) is clearly inferior due to its severe mismatch between training and test settings. performance varies across language families. all models perform well in niger-congo, although the conference organizers state that data from these languages may have been biased toward regular forms in an unrepresentative way. 8 the randomexemplar model is at or near baseline performance in austronesian and uralic, but falls further below baseline in germanic and oto-manguean. both of these families are characterized by complex inflection class structure in which randomly chosen exemplars are less likely to resemble the target for a given word. the similar-exemplar model also performs poorly in uralic. while some uralic languages have inflection classes @xcite , many (like finnish) do not, but have complex systems of phonological alternations @xcite . while the random-exemplar model can learn to compensate for these, the similarexemplar model does not. ## one-shot results this section shows the results of one-shot learning. these experiments apply the multilingual and family models from the development languages to the surprise languages, without fine-tuning. for languages within development families, they use the appropriate family model; otherwise they use the multilingual model. thus, the model's only access to information about the target language is via the provided exemplar. each experiment evaluates the results across five random exemplars per test instance (with replacement), but averages the results rather than applying majority selection. this computes the expected performance in the one-shot setting where only a single exemplar is available. results are shown in the system trained with random exemplars achieves its best results on tajik (iranian: tgk, score 89%), shona (niger-congo: sna, score 75%) 9 , and norwegian nynorsk (germanic: nno, score 42%). the system trained with similar exemplars achieves its best results on shona (88%), zarma (songhay: dje, score 82%) and tajik (79%). notably, some of these high scores are achieved on languages that were difficult for the baseline systems; the score for tajik beats the transformer baseline (56%), perhaps due to data sparsity, since baselines regularized using data hallucination perform better (93%). training with similar exemplars leads to clearly better results than random exemplars, a reversal of the trend observed with fine-tuning. this difference is particularly marked in romance (53% average vs 5%). while the random-exemplar system is better at guessing what to do when the exemplar and target forms are divergent, this causes errors with unfamiliar languages. the system attempts to guess the correct inflection, rather than simply copying. as an example, ## synthetic transfer experiments a probing dataset is synthesized to model several morphological operations (figure 2 ), including prefix/suffix affixation, reduplication and gemination. affixation is typologically widespread @xcite and appears in every development language on which the model was trained. suffixation is more common in germanic and uralic; oto-manguean tonal morphology is also often represented via word-final diacritics. 10 prefixing is more common in the niger-congo family. reduplication appears in three of the four austronesian development languages, tagalog, hiligaynon and cebuano @xcite , but not in the maori dataset provided. the probe language has partial reduplication of the first syllable, as found in tagalog and hiligaynon. previous work with artificial data demonstrates that sequence-to-sequence learners can learn fully abstract representations of reduplication @xcite @xcite , but it has not been previously shown that networks trained on real data do this in a transferable way. in one-shot language transfer, reduplication instances are actually ambiguous. given an instance modi : :: gobu : gogobu, there are two plausible interpretations, reduplicative momodi and affixal gomodi. thus, analysis of reduplicative instances can be informative about the model's learned linkage between language family and typology. gemination is a inflectional process whereby a segment is lengthened to mark some morphological feature @xcite . the probe language geminates the last non-final consonant. none of the development languages have morphological gemination. the probe languages use two alphabets: the first is a common subset of characters which appear in 10 no unicode normalization was performed; oto-manguean tone diacritics are treated as characters (as are parts of the complex characters of the indic scripts). the placement of these diacritics within the word varies from language to language. at least half the languages of every development family. 11 the second is a subset of cyrillic characters intended to test transfer to a less-familiar orthography; a few uralic development languages are written in cyrillic. each language has 90 random lemmas, sampled with the frames cvcv, cvcvc, cvcvcvc; affixal languages have 30 affixes of types vcv, cv, cvcv, plus 7 single-letter affixes. no probe lemma coincides with any real lemma, and no probe affix has @xmath1. affixal languages contain an instance for every lemma/affix pair. reduplication and gemination languages have one instance per lemma. the model is prompted to inflect the probes as if they are members of each language family, and as members of a comparatively well-resourced language selected from those families, specifically tagalog (tgl), german (deu), mezquital otomi (ote), swahili (swa) and finnish (fin), as well as the synthetic suffixing language used in pretraining (suff). in addition to checking whether the output matches, the table shows whether reduplicated instances have been correctly reduplicated (using a regular expression). both models learn to reduplicate arbitrary cv syllables, but this process is mostly restricted to lemma semet probe type exemplar target prefixing kigu : igokigu igosemet suffixing kigu : kiguigo semetigo reduplication modi : momodi sesemet gemination bogu : boggu semmet tagalog, 12 , with some generalization to austronesian. most other languages interpret reduplication instances as affixes. only the similar-exemplar model gets any gemination instances correct, and these primarily in uralic. 13 this is unsurprising, since the model was never trained with morphological gemination. it demonstrates that the model's representations of morphological processes represent the input typology and are not simply artifacts of the transformer architecture. while uralic does not have gemination as an independent morphological process, alternations involving geminates do occur in some paradigms; the nom.pl of tikka "dart" is tikat. 14 the model seems to have learned a little about gemination from this morphophonological process, but not a fully generalized representation. affixation remains relatively successful when using cyrillic characters (suffixes more than prefixes), but for the most part, less so than with latin characters, although in the random-exemplar model, cyrillic suffixes are somewhat more accurate, probably due to less interference from language-specific knowledge. this substantiates the general finding @xcite ) that transfer across scripts is more difficult than within-script. cyrillic reduplication sees a much larger drop in accuracy. the difference is probably that simple affixation is phonologically uncomplicated, while reduplication requires phonological information about vowels and consonants. ## discussion these experiments with real and synthetic transfer suggest some useful insights into the problematic findings of earlier transfer experiments. why is hungarian so successful as a source language for unrelated targets? kann (2020) suggests that it is its agglutinative nature. the results shown here offer some speculative support for this viewperhaps the relative segmentability of prototypically agglutinative languages @xcite acts like the similar-exemplar setting in the memorybased model, giving the source model a general bias for concatenative affixation, unpolluted by too many lexical and phonological alternations. as reported here, such a model is a promising starting point for inflection in many non-agglutinative systems, such as romance verbs, which nevertheless are strongly concatenative. where transfer between related languages fails, it is conjecturally possible that the source model representations of edit operations are too closely linked to particular phonological and lexical properties of the source. this is clearly shown in the synthetic transfer experiments, where generic suffixation fails in germanic and uralic despite these families being strongly suffixing, because the system has learned to remodel its outputs to conform too closely to source-language templates. more broadly, the synthetic experiments show a link between language typology and learning of morphological processes, suggesting that language structure, not only language relatedness, is key to successful transfer-transfer of structural principles can lead to improvements even without cognate words or affixes. for instance, successful reduplication appears only in austronesian and successful gemination only in uralic. a promising direction for future work would be to replace the language family feature with a set of typological feature indicators such as wals properties @xcite , which might help the model to learn faster in low-resource target languages. two other extensions might bring the memorybased model closer to the state of the art in supervised inflection prediction. first, although the sig-morphon 2020 datasets are balanced by paradigm cell, real datasets are zipfian, with sparse coverage of cells @xcite . for languages with large paradigms, the model thus requires the capacity to fill cells for which no exemplar can be retrieved, perhaps using a variant of adaptive source selection @xcite . second, the similar-exemplar model performs better in one-shot transfer experiments, but is hampered in the supervised setting by train-test mismatch. selecting training exemplars using a classifier which could also be used at inference time would reduce this mismatch. these experiments are left for future work. finally, since the memory-based architecture is cognitively inspired, it might be adapted as a cognitive model of language learning in contact situations. work on this learning process suggests that speakers find it much easier to learn new exponents than to learn new morphological processes @xcite . thus, the impact of source-language transfer may indeed be most significant in cases where the l1 and l2 (source and target) languages differ in the abstract mechanisms of inflection rather than the specifics. historical contact-induced change provides evidence for this viewpoint in the form of systems which have changed to employ the same processes as a contact language. for example, cappadocian greek has become agglutinative through its extensive contact with turkish @xcite . for other examples, see @xcite . ## conclusion the results of this paper demonstrate that the proposed cognitive mechanism of memory-based analogy provides a relatively strong basis for inflection prediction. performance in a supervised setting is strongest in languages without large numbers of inflection classes, and requires training exemplars to be selected in the same way as test exemplars. memory-based analogy also provides a foundation for one-shot transfer; in this case, training exemplars should closely match the elicited inflections, so that the model learns to copy rather than reconstruct the output form. one-shot transfer using this mechanism can achieve higher accuracy than previously thought, even when no genetically related languages are available in training. scores vary widely, but can be over 80% for some languages. finally, this paper provides new evidence about what kinds of abstract information (beyond character correspondences) is transferred between languages when learning to inflect. the model learns general processes for prefixation and suffixation which apply (to some extent) across character sets, but its application of these can be disrupted by language-specific morpho-phonological rules. it also learns to reduplicate arbitrary cv sequences, but applies this process only when targeting a language with reduplication. learning of morphological processes in general appears to be driven by the input typology. the discussion argues that the usefulness of general representations for prefixation and suffixation accounts for the puzzling effectiveness of agglutinative languages as transfer sources reported in previous research.