| { | |
| "paper_id": "2021", | |
| "header": { | |
| "generated_with": "S2ORC 1.0.0", | |
| "date_generated": "2023-01-19T15:31:28.048525Z" | |
| }, | |
| "title": "Finite-state Model of Shupamem Reduplication", | |
| "authors": [ | |
| { | |
| "first": "Magdalena", | |
| "middle": [], | |
| "last": "Markowska", | |
| "suffix": "", | |
| "affiliation": { | |
| "laboratory": "", | |
| "institution": "Stony Brook University", | |
| "location": {} | |
| }, | |
| "email": "[email protected]" | |
| }, | |
| { | |
| "first": "Jeffrey", | |
| "middle": [], | |
| "last": "Heinz", | |
| "suffix": "", | |
| "affiliation": { | |
| "laboratory": "", | |
| "institution": "Stony Brook University", | |
| "location": {} | |
| }, | |
| "email": "[email protected]" | |
| }, | |
| { | |
| "first": "Owen", | |
| "middle": [], | |
| "last": "Rambow", | |
| "suffix": "", | |
| "affiliation": { | |
| "laboratory": "", | |
| "institution": "Stony Brook University", | |
| "location": {} | |
| }, | |
| "email": "[email protected]" | |
| } | |
| ], | |
| "year": "", | |
| "venue": null, | |
| "identifiers": {}, | |
| "abstract": "Shupamem, a language of Western Cameroon, is a tonal language which also exhibits the morpho-phonological process of full reduplication. This creates two challenges for a finitestate model of its morpho-syntax and morphophonology: how to manage the full reduplication, as well as the autosegmental nature of lexical tone. Dolatian and Heinz (2020) explain how 2-way finite-state transducers can model full reduplication without an exponential increase in states, and finite-state transducers with multiple tapes have been used to model autosegmental tiers, including tone (Wiebe, 1992; Dolatian and Rawski, 2020a; Rawski and Dolatian, 2020). Here we synthesize 2-way finite-state transducers and multitape transducers, resulting in a finite-state formalism that subsumes both, to account for the full reduplicative processes in Shupamem which also affect tone.", | |
| "pdf_parse": { | |
| "paper_id": "2021", | |
| "_pdf_hash": "", | |
| "abstract": [ | |
| { | |
| "text": "Shupamem, a language of Western Cameroon, is a tonal language which also exhibits the morpho-phonological process of full reduplication. This creates two challenges for a finitestate model of its morpho-syntax and morphophonology: how to manage the full reduplication, as well as the autosegmental nature of lexical tone. Dolatian and Heinz (2020) explain how 2-way finite-state transducers can model full reduplication without an exponential increase in states, and finite-state transducers with multiple tapes have been used to model autosegmental tiers, including tone (Wiebe, 1992; Dolatian and Rawski, 2020a; Rawski and Dolatian, 2020). Here we synthesize 2-way finite-state transducers and multitape transducers, resulting in a finite-state formalism that subsumes both, to account for the full reduplicative processes in Shupamem which also affect tone.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Abstract", | |
| "sec_num": null | |
| } | |
| ], | |
| "body_text": [ | |
| { | |
| "text": "Reduplication is a very common morphological process cross-linguistically. Approximately 75% of world languages exhibit partial or total reduplication (Rubino, 2013) . This morphological process is particularly interesting from the computational point of view because it introduces challenges for 1-way finite-state transducers (FSTs). Even though partial reduplication can be modelled with 1-way FSTs (Roark and Sproat, 2007; Chandlee and Heinz, 2012) , there is typically an explosion in the number of states. Total reduplication, on the other hand, is the only known morphophonological process that cannot be modelled with 1-way FSTs because the number of copied elements, in principle, has no upper bound. Dolatian and Heinz (2020) address this challenge with 2way FSTs, which can move back and forth on the input tape, producing a faithful copy of a string.", | |
| "cite_spans": [ | |
| { | |
| "start": 151, | |
| "end": 165, | |
| "text": "(Rubino, 2013)", | |
| "ref_id": "BIBREF30" | |
| }, | |
| { | |
| "start": 402, | |
| "end": 426, | |
| "text": "(Roark and Sproat, 2007;", | |
| "ref_id": "BIBREF29" | |
| }, | |
| { | |
| "start": 427, | |
| "end": 452, | |
| "text": "Chandlee and Heinz, 2012)", | |
| "ref_id": "BIBREF5" | |
| }, | |
| { | |
| "start": 710, | |
| "end": 735, | |
| "text": "Dolatian and Heinz (2020)", | |
| "ref_id": "BIBREF7" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Introduction", | |
| "sec_num": "1" | |
| }, | |
| { | |
| "text": "Deterministic 2-way FSTs can model both partial and full segmental reduplication in a compact way.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Introduction", | |
| "sec_num": "1" | |
| }, | |
| { | |
| "text": "However, many languages that exhibit reduplicative processes also are tonal, which often means that tones and segments act independently from one another in their morpho-phonology. For instance, in Shupamem, a tonal language of Western Cameroon, nd\u00e1p 'house' \u2192 nd\u00e2p nd\u00e0p 'houses' (Markowska, 2020) .", | |
| "cite_spans": [ | |
| { | |
| "start": 280, | |
| "end": 297, | |
| "text": "(Markowska, 2020)", | |
| "ref_id": "BIBREF22" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Introduction", | |
| "sec_num": "1" | |
| }, | |
| { | |
| "text": "Pioneering work in autosegmental phonology (Leben, 1973; Williams, 1976; Goldsmith, 1976) shows tones may act independently from their tonebearing units (TBUs). Moreover, tones may exhibit behavior that is not typical for segments (Hyman, 2014; Jardine, 2016) , which brings yet another strong argument for separating them from segments in their linguistic representations. Such autosegmental representations can be mimicked using finite-state machines, in particular, Multi-Tape Finite-State Transducers (MT FSTs) (Wiebe, 1992; Dolatian and Rawski, 2020a; Rawski and Dolatian, 2020) . We note that McCarthy (1981) uses the same autosegmental representations in the linguistic representation to model templatic morphology, and this approach has been modeled for Semitic morphological processing using multitape automata (Kiraz, 2000; Habash and Rambow, 2006) .", | |
| "cite_spans": [ | |
| { | |
| "start": 43, | |
| "end": 56, | |
| "text": "(Leben, 1973;", | |
| "ref_id": "BIBREF20" | |
| }, | |
| { | |
| "start": 57, | |
| "end": 72, | |
| "text": "Williams, 1976;", | |
| "ref_id": "BIBREF32" | |
| }, | |
| { | |
| "start": 73, | |
| "end": 89, | |
| "text": "Goldsmith, 1976)", | |
| "ref_id": "BIBREF13" | |
| }, | |
| { | |
| "start": 231, | |
| "end": 244, | |
| "text": "(Hyman, 2014;", | |
| "ref_id": "BIBREF16" | |
| }, | |
| { | |
| "start": 245, | |
| "end": 259, | |
| "text": "Jardine, 2016)", | |
| "ref_id": "BIBREF17" | |
| }, | |
| { | |
| "start": 515, | |
| "end": 528, | |
| "text": "(Wiebe, 1992;", | |
| "ref_id": "BIBREF31" | |
| }, | |
| { | |
| "start": 529, | |
| "end": 556, | |
| "text": "Dolatian and Rawski, 2020a;", | |
| "ref_id": "BIBREF8" | |
| }, | |
| { | |
| "start": 557, | |
| "end": 583, | |
| "text": "Rawski and Dolatian, 2020)", | |
| "ref_id": "BIBREF28" | |
| }, | |
| { | |
| "start": 599, | |
| "end": 614, | |
| "text": "McCarthy (1981)", | |
| "ref_id": "BIBREF23" | |
| }, | |
| { | |
| "start": 820, | |
| "end": 833, | |
| "text": "(Kiraz, 2000;", | |
| "ref_id": "BIBREF19" | |
| }, | |
| { | |
| "start": 834, | |
| "end": 858, | |
| "text": "Habash and Rambow, 2006)", | |
| "ref_id": "BIBREF14" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "tones H HL L segments ndap ndap ndap", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "This paper investigates what finite-state machinery is needed for languages which have both reduplication and tones. We first argue that we need a synthesis of the aforementioned transducers, i.e. 1-way, 2-way and MT FSTs, to model morphology in the general case. The necessity for such a formal device will be supported by the morphophonological processes present in Shupamem nominal and verbal reduplication. We then discuss an alternative, in which we use the MT FST to handle both reduplication and tones. It is important to emphasize that all of the machines we discuss are deterministic, which serves as another piece of evidence that even such complex processes like full reduplication can be modelled with deterministic finite-state technology (Chandlee and Heinz, 2012; Heinz, 2018) .", | |
| "cite_spans": [ | |
| { | |
| "start": 752, | |
| "end": 778, | |
| "text": "(Chandlee and Heinz, 2012;", | |
| "ref_id": "BIBREF5" | |
| }, | |
| { | |
| "start": 779, | |
| "end": 791, | |
| "text": "Heinz, 2018)", | |
| "ref_id": "BIBREF15" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "tones H HL L segments ndap ndap ndap", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "This paper is structured as follows. First, we will briefly summarize the linguistic phenomena observed in Shupamem reduplication (Section 2). We then provide a formal description of the 2-way (Section 3) and MT FSTs (Section 4). We propose a synthesis of the 1-way, 2-way and MT FSTs in Section 5 and further illustrate them using relevant examples from Shupamem in Section 6. In Section 7 we discuss a possible alternative to the model which uses only MT FSTs. Finally, in Section 8 we show that the proposed model works for other tonal languages as well, and we conclude our contributions.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "tones H HL L segments ndap ndap ndap", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Shupamem is an understudied Grassfields Bantu language of Cameroon spoken by approximately 420,000 speakers (Eberhard et al., 2021) . It exhibits four contrastive surface tones (Nchare, 2012): high (H; we use diacriticV on a vowel as an orthographic representation), low (L; diacriticV), rising (LH; diacriticV), and falling (HL; diacriti\u0109 V). Nouns and verbs in the language reduplicate to create plurals and introduce semantic contrast, respectively. Out of 13 nouns classes, only one exhibits reduplication. Nouns that belong to that class are monosyllabic and carry either H or L lexical tones. Shupamem verbs are underlyingly H or rising (LH). Table 1 summarizes the data adapted from Markowska (2020).", | |
| "cite_spans": [ | |
| { | |
| "start": 108, | |
| "end": 131, | |
| "text": "(Eberhard et al., 2021)", | |
| "ref_id": "BIBREF10" | |
| } | |
| ], | |
| "ref_spans": [ | |
| { | |
| "start": 649, | |
| "end": 656, | |
| "text": "Table 1", | |
| "ref_id": "TABREF1" | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "Shupamem nominal and verbal reduplication", | |
| "sec_num": "2" | |
| }, | |
| { | |
| "text": "In both nouns and verbs, the first item of the reduplicated phrase is the base, while the reduplicant is the suffix. We follow the analysis in Markowska (2020) and summarize it here. The nominal reduplicant is toneless underlyingly, while the verbal reduplicant has an H tone. Furthermore, the rule of Opposite Tone Insertion explains the tonal alternation in the base of reduplicated nouns, and Default L-Insertion accounts for the L tone on the suffix. Interestingly, more tonal alternations are observed when the tones present in the reduplicated phrase interact with other phrasal/grammatical tones. For The underlined tones indicate changes triggered by the H grammatical/phrasal tone. In the observance of H tone associated with the right edge of the subject position in Shupamem, the L tone that is present on the surface in the suffix of reduplicated nouns (recall Table 1 ), now is represented with an H tone. Now it should be clear that the noun reduplicant should, in fact, be toneless in the underlying representation (UR). While the presence of H tone directly preceding the reduplicated verb does not affect H-tone verbs, such as k\u00e1 'fry', it causes major tonal alternations in rising reduplicated verbs. Let us look at a particular example representing the final row in Table 2 :", | |
| "cite_spans": [ | |
| { | |
| "start": 143, | |
| "end": 159, | |
| "text": "Markowska (2020)", | |
| "ref_id": "BIBREF22" | |
| } | |
| ], | |
| "ref_spans": [ | |
| { | |
| "start": 873, | |
| "end": 880, | |
| "text": "Table 1", | |
| "ref_id": "TABREF1" | |
| }, | |
| { | |
| "start": 1285, | |
| "end": 1292, | |
| "text": "Table 2", | |
| "ref_id": "TABREF2" | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "Shupamem nominal and verbal reduplication", | |
| "sec_num": "2" | |
| }, | |
| { | |
| "text": "p@ 'PASTIII' + k\u01ce k\u00e1 'peel.CONTR' \u2192 p@ k\u00e2 k\u01ce", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Shupamem nominal and verbal reduplication", | |
| "sec_num": "2" | |
| }, | |
| { | |
| "text": "The H tone associated with the tense marker introduces two tonal changes to the reduplicated verb: it causes tonal reversal on the morphological base, and it triggers L-tone insertion to the left edge of the reduplicant.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Shupamem nominal and verbal reduplication", | |
| "sec_num": "2" | |
| }, | |
| { | |
| "text": "The data in both Table 1 and 2 show that 1) verbs and nouns in Shupamem reduplicate fully at the segmental level, and 2) tones are affected by phonological rules that function solely at the suprasegmental level. Consequently, a finite-state model of the language must be able to account for", | |
| "cite_spans": [], | |
| "ref_spans": [ | |
| { | |
| "start": 17, | |
| "end": 24, | |
| "text": "Table 1", | |
| "ref_id": "TABREF1" | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "Shupamem nominal and verbal reduplication", | |
| "sec_num": "2" | |
| }, | |
| { | |
| "text": "q 0 start q 1 q 2 q 3 q 4 ( ,\u03bb,+1) (k,k,+1) (\u00e1,\u00e1,+1) ( ,\u03bb,-1) (k,\u03bb,\u22121) (\u00e1,\u03bb,\u22121) ( ,\u223c,+1) (k,k,+1) (\u00e1,\u00e1,+1) ( ,\u03bb,+1)", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Shupamem nominal and verbal reduplication", | |
| "sec_num": "2" | |
| }, | |
| { | |
| "text": "Figure 1: 2-way FST for total reduplication of k\u00e1 'fry.IMP \u2192 k\u00e1 k\u00e1 'fry.IMP as opposed to boiling' those factors. In the next two sections, we will provide a brief formal introduction to 2-way FSTs and MT-FSTs, and explain how they correctly model full reduplication and autosegmental representation, respectively. In this paper, we use an orthographic representation for Shupamem which uses diacritics to indicate tone. Shupamem does not actually use this orthography; however, we are interested in modeling the entire morpho-phonology of the language, independently of choices made for the orthography. Furthermore, many languages do use diacritics to indicate tone, including the Volta-Niger languages Yoruba and Igbo, as well as Dschang, a Grassfields language closely related to Shupamem. (For a discussion of the orthography of Cameroonian languages, with a special consideration of tone, see (Bird, 2001) .) Diacritics are also used to write tone in non-African languages, such as Vietnamese. Therefore, this paper is also relevant to NLP applications for morphological analysis and generation in languages whose orthography marks tones with diacritics: the automata we propose could be used to directly model morpho-phonological computational problems for the orthography of such languages.", | |
| "cite_spans": [ | |
| { | |
| "start": 899, | |
| "end": 911, | |
| "text": "(Bird, 2001)", | |
| "ref_id": "BIBREF2" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Shupamem nominal and verbal reduplication", | |
| "sec_num": "2" | |
| }, | |
| { | |
| "text": "As Roark and Sproat (2007) point out, almost all morpho-pholnological processes can be modelled with 1-way FSTs with the exception of full reduplication, whose output is not a regular language. One way to increase the expressivity of 1-way FST is to allow the read head of the machine to move back and forth on the input tape. This is exactly what 2-way FST does (Rabin and Scott, 1959) , and Dolatian and Heinz (2020) explain how these transducers model full reduplication not only effectively, but more faithfully to linguistic generalizations.", | |
| "cite_spans": [ | |
| { | |
| "start": 3, | |
| "end": 26, | |
| "text": "Roark and Sproat (2007)", | |
| "ref_id": "BIBREF29" | |
| }, | |
| { | |
| "start": 363, | |
| "end": 386, | |
| "text": "(Rabin and Scott, 1959)", | |
| "ref_id": "BIBREF27" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "2-way FSTs", | |
| "sec_num": "3" | |
| }, | |
| { | |
| "text": "Similarly to a 1-way FST, when a 2-way FST reads an input, it writes something on the output tape. If the desired output is a fully reduplicated string, then the FST faithfully 'copies' the input string while scanning it from left to right. In contrast, while scanning the string from right to left, it outputs nothing (\u03bb), and it then copies the string again from left to right. Figure 1 illustrates a deterministic 2-way FST that reduplicates k\u00e1 'fry.IMP'; readers are referred to Dolatian and Heinz (2020) for formal definitions. The key difference between deterministic 1-way FSTs and deterministic 2-way FSTs are the addition of the 'direction' parameters {+1, 0, \u22121} on the transitions which tell the FST to advance to the next symbol on the input tape (+1), stay on the same symbol (0), or return to the previous symbol (-1). Deterministic 1-way FSTs can be thought of as deterministic 2-way FSTs where transitions are all (+1).", | |
| "cite_spans": [ | |
| { | |
| "start": 483, | |
| "end": 508, | |
| "text": "Dolatian and Heinz (2020)", | |
| "ref_id": "BIBREF7" | |
| } | |
| ], | |
| "ref_spans": [ | |
| { | |
| "start": 380, | |
| "end": 388, | |
| "text": "Figure 1", | |
| "ref_id": null | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "2-way FSTs", | |
| "sec_num": "3" | |
| }, | |
| { | |
| "text": "The input to this machine is k\u00e1 . The and symbols mark beginning and end of a string, and \u223c indicates the boundary between the first and the second copy. None of those symbols are essential for the model, nevertheless they facilitate the transitions. For example, when the machine reads , it transitions from state q 1 to q 2 and reverses the direction of the read head. After outputting the first copy (state q 1 ) and rewinding (state q 2 ), the machine changes to state q 3 when it scans the left boundary symbol and outputs \u223c to indicate that another copy will be created. In this particular example, not marking morpheme boundary would not affect the outcome. However, in Section 5, where we propose the fully-fledged model, it will be crucial to somehow separate the first from second copy.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "2-way FSTs", | |
| "sec_num": "3" | |
| }, | |
| { | |
| "text": "Multiple-tape FSTs are machines which operate in the exact same was as 1-way FST, with one key difference: they can read the input and/or write the output on multiple tapes. Such a transducer can operate in an either synchronous or asynchronous manner, such that the input will be read on all tapes and an output produced simultaneously, or the machine will operate on the input tapes one by one. MT-FST can take a single ('linear') string as an input and output multiple strings on multiple tapes or it can do the reverse (Rabin and Scott, 1959; Fischer, 1965) .", | |
| "cite_spans": [ | |
| { | |
| "start": 523, | |
| "end": 546, | |
| "text": "(Rabin and Scott, 1959;", | |
| "ref_id": "BIBREF27" | |
| }, | |
| { | |
| "start": 547, | |
| "end": 561, | |
| "text": "Fischer, 1965)", | |
| "ref_id": "BIBREF12" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Multitape FSTs", | |
| "sec_num": "4" | |
| }, | |
| { | |
| "text": "To illustrate this idea, let us look at Shupamem noun m\u00e0p\u00e0m 'coat'. It has been argued that Shupamem nouns with only L surface tones will have the L tone present in the UR (Markowska, 2019 (Markowska, , 2020 . Moreover, in order to avoid violating the Obligatory Contour Principle (OCP) (Leben, 1973) , which prohibits two identical consecutive elements (tones) in the UR of a morpheme, we will assume that only one L tone is present in the input. Consequently, the derivation will look as shown in Table 3.", | |
| "cite_spans": [ | |
| { | |
| "start": 172, | |
| "end": 188, | |
| "text": "(Markowska, 2019", | |
| "ref_id": "BIBREF21" | |
| }, | |
| { | |
| "start": 189, | |
| "end": 207, | |
| "text": "(Markowska, , 2020", | |
| "ref_id": "BIBREF22" | |
| }, | |
| { | |
| "start": 287, | |
| "end": 300, | |
| "text": "(Leben, 1973)", | |
| "ref_id": "BIBREF20" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Multitape FSTs", | |
| "sec_num": "4" | |
| }, | |
| { | |
| "text": "T-tape L Input:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Input:", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "S-tape mapam Output: Single tape m\u00e0p\u00e0m Separating tones from segments in this manner, i.e. by representing tones on the T(one)-tape and segments on the S(segmental)-tape, faithfully resembles linguistic understanding of the UR of a word. The surface form m\u00e0p\u00e0m has only one L tone present in the UR, which then spreads to all TBUs, which happen to be vowels in Shupamem, if no other tone is present.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Input:", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "An example of a multi-tape machine is presented in Figure 2 . For better readability, we introduce a generalized symbols for vowels (V) and consonants (C), so that the input alphabet is \u03a3 = {(C, V ), (L, H)} \u222a { , }, and the output alphabet is \u0393 = {C,V ,V }. The machine operates on 2 input tapes and writes the output on a single tape. Therefore, we could think of such machine as a linearizer. The two input tapes represent the Tonal and Segmental tiers and so we label them T and S, respectively. We illustrate the functioning of the machine using the example (mapam, L) \u2192 m\u00e0p\u00e0m 'coat'. While transitioning from state q 0 to q 1 , the output is an empty string since the left edge marker is being read on both tapes simultaneously. In state q 1 , when a consonant is being read, the machine outputs the exact same consonant on the output tape. However, when the machine reaches a vowel, it outputs a vowel with a tone that is being read at the same time on the T-tape (in our exam-ple, (L, V) \u2192V) and transitions to state q 2 (if the symbol on the T-tape is H) or q 3 (for L, as in our example). In states q 2 and q 3 , consonants are simply output as in state q 1 , but for vowels, one of three conditions may occur: the read head on the Tonal tape may be H or L, in which case the automaton transitions (if not already there) to q 2 (for H) or q 3 (for L), and outputs the appropriate orthographic symbol. But if on the Tonal tape the read head is on the right boundary marker , we are in a case where there are more vowels in the Segmental tape than tones in the Tonal tape. This is when the OCP determines the interpretation: all vowels get the tone of the last symbol on the Tone tier (which we remember as states q 2 and q 3 ). In our example, this is an L. Finally, when the Segmental tape also reaches the right boundary marker , the machine transitions to the final state q 4 . This ('linearizing') MT-FST consists of 4 states and shows how OCP effects can be handled with asynchronous multitape FSTs. Note that when there are more tones on the Tonal tier than vowels on the Segmental tier, they are simply ignored. We refer readers to Dolatian and Rawski (2020b) for formal definitions of these MT transducers.", | |
| "cite_spans": [], | |
| "ref_spans": [ | |
| { | |
| "start": 51, | |
| "end": 59, | |
| "text": "Figure 2", | |
| "ref_id": "FIGREF0" | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "Input:", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "We are also interested in the inverse processthat is, a finite-state machine that in the example above would take a single input string [m\u00e0p\u00e0m] and produce two output strings [L] and [mapam] . While multitape FSTs are generally conceived as relations over n-ary relations over strings, Dolatian and Rawski (2020b) define their machines deterministically with n input tapes and a single output tape. We generalize their definition below. Similarly to spreading processes described above, separating tones from segments give us a lot of benefits while accounting for tonal alternations taking place in nominal and verbal reduplication in Shupamem. First of all, functions such as Opposite Tone Insertion (OTI) will apply solely at the tonal level, while segments can be undergoing other operations at the same time (recall that MT-FSTs can operate on some or all tapes simultaneously). Secondly, representing tones separately from segments make tonal processes local, and therefore all the alternations can be expresses with less powerful functions (Chandlee, 2017) . Now that we presented the advantages of MT-FSTs, and the need for utilizing 2-way FSTs to model full reduplication, we combine those machines to account for all morphophonological pro- ", | |
| "cite_spans": [ | |
| { | |
| "start": 136, | |
| "end": 143, | |
| "text": "[m\u00e0p\u00e0m]", | |
| "ref_id": null | |
| }, | |
| { | |
| "start": 183, | |
| "end": 190, | |
| "text": "[mapam]", | |
| "ref_id": null | |
| }, | |
| { | |
| "start": 286, | |
| "end": 313, | |
| "text": "Dolatian and Rawski (2020b)", | |
| "ref_id": "BIBREF9" | |
| }, | |
| { | |
| "start": 1047, | |
| "end": 1063, | |
| "text": "(Chandlee, 2017)", | |
| "ref_id": "BIBREF4" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Input:", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "q 0 start q 1 q 2 q 3 q 4 T:( ,", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Input:", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Before we define Deterministic 2-Way Multi-tape FST (or 2-way MT FST for short) we introduce some notation. An alphabet \u03a3 is a finite set of symbols and \u03a3 * denotes the set of all strings of finite length whose elements belong to \u03a3. We use \u03bb to denote the empty string. For each n \u2208 N, an n-string is a tuple w 1 , . . . w n where each w i is a string belonging to \u03a3 * i (1 \u2264 i \u2264 n). These n alphabets may contain distinct symbols or not. We write #\u00bb w to indicate a n-string and #\u00bb \u03bb to indicate the n-string where each w i = \u03bb. We also write #\u00bb \u03a3 to denote a tuple of n alphabets:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Deterministic 2-Way Multi-tape FST", | |
| "sec_num": "5" | |
| }, | |
| { | |
| "text": "#\u00bb \u03a3 = \u03a3 1 \u00d7 \u2022 \u2022 \u2022 \u03a3 n . Elements of #\u00bb \u03a3 are denoted #\u00bb \u03c3 . If #\u00bb", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Deterministic 2-Way Multi-tape FST", | |
| "sec_num": "5" | |
| }, | |
| { | |
| "text": "w and #\u00bb v belong to #\u00bb \u03a3 * then the pointwise concatenation of #\u00bb w and #\u00bb v is denoted #\u00bb w #\u00bb v and equals", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Deterministic 2-Way Multi-tape FST", | |
| "sec_num": "5" | |
| }, | |
| { | |
| "text": "w 1 , . . . w n v 1 , . . . v n = w 1 v 1 , . . . w n v n .", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Deterministic 2-Way Multi-tape FST", | |
| "sec_num": "5" | |
| }, | |
| { | |
| "text": "We are interested in functions that map n-strings to m-strings with n, m \u2208 N. In what follows we gen-erally use the index i to range from 1 to n and the index j to range from 1 to m.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Deterministic 2-Way Multi-tape FST", | |
| "sec_num": "5" | |
| }, | |
| { | |
| "text": "We define Deterministic 2-Way n, m Multitape FST (2-way (n, m) MT FST for short) for n, m \u2208 N by synthesizing the definitions of Dolatian and Heinz (2020) and Dolatian and Rawski (2020b) ; n, m refer to the number of input tapes and output tapes, respectively. A Deterministic 2-Way n, m Multitape FST is a six-tuple (Q,", | |
| "cite_spans": [ | |
| { | |
| "start": 129, | |
| "end": 154, | |
| "text": "Dolatian and Heinz (2020)", | |
| "ref_id": "BIBREF7" | |
| }, | |
| { | |
| "start": 159, | |
| "end": 186, | |
| "text": "Dolatian and Rawski (2020b)", | |
| "ref_id": "BIBREF9" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Deterministic 2-Way Multi-tape FST", | |
| "sec_num": "5" | |
| }, | |
| { | |
| "text": "#\u00bb \u03a3, #\u00bb \u0393 , q 0 , F, \u03b4), where \u2022 #\u00bb \u03a3 = \u03a3 1 . . . \u03a3", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Deterministic 2-Way Multi-tape FST", | |
| "sec_num": "5" | |
| }, | |
| { | |
| "text": "n is a tuple of n input alphabets that include the boundary symbols, i.e.,", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Deterministic 2-Way Multi-tape FST", | |
| "sec_num": "5" | |
| }, | |
| { | |
| "text": "{ , } \u2282 \u03a3 i , 1 \u2264 i \u2264 n, \u2022 #\u00bb \u0393 is a tuple of m output alphabets \u0393 j (1 \u2264 j \u2264 m), \u2022 \u03b4 : Q \u00d7 #\u00bb \u03a3 \u2192 Q \u00d7 #\u00bb \u0393 * \u00d7 #\u00bb", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Deterministic 2-Way Multi-tape FST", | |
| "sec_num": "5" | |
| }, | |
| { | |
| "text": "D is the transition function. D is an alphabet of directions equal to {\u22121, 0, +1} and #\u00bb D is an n-tuple. #\u00bb \u0393 * is a m-tuple of strings written to each output tape. We understand \u03b4(q, #\u00bb \u03c3 ) = (r, #\u00bb v , #\u00bb d ) as follows. It means that if the transducer is in state q and the n read heads on the input tapes are on symbols \u03c3 1 , . . . \u03c3 n = #\u00bb \u03c3 , then several actions ensue. The transducer changes to state r and pointwise concatenates #\u00bb v to the m output tapes. The n read heads then move according to the instructions", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Deterministic 2-Way Multi-tape FST", | |
| "sec_num": "5" | |
| }, | |
| { | |
| "text": "#\u00bb d \u2208 #\u00bb D.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Deterministic 2-Way Multi-tape FST", | |
| "sec_num": "5" | |
| }, | |
| { | |
| "text": "For each read head on input tape i, it moves back one symbol iff d i = \u22121, stays where it is iff d i = 0, and advances one symbol iff d i = +1. (If the read head on an input tape \"falls off\" the beginning or end of the string, the computation halts.)", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Deterministic 2-Way Multi-tape FST", | |
| "sec_num": "5" | |
| }, | |
| { | |
| "text": "The function recognized by a 2-way (n, m) MT FST is defined as follows. A configuration of a n, m-MT-FST T is a 4-tuple", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Deterministic 2-Way Multi-tape FST", | |
| "sec_num": "5" | |
| }, | |
| { | |
| "text": "#\u00bb \u03a3 * , q, #\u00bb \u03a3 * , #\u00bb \u0393 * .", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Deterministic 2-Way Multi-tape FST", | |
| "sec_num": "5" | |
| }, | |
| { | |
| "text": "The meaning of the configuration ( #\u00bb w, q, #\u00bb x , u) is that the input to T is #\u00bb w #\u00bb x and the machine is currently in state q with the n read heads on the first symbol of each x i (or has fallen off the right edge of the i-th input tape if x i = \u03bb) and that #\u00bb u is currently written on the m output tapes.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Deterministic 2-Way Multi-tape FST", | |
| "sec_num": "5" | |
| }, | |
| { | |
| "text": "If the current configuration is", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Deterministic 2-Way Multi-tape FST", | |
| "sec_num": "5" | |
| }, | |
| { | |
| "text": "( #\u00bb w, q, #\u00bb x , #\u00bb u ) and \u03b4(q, #\u00bb \u03c3 ) = (r, #\u00bb v , #\u00bb d ) then the next configuration is ( #\u00bb w , r, #\u00bb x , #\u00bb u #\u00bb v ), where for each i, 1 \u2264 i \u2264 n: \u2022 #\u00bb w = w 1 . . . w n and #\u00bb x = x 1 . . . x n (1 \u2264 i \u2264 n); \u2022 w i = w i and x i = x i iff d i = 0; \u2022 w i = w i \u03c3 and x i = x i iff d i = +1 and there exists \u03c3 \u2208 \u03a3 i , x i \u2208 \u03a3 * i such that x i = \u03c3x i ; \u2022 w i = w i and x i = \u03c3x i iff d i = \u22121 and there exists \u03c3 \u2208 \u03a3 i , w i \u2208 \u03a3 * i such that w i = \u03c3w i . We write ( #\u00bb w, q, #\u00bb x , #\u00bb u ) \u2192 ( #\u00bb w , r, #\u00bb x , #\u00bb u #\u00bb v ).", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Deterministic 2-Way Multi-tape FST", | |
| "sec_num": "5" | |
| }, | |
| { | |
| "text": "Observe that since \u03b4 is a function, there is at most one next configuration (i.e., the system is deterministic). Note there are some circumstances where there is no next configuration. For instance if d i = +1 and x i = \u03bb then there is no place for the read head to advance. In such cases, the computation halts.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Deterministic 2-Way Multi-tape FST", | |
| "sec_num": "5" | |
| }, | |
| { | |
| "text": "The transitive closure of \u2192 is denoted with \u2192 + . Thus, if c \u2192 + c then there exists a finite sequence of configurations c 1 , c 2 . . . c n with n > 1 such that", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Deterministic 2-Way Multi-tape FST", | |
| "sec_num": "5" | |
| }, | |
| { | |
| "text": "c = c 1 \u2192 c 2 \u2192 . . . \u2192 c n = c .", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Deterministic 2-Way Multi-tape FST", | |
| "sec_num": "5" | |
| }, | |
| { | |
| "text": "At last we define the function that a 2-way (n, m) MT FST T computes. The input strings are augmented with word boundaries on each tape. Let", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Deterministic 2-Way Multi-tape FST", | |
| "sec_num": "5" | |
| }, | |
| { | |
| "text": "# \u00bb w = w 1 , . . . w n . For each n-string #\u00bb w \u2208 #\u00bb \u03a3 * , f T ( #\u00bb w) = #\u00bb u \u2208 #\u00bb \u0393 * provided there exists q f \u2208 F such that ( #\u00bb \u03bb , q 0 , # \u00bb w , #\u00bb \u03bb ) \u2192 + ( # \u00bb w , q f , #\u00bb \u03bb , #\u00bb u ). If f T ( #\u00bb", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Deterministic 2-Way Multi-tape FST", | |
| "sec_num": "5" | |
| }, | |
| { | |
| "text": "w) = #\u00bb u then #\u00bb u is unique because the sequence of configurations is determined deterministically. If the computation of a 2-way MT-FST T halts on some input #\u00bb w (perhaps because a subsequent configuration does not exist), then we say T is undefined on #\u00bb w. The 2-way FSTs studied by Dolatian and Heinz (2020) are 2-way 1,1 MT FST. The n-MT-FSTs studied by Dolatian and Rawski (2020b) are 2-way n,1 MT FST where none of the transitions contain the \u22121 direction. In this way, the definition presented here properly subsumes both. Figure 4 shows an example of a 1,2 MT FST that \"splits\" a phonetic (or orthographic) transcription of a Shupamem word into a linguistic representation with a tonal and segmental tier by outputting two output strings, one for each tier. ", | |
| "cite_spans": [ | |
| { | |
| "start": 289, | |
| "end": 314, | |
| "text": "Dolatian and Heinz (2020)", | |
| "ref_id": "BIBREF7" | |
| }, | |
| { | |
| "start": 362, | |
| "end": 389, | |
| "text": "Dolatian and Rawski (2020b)", | |
| "ref_id": "BIBREF9" | |
| } | |
| ], | |
| "ref_spans": [ | |
| { | |
| "start": 534, | |
| "end": 542, | |
| "text": "Figure 4", | |
| "ref_id": "FIGREF2" | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "Deterministic 2-Way Multi-tape FST", | |
| "sec_num": "5" | |
| }, | |
| { | |
| "text": "q 0 start q 1 q 2 I:( ,", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Deterministic 2-Way Multi-tape FST", | |
| "sec_num": "5" | |
| }, | |
| { | |
| "text": "As presented in Figure 3 , our proposed model, i.e. 2-way 2,2 MT FST, consists of 1-way and 2-way deterministic transducers, which together operate on two tapes. Both input and output are represented on two separate tapes: Tonal and Segmental Tape. Such representation is desired as it correctly mimics linguistic representations of tonal languages, where segments and tones act independently from each other. On the T-tape, a 1-way FST takes the H tone associated with the lexical representation of nd\u00e1p 'house' and outputs HL\u223c by implementing the Opposite Tone Insertion function. On the Stape, a 2-way FST takes ndap as an input, and outputs a faithful copy of that string (ndap ndap). The \u223c symbol significantly indicates the morpheme boundary and facilitates further output linearization. A detailed derivation of nd\u00e1p \u2192 nd\u00e2p ndap is shown in Table 4 . Figure 3 also represents two additional 'transformations': splitting and linearizing. First, the phonetic transcription of a string (nd\u00e1p) is split into tones and segments with a 1,2 MT FST. The output (H, ndap) serves as an input to the 2-way 2,2 MT FST. After the two processes discussed above apply, together acting on both tapes, the output is then linearized with an 2,1 MT FST. The composition of those three machines, i.e. 1,2 MT, 2-way 2,2 MT FST, and 2,1 MT FSTs is particularly useful in applications where a phonetic or orthographic representations needs to be processed.", | |
| "cite_spans": [], | |
| "ref_spans": [ | |
| { | |
| "start": 16, | |
| "end": 24, | |
| "text": "Figure 3", | |
| "ref_id": "FIGREF1" | |
| }, | |
| { | |
| "start": 848, | |
| "end": 855, | |
| "text": "Table 4", | |
| "ref_id": "TABREF5" | |
| }, | |
| { | |
| "start": 858, | |
| "end": 866, | |
| "text": "Figure 3", | |
| "ref_id": "FIGREF1" | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "Proposed model", | |
| "sec_num": "6" | |
| }, | |
| { | |
| "text": "As was discussed in Section 2, the tone on the second copy is dependent on whether there was an H tone preceding the reduplicated phrase. If there was one, the tone on the reduplicant will be H. Otherwise, the L-Default Insertion rule will insert L tone onto the toneless TBU of the second copy. Because those tonal changes are not part of the reduplicative process per se, we do not represent them either in our model in Figure 3 , or in the derivation in Table 4 . Those alternations could be accounted for with 1-way FST by simply inserting H or L tone to the output of the composed machine represented in Figure 3 .", | |
| "cite_spans": [], | |
| "ref_spans": [ | |
| { | |
| "start": 422, | |
| "end": 430, | |
| "text": "Figure 3", | |
| "ref_id": "FIGREF1" | |
| }, | |
| { | |
| "start": 457, | |
| "end": 464, | |
| "text": "Table 4", | |
| "ref_id": "TABREF5" | |
| }, | |
| { | |
| "start": 609, | |
| "end": 617, | |
| "text": "Figure 3", | |
| "ref_id": "FIGREF1" | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "Proposed model", | |
| "sec_num": "6" | |
| }, | |
| { | |
| "text": "Modelling verbal reduplication and the tonal processes revolving around it (see Table 2 ) works in the exact same way as described above for nominal reduplication. The only difference are the functions applied to the T-tape.", | |
| "cite_spans": [], | |
| "ref_spans": [ | |
| { | |
| "start": 80, | |
| "end": 87, | |
| "text": "Table 2", | |
| "ref_id": "TABREF2" | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "Proposed model", | |
| "sec_num": "6" | |
| }, | |
| { | |
| "text": "7 An Alternative to 2-Way Automata 2-way n,m MT FST generalize regular functions (Filiot and Reynier, 2016) to functions from nstrings to m-strings. It is worth asking however, what each of these mechanisms brings, especially in light of fundamental operations such as functional composition. For instance, it is clear that 2-way 1, 1 MT FSTs can handle full reduplication in contrast to 1-way 1, 1 MT FSTs which cannot. However, full reduplication can also be obtained via the composition of a 1-way 1,2 MT FST with a 1-way 2, 1 MT FST. To illustrate, the former takes a single string as an input, e.g. ndap, and 'splits' it into two identical copies represented on two separate output tapes. Then the 2-string output by this machines becomes the input to the next 1-way 2,1 MT FST. Since this machine is asynchronous, it can linearize the This derivation happens in the two automata in the center of Figure 3 . The FST for the Segmental tier is the one shown in Figure 1 , and the states in the table above refer to this FST.", | |
| "cite_spans": [ | |
| { | |
| "start": 81, | |
| "end": 107, | |
| "text": "(Filiot and Reynier, 2016)", | |
| "ref_id": "BIBREF11" | |
| } | |
| ], | |
| "ref_spans": [ | |
| { | |
| "start": 902, | |
| "end": 910, | |
| "text": "Figure 3", | |
| "ref_id": "FIGREF1" | |
| }, | |
| { | |
| "start": 964, | |
| "end": 972, | |
| "text": "Figure 1", | |
| "ref_id": null | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "Proposed model", | |
| "sec_num": "6" | |
| }, | |
| { | |
| "text": "2-string (e.g. (ndap, ndap)) to a 1-string (ndap ndap) by reading along one of these input tapes (and writing it) and reading the other one (and writing it) only when the read head on the first input tape reaches the end. Consequently, an alternative way to model full reduplication is to write the exact same output on two separate tapes, and then linearize it. Therefore, instead of implementing Shupamem tonal reduplication with 2-way 2,2 MT FST, we could use the composition of two 1-way MT-FST: 1,3 MT-FST and 3,1 MT-FST as shown in Figure 5 . (We need three tapes, two Segmental tapes to allow reduplication as just explained, and one Tonal tape as discussed before.) This example shows that additional tapes can be understood as serving a similar role to registers in register automata (Alur and\u010cern\u00fd, 2011; Alur et al., 2014) . Alur and his colleagues have shown that deterministic 1-way transducers with registers are equivalent in expressivity to 2-way deterministic transducers (without registers).", | |
| "cite_spans": [ | |
| { | |
| "start": 793, | |
| "end": 814, | |
| "text": "(Alur and\u010cern\u00fd, 2011;", | |
| "ref_id": null | |
| }, | |
| { | |
| "start": 815, | |
| "end": 833, | |
| "text": "Alur et al., 2014)", | |
| "ref_id": "BIBREF0" | |
| } | |
| ], | |
| "ref_spans": [ | |
| { | |
| "start": 538, | |
| "end": 546, | |
| "text": "Figure 5", | |
| "ref_id": "FIGREF3" | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "Proposed model", | |
| "sec_num": "6" | |
| }, | |
| { | |
| "text": "The proposed model is not limited to modeling full reduplication in Shupamem. It can be used for other tonal languages exhibiting this morphological process. We provide examples of the applicability of this model for the three following languages: Adhola, Kikerewe, and Shona. And we predict that other languages could also be accounted for.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Beyond Shupamem", | |
| "sec_num": "8" | |
| }, | |
| { | |
| "text": "All three languages undergo full reduplication at the segmental level. What differs is the tonal pattern governing this process. In Adhola (Kaplan, 2006) , the second copy is always represented with a fixed tonal pattern H.HL, where '.' indicates syllable boundary, irregardless of the lexical tone on the non-reduplicated form. In the following examples, unaccented vowels indicate low tone. For instance, tiju 'work' \u2192 tija t\u00edj\u00e2 'work too much', tSem\u00f3 'eat' \u2192 tSem\u00e1 tS\u0164\u00e9m\u00e2 'eat too much'. In Kikerewe (Odden, 1996) , if the first (two) syllable(s) of the verb are marked with an H tone, the H tone would also be present in the first two syllables of the reduplicated phrase. On the other hand, if the last two syllables of the nonreduplicated verb are marked with an H tone, the H tone will be present on the last two syllables of the reduplicated phrase. For instance, b\u00edba 'plant' \u2192 b\u00edba biba 'plant carelessly, here and there', bibil\u00e9 'planted (yesterday)' \u2192 bibile bib\u00edl\u00e9 'planted (yesterday) carelessly, here and there'. Finally, in KiHehe (Odden and Odden, 1985) , if an H tone appears in the first syllable of the verb, the H tone will also be present in the first syllable of the second copy, for example d\u00f3ongoleesa 'roll' \u2192 dongolesa d\u00f3ongoleesa 'roll a bit'.", | |
| "cite_spans": [ | |
| { | |
| "start": 139, | |
| "end": 153, | |
| "text": "(Kaplan, 2006)", | |
| "ref_id": "BIBREF18" | |
| }, | |
| { | |
| "start": 503, | |
| "end": 516, | |
| "text": "(Odden, 1996)", | |
| "ref_id": "BIBREF25" | |
| }, | |
| { | |
| "start": 1047, | |
| "end": 1070, | |
| "text": "(Odden and Odden, 1985)", | |
| "ref_id": "BIBREF26" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Beyond Shupamem", | |
| "sec_num": "8" | |
| }, | |
| { | |
| "text": "The above discussed examples can be modelled in a similar to Shupamem way, such that, first, the input will be output on two tapes: Tonal and Segmental, then some (morpho-)phonological processes will apply on both level. The final step is the 'linearization', which will be independent of the case. For example, in Kikerewe, if the first tone that is read on the Tonal tape is H, and a vowel is read on the Segmental tape, the output will be a vowel with an acute accent. If the second tone is L, as in b\u00edba, this L tone will be 'attached' to every remaining vowel in the reduplicated phrase. While Kikerewe provides an example where there are more TBUs than tones, Adhola presents the reverse situation, where there are more tones than TBU (contour tones). Consequently, it is crucial to mark syllable boundaries, such that only when '.' or the right edge marker ( ) is read, the FST will output the 'linearized' element.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Beyond Shupamem", | |
| "sec_num": "8" | |
| }, | |
| { | |
| "text": "In this paper we proposed a deterministic finitestate model of total reduplication in Shupamem. As it is typical for Bantu languages, Shupamem is a tonal language in which phonological processes operating on a segmental level differ from those on suprasegmental (tonal) level. Consequently, Shupamem introduces two challenges for 1-way FSTs: language copying and autosegmental representation. We addressed those challenges by proposing a synthesis of a deterministic 2-way FST, which correctly models total reduplication, and a MT FST, which enables autosegmental representation. Such a machine operates on two tapes (Tonal and Segmental), which faithfully replicate the linguistic analysis of Shupamem reduplication discussed in Markowska (2020) . Finally, the outputs of the 2way 2,2 MT FST is linearized with a separate 2,1 MT FST outputting the desired surface representation of a reduplicated word. The proposed model is based on previously studied finite-state models for reduplication (Dolatian and Heinz, 2020) and tonal processes (Dolatian and Rawski, 2020b,a) .", | |
| "cite_spans": [ | |
| { | |
| "start": 730, | |
| "end": 746, | |
| "text": "Markowska (2020)", | |
| "ref_id": "BIBREF22" | |
| }, | |
| { | |
| "start": 992, | |
| "end": 1018, | |
| "text": "(Dolatian and Heinz, 2020)", | |
| "ref_id": "BIBREF7" | |
| }, | |
| { | |
| "start": 1039, | |
| "end": 1069, | |
| "text": "(Dolatian and Rawski, 2020b,a)", | |
| "ref_id": null | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Conclusion", | |
| "sec_num": "9" | |
| }, | |
| { | |
| "text": "There are some areas of future research that we plan to pursue. First, we have suggested that we can handle reduplication using the composition of 1-way deterministic MT FSTs, dispensing with the need for 2-way automata altogether. Further formal comparison of these two approaches is warranted. More generally, we plan to investigate the closure properties of classes of 2-way MT FSTs. A third line of research is to collect more examples of full reduplication in tonal languages and to in-clude them in the RedTyp database (Dolatian and Heinz, 2019 ) so a broader empirical typology can be studied with respect to the formal properties of these machines.", | |
| "cite_spans": [ | |
| { | |
| "start": 525, | |
| "end": 550, | |
| "text": "(Dolatian and Heinz, 2019", | |
| "ref_id": "BIBREF6" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Conclusion", | |
| "sec_num": "9" | |
| } | |
| ], | |
| "back_matter": [], | |
| "bib_entries": { | |
| "BIBREF0": { | |
| "ref_id": "b0", | |
| "title": "Regular combinators for string transformations", | |
| "authors": [ | |
| { | |
| "first": "Rajeev", | |
| "middle": [], | |
| "last": "Alur", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Adam", | |
| "middle": [], | |
| "last": "Freilich", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Mukund", | |
| "middle": [], | |
| "last": "Raghothaman", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2014, | |
| "venue": "Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14", | |
| "volume": "9", | |
| "issue": "", | |
| "pages": "1--9", | |
| "other_ids": { | |
| "DOI": [ | |
| "10.1145/2603088.2603151" | |
| ] | |
| }, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Rajeev Alur, Adam Freilich, and Mukund Raghothaman. 2014. Regular combinators for string transformations. In Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, pages 9:1-9:10, New York, NY, USA. ACM.", | |
| "links": null | |
| }, | |
| "BIBREF1": { | |
| "ref_id": "b1", | |
| "title": "Streaming transducers for algorithmic verification of single-pass listprocessing programs", | |
| "authors": [ | |
| { | |
| "first": "Rajeev", | |
| "middle": [], | |
| "last": "Alur", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "Pavol\u010dern\u00fd", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2011, | |
| "venue": "Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "599--610", | |
| "other_ids": { | |
| "DOI": [ | |
| "10.1145/1926385.1926454" | |
| ] | |
| }, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Rajeev Alur and Pavol\u010cern\u00fd. 2011. Streaming trans- ducers for algorithmic verification of single-pass list- processing programs. In Proceedings of the 38th An- nual ACM SIGPLAN-SIGACT Symposium on Princi- ples of Programming Languages, POPL '11, page 599-610, New York, NY, USA. Association for Computing Machinery.", | |
| "links": null | |
| }, | |
| "BIBREF2": { | |
| "ref_id": "b2", | |
| "title": "Orthography and identity in", | |
| "authors": [ | |
| { | |
| "first": "Steven", | |
| "middle": [], | |
| "last": "Bird", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2001, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Steven Bird. 2001. Orthography and identity in", | |
| "links": null | |
| }, | |
| "BIBREF4": { | |
| "ref_id": "b4", | |
| "title": "Computational locality in morphological maps. Morphology", | |
| "authors": [ | |
| { | |
| "first": "Jane", | |
| "middle": [], | |
| "last": "Chandlee", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2017, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "1--43", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Jane Chandlee. 2017. Computational locality in mor- phological maps. Morphology, pages 1-43.", | |
| "links": null | |
| }, | |
| "BIBREF5": { | |
| "ref_id": "b5", | |
| "title": "Bounded copying is subsequential: Implications for metathesis and reduplication", | |
| "authors": [ | |
| { | |
| "first": "Jane", | |
| "middle": [], | |
| "last": "Chandlee", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Jeffrey", | |
| "middle": [], | |
| "last": "Heinz", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2012, | |
| "venue": "Proceedings of the Twelfth Meeting of the Special Interest Group on Computational Morphology and Phonology", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "42--51", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Jane Chandlee and Jeffrey Heinz. 2012. Bounded copy- ing is subsequential: Implications for metathesis and reduplication. In Proceedings of the Twelfth Meet- ing of the Special Interest Group on Computational Morphology and Phonology, pages 42-51, Montr\u00e9al, Canada. Association for Computational Linguistics.", | |
| "links": null | |
| }, | |
| "BIBREF6": { | |
| "ref_id": "b6", | |
| "title": "Redtyp: A database of reduplication with computational models", | |
| "authors": [ | |
| { | |
| "first": "Hossep", | |
| "middle": [], | |
| "last": "Dolatian", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Jeffrey", | |
| "middle": [], | |
| "last": "Heinz", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2019, | |
| "venue": "Proceedings of the Society for Computation in Linguistics", | |
| "volume": "2", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Hossep Dolatian and Jeffrey Heinz. 2019. Redtyp: A database of reduplication with computational mod- els. In Proceedings of the Society for Computation in Linguistics, volume 2. Article 3.", | |
| "links": null | |
| }, | |
| "BIBREF7": { | |
| "ref_id": "b7", | |
| "title": "Computing and classifying reduplication with 2-way finitestate transducers", | |
| "authors": [ | |
| { | |
| "first": "Hossep", | |
| "middle": [], | |
| "last": "Dolatian", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Jeffrey", | |
| "middle": [], | |
| "last": "Heinz", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2020, | |
| "venue": "Journal of Language Modelling", | |
| "volume": "8", | |
| "issue": "1", | |
| "pages": "179--250", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Hossep Dolatian and Jeffrey Heinz. 2020. Comput- ing and classifying reduplication with 2-way finite- state transducers. Journal of Language Modelling, 8(1):179-250.", | |
| "links": null | |
| }, | |
| "BIBREF8": { | |
| "ref_id": "b8", | |
| "title": "Computational locality in nonlinear morphophonology", | |
| "authors": [ | |
| { | |
| "first": "Hossep", | |
| "middle": [], | |
| "last": "Dolatian", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Jonathan", | |
| "middle": [], | |
| "last": "Rawski", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2020, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Hossep Dolatian and Jonathan Rawski. 2020a. Com- putational locality in nonlinear morphophonology. Ms., Stony Brook University.", | |
| "links": null | |
| }, | |
| "BIBREF9": { | |
| "ref_id": "b9", | |
| "title": "Multi input strictly local functions for templatic morphology", | |
| "authors": [ | |
| { | |
| "first": "Hossep", | |
| "middle": [], | |
| "last": "Dolatian", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Jonathan", | |
| "middle": [], | |
| "last": "Rawski", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2020, | |
| "venue": "Proceedings of the Society for Computation in Linguistics", | |
| "volume": "3", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Hossep Dolatian and Jonathan Rawski. 2020b. Multi input strictly local functions for templatic morphol- ogy. In In Proceedings of the Society for Computa- tion in Linguistics, volume 3.", | |
| "links": null | |
| }, | |
| "BIBREF10": { | |
| "ref_id": "b10", | |
| "title": "Enthologue: Languages of the World", | |
| "authors": [ | |
| { | |
| "first": "David", | |
| "middle": [ | |
| "M" | |
| ], | |
| "last": "Eberhard", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Gary", | |
| "middle": [ | |
| "F" | |
| ], | |
| "last": "Simmons", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Charles", | |
| "middle": [ | |
| "D" | |
| ], | |
| "last": "Fenning", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2021, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "SIL Interna-- tional", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "David M. Eberhard, Gary F. Simmons, and Charles D. Fenning. 2021. Enthologue: Languages of the World. 24th edition. Dallas, Texas: SIL Interna- tional.", | |
| "links": null | |
| }, | |
| "BIBREF11": { | |
| "ref_id": "b11", | |
| "title": "Transducers, logic and algebra for functions of finite words", | |
| "authors": [ | |
| { | |
| "first": "Emmanuel", | |
| "middle": [], | |
| "last": "Filiot", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Pierre-Alain", | |
| "middle": [], | |
| "last": "Reynier", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2016, | |
| "venue": "ACM SIGLOG News", | |
| "volume": "3", | |
| "issue": "3", | |
| "pages": "4--19", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Emmanuel Filiot and Pierre-Alain Reynier. 2016. Transducers, logic and algebra for functions of finite words. ACM SIGLOG News, 3(3):4-19.", | |
| "links": null | |
| }, | |
| "BIBREF12": { | |
| "ref_id": "b12", | |
| "title": "Multi-tape and infinite-state automata-a survey", | |
| "authors": [ | |
| { | |
| "first": "Patric", | |
| "middle": [ | |
| "C" | |
| ], | |
| "last": "Fischer", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1965, | |
| "venue": "Communications of the ACM", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "799--805", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Patric C. Fischer. 1965. Multi-tape and infinite-state automata-a survey. Communications of the ACM, pages 799-805.", | |
| "links": null | |
| }, | |
| "BIBREF13": { | |
| "ref_id": "b13", | |
| "title": "Autosegmental Phonology", | |
| "authors": [ | |
| { | |
| "first": "John", | |
| "middle": [], | |
| "last": "Goldsmith", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1976, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "John Goldsmith. 1976. Autosegmental Phonology. Ph.D. thesis, Massachusetts Institute of Technology.", | |
| "links": null | |
| }, | |
| "BIBREF14": { | |
| "ref_id": "b14", | |
| "title": "Magead: A morphological analyzer for Arabic and its dialects", | |
| "authors": [ | |
| { | |
| "first": "Nizar", | |
| "middle": [], | |
| "last": "Habash", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Owen", | |
| "middle": [], | |
| "last": "Rambow", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2006, | |
| "venue": "Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics (Coling-ACL'06)", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Nizar Habash and Owen Rambow. 2006. Magead: A morphological analyzer for Arabic and its dialects. In Proceedings of the 21st International Confer- ence on Computational Linguistics and 44th Annual Meeting of the Association for Computational Lin- guistics (Coling-ACL'06), Sydney, Australia.", | |
| "links": null | |
| }, | |
| "BIBREF15": { | |
| "ref_id": "b15", | |
| "title": "The computational nature of phonological generalizations", | |
| "authors": [ | |
| { | |
| "first": "Jeffrey", | |
| "middle": [], | |
| "last": "Heinz", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2018, | |
| "venue": "Phonological Typology, Phonetics and Phonology", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "126--195", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Jeffrey Heinz. 2018. The computational nature of phonological generalizations. In Larry Hyman and Frans Plank, editors, Phonological Typology, Pho- netics and Phonology, chapter 5, pages 126-195. De Gruyter Mouton.", | |
| "links": null | |
| }, | |
| "BIBREF16": { | |
| "ref_id": "b16", | |
| "title": "How autosegmental is phonology? The Linguistic Review", | |
| "authors": [ | |
| { | |
| "first": "Larry", | |
| "middle": [], | |
| "last": "Hyman", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2014, | |
| "venue": "", | |
| "volume": "31", | |
| "issue": "", | |
| "pages": "363--400", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Larry Hyman. 2014. How autosegmental is phonol- ogy? The Linguistic Review, 31(2):363-400.", | |
| "links": null | |
| }, | |
| "BIBREF17": { | |
| "ref_id": "b17", | |
| "title": "Computationally, tone is different", | |
| "authors": [ | |
| { | |
| "first": "Adam", | |
| "middle": [], | |
| "last": "Jardine", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2016, | |
| "venue": "Phonology", | |
| "volume": "33", | |
| "issue": "", | |
| "pages": "247--283", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Adam Jardine. 2016. Computationally, tone is differ- ent. Phonology, 33:247-283.", | |
| "links": null | |
| }, | |
| "BIBREF18": { | |
| "ref_id": "b18", | |
| "title": "Tonal and morphological identity in reduplication", | |
| "authors": [ | |
| { | |
| "first": "F", | |
| "middle": [], | |
| "last": "Aaron", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "Kaplan", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2006, | |
| "venue": "Proceedings of the Annual Meeting of the Berkeley Linguistics Society", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Aaron F. Kaplan. 2006. Tonal and morphological iden- tity in reduplication. In Proceedings of the An- nual Meeting of the Berkeley Linguistics Society, vol- ume 31.", | |
| "links": null | |
| }, | |
| "BIBREF19": { | |
| "ref_id": "b19", | |
| "title": "Multi-tiered nonlinear morphology using multi-tape finite automata: A case study on Syriac and Arabic", | |
| "authors": [ | |
| { | |
| "first": "Kiraz", | |
| "middle": [], | |
| "last": "George Anton", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2000, | |
| "venue": "Computational Linguistics", | |
| "volume": "26", | |
| "issue": "1", | |
| "pages": "77--105", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "George Anton Kiraz. 2000. Multi-tiered nonlinear mor- phology using multi-tape finite automata: A case study on Syriac and Arabic. Computational Linguis- tics, 26(1):77-105.", | |
| "links": null | |
| }, | |
| "BIBREF20": { | |
| "ref_id": "b20", | |
| "title": "Suprasegmental Phonology", | |
| "authors": [ | |
| { | |
| "first": "William", | |
| "middle": [ | |
| "R" | |
| ], | |
| "last": "Leben", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1973, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "William R. Leben. 1973. Suprasegmental Phonology. Ph.D. thesis, Massachusetts Institute of Technology.", | |
| "links": null | |
| }, | |
| "BIBREF21": { | |
| "ref_id": "b21", | |
| "title": "Tones in Shuapmem possessives", | |
| "authors": [ | |
| { | |
| "first": "Magdalena", | |
| "middle": [], | |
| "last": "Markowska", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2019, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Magdalena Markowska. 2019. Tones in Shuapmem possessives. Ms., Graduate Center, City University of New York.", | |
| "links": null | |
| }, | |
| "BIBREF22": { | |
| "ref_id": "b22", | |
| "title": "Tones in Shupamem reduplication", | |
| "authors": [ | |
| { | |
| "first": "Magdalena", | |
| "middle": [], | |
| "last": "Markowska", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2020, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Magdalena Markowska. 2020. Tones in Shupamem reduplication. CUNY Academic Works.", | |
| "links": null | |
| }, | |
| "BIBREF23": { | |
| "ref_id": "b23", | |
| "title": "A prosodic theory of nonconcatenative morphology", | |
| "authors": [ | |
| { | |
| "first": "John", | |
| "middle": [], | |
| "last": "Mccarthy", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1981, | |
| "venue": "Linguistic Inquiry", | |
| "volume": "12", | |
| "issue": "", | |
| "pages": "373--418", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "John McCarthy. 1981. A prosodic theory of noncon- catenative morphology. Linguistic Inquiry, 12:373- 418.", | |
| "links": null | |
| }, | |
| "BIBREF24": { | |
| "ref_id": "b24", | |
| "title": "The Grammar of Shupamem", | |
| "authors": [ | |
| { | |
| "first": "L", | |
| "middle": [], | |
| "last": "Abdoulaye", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "Nchare", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2012, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Abdoulaye L. Nchare. 2012. The Grammar of Shu- pamem. Ph.D. thesis, New York University.", | |
| "links": null | |
| }, | |
| "BIBREF25": { | |
| "ref_id": "b25", | |
| "title": "Patterns of reduplication in kikerewe", | |
| "authors": [ | |
| { | |
| "first": "David", | |
| "middle": [], | |
| "last": "Odden", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1996, | |
| "venue": "OSU WPL", | |
| "volume": "48", | |
| "issue": "", | |
| "pages": "111--148", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "David Odden. 1996. Patterns of reduplication in kik- erewe. OSU WPL, 48:111-148.", | |
| "links": null | |
| }, | |
| "BIBREF26": { | |
| "ref_id": "b26", | |
| "title": "Ordered reduplication in KiHehe", | |
| "authors": [ | |
| { | |
| "first": "David", | |
| "middle": [], | |
| "last": "Odden", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Mary", | |
| "middle": [], | |
| "last": "Odden", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1985, | |
| "venue": "Linguistic Inquiry", | |
| "volume": "16", | |
| "issue": "", | |
| "pages": "497--503", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "David Odden and Mary Odden. 1985. Ordered redupli- cation in KiHehe. Linguistic Inquiry, 16:497-503.", | |
| "links": null | |
| }, | |
| "BIBREF27": { | |
| "ref_id": "b27", | |
| "title": "Finite automata and their decision problems", | |
| "authors": [ | |
| { | |
| "first": "O", | |
| "middle": [], | |
| "last": "Michael", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Dana", | |
| "middle": [], | |
| "last": "Rabin", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "Scott", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1959, | |
| "venue": "IBM journal of research and development", | |
| "volume": "3", | |
| "issue": "", | |
| "pages": "114--125", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Michael O Rabin and Dana Scott. 1959. Finite au- tomata and their decision problems. IBM journal of research and development, 3:114-125.", | |
| "links": null | |
| }, | |
| "BIBREF28": { | |
| "ref_id": "b28", | |
| "title": "Multiinput strict local functions for tonal phonology. Proceedings of the Society for Computation in Linguistics", | |
| "authors": [ | |
| { | |
| "first": "Jonathan", | |
| "middle": [], | |
| "last": "Rawski", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Hossep", | |
| "middle": [], | |
| "last": "Dolatian", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2020, | |
| "venue": "", | |
| "volume": "3", | |
| "issue": "", | |
| "pages": "245--260", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Jonathan Rawski and Hossep Dolatian. 2020. Multi- input strict local functions for tonal phonology. Pro- ceedings of the Society for Computation in Linguis- tics, 3(1):245-260.", | |
| "links": null | |
| }, | |
| "BIBREF29": { | |
| "ref_id": "b29", | |
| "title": "Computational Approaches to Morphology and Syntax", | |
| "authors": [ | |
| { | |
| "first": "Brian", | |
| "middle": [], | |
| "last": "Roark", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "Richard", | |
| "middle": [], | |
| "last": "Sproat", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2007, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Brian Roark and Richard Sproat. 2007. Computational Approaches to Morphology and Syntax. Oxford Uni- versity Press, Oxford.", | |
| "links": null | |
| }, | |
| "BIBREF30": { | |
| "ref_id": "b30", | |
| "title": "Reduplication. Max Planck Institute for Evolutionary Anthropology", | |
| "authors": [ | |
| { | |
| "first": "Carl", | |
| "middle": [], | |
| "last": "Rubino", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 2013, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Carl Rubino. 2013. Reduplication. Max Planck Insti- tute for Evolutionary Anthropology, Leipzig.", | |
| "links": null | |
| }, | |
| "BIBREF31": { | |
| "ref_id": "b31", | |
| "title": "Modelling autosegmental phonology with multi-tape finite state transducers", | |
| "authors": [ | |
| { | |
| "first": "Bruce", | |
| "middle": [], | |
| "last": "Wiebe", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1992, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Bruce Wiebe. 1992. Modelling autosegmental phonol- ogy with multi-tape finite state transducers.", | |
| "links": null | |
| }, | |
| "BIBREF32": { | |
| "ref_id": "b32", | |
| "title": "Underlying tone in Margi and Igbo", | |
| "authors": [ | |
| { | |
| "first": "Edwin", | |
| "middle": [ | |
| "S" | |
| ], | |
| "last": "Williams", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1976, | |
| "venue": "Linguistic Inquiry", | |
| "volume": "7", | |
| "issue": "", | |
| "pages": "463--484", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Edwin S. Williams. 1976. Underlying tone in Margi and Igbo. Linguistic Inquiry, 7:463-484.", | |
| "links": null | |
| } | |
| }, | |
| "ref_entries": { | |
| "FIGREF0": { | |
| "num": null, | |
| "text": "MT-FST: linearize C and V are notational meta-symbols for consonants and vowels, resp.; T indicates the tone tape, S, the segmental tape, and O the output tape. cesses described in Section 2.", | |
| "type_str": "figure", | |
| "uris": null | |
| }, | |
| "FIGREF1": { | |
| "num": null, | |
| "text": "Synthesis of 2-way FST and MT-FST", | |
| "type_str": "figure", | |
| "uris": null | |
| }, | |
| "FIGREF2": { | |
| "num": null, | |
| "text": "MT-FST: split nd\u00e1p \u2192 (ndap, H) 'house', C and V are notational meta-symbols for consonants and vowels, resp.; T indicates the output tone tape, S -the segmental output tape, and I -the input.", | |
| "type_str": "figure", | |
| "uris": null | |
| }, | |
| "FIGREF3": { | |
| "num": null, | |
| "text": "An alternative model for Shupamem reduplication", | |
| "type_str": "figure", | |
| "uris": null | |
| }, | |
| "TABREF1": { | |
| "num": null, | |
| "html": null, | |
| "content": "<table><tr><td colspan=\"2\">: Nominal and verbal reduplication in Shu-</td></tr><tr><td>pamem</td><td/></tr><tr><td colspan=\"2\">the purpose of this paper, we provide only a sum-</td></tr><tr><td colspan=\"2\">mary of those tonal alternations in Table 2.</td></tr><tr><td colspan=\"2\">Red. tones Output</td></tr><tr><td>Nouns HL L</td><td>HL H</td></tr><tr><td>LH L</td><td>LH H</td></tr><tr><td>Verbs H\u0164H</td><td>H\u0164H</td></tr><tr><td>LH\u0164H</td><td>HL LH</td></tr></table>", | |
| "type_str": "table", | |
| "text": "" | |
| }, | |
| "TABREF2": { | |
| "num": null, | |
| "html": null, | |
| "content": "<table><tr><td>: Tonal alternations: interaction of tones for</td></tr><tr><td>reduplicated forms (\"Red. tones\") with grammatical H</td></tr><tr><td>tones</td></tr></table>", | |
| "type_str": "table", | |
| "text": "" | |
| }, | |
| "TABREF3": { | |
| "num": null, | |
| "html": null, | |
| "content": "<table/>", | |
| "type_str": "table", | |
| "text": "Representation of MT-FST for m\u00e0p\u00e0m 'coat'" | |
| }, | |
| "TABREF5": { | |
| "num": null, | |
| "html": null, | |
| "content": "<table/>", | |
| "type_str": "table", | |
| "text": "Derivation of nd\u00e1p \u2192 nd\u00e2p ndap 'houses'" | |
| } | |
| } | |
| } | |
| } |