Modeling Reduplication with 2-way Finite-State Transducers
This article describes a novel approach to the computational modeling of reduplication. Reduplication is a well-studied linguistic phenomenon. However, it is often treated as a stumbling block within finite-state treatments of morphology. Most finite-state implementations of computational morphology cannot adequately capture the productivity of unbounded copying in reduplication, nor can they adequately capture bounded copying. We show that an understudied type of finite-state machines, two-way finite-state transducers (2-way FSTs), captures virtually all reduplicative processes, including total reduplication. 2-way FSTs can model reduplicative typology in a way which is convenient, easy to design and debug in practice, and linguistically-motivated. By virtue of being finite-state, 2-way FSTs are likewise incorporable into existing finite-state systems and programs. A small but representative typology of reduplicative processes is described in this article, alongside their corresponding 2-way FST models.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Finite-state Model of Shupamem Reduplication
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 finite-state model of its morpho-syntax and morphop…
modelA self-reliant finite automata for reduplication detection
Reduplication is a common phenomenon in almost all human languages. It implies the repetition of the smallest linguistic unit partially (e.g. flip flop) or completely (e.g. bye bye). Symbolically it can be written as WiW…
Learning Transductions and Alignments with RNN Seq2seq Models
The paper studies the capabilities of Recurrent-Neural-Network sequence to sequence (RNN seq2seq) models in learning four transduction tasks: identity, reversal, total reduplication, and quadratic copying. These transduc…
Out-of-Distribution GeneralizationRecognizing Reduplicated Forms: Finite-State Buffered Machines
Total reduplication is common in natural language phonology and morphology. However, formally as copying on reduplicants of unbounded size, unrestricted total reduplication requires computational power beyond context-fre…
Finite-state morphological transducers for three Kypchak languages
This paper describes the development of free/open-source finite-state morphological transducers for three Turkic languages―Kazakh, Tatar, and Kumyk―representing one language from each of the three sub-branches of the Kyp…
Machine Translation