Recognizing 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-free, while other phonological and morphological patterns are regular, or even sub-regular. Thus, existing language classes characterizing reduplicated strings inevitably include typologically unattested context-free patterns, such as reversals. This paper extends regular languages to incorporate reduplication by introducing a new computational device: finite state buffered machine (FSBMs). We give its mathematical definitions and discuss some closure properties of the corresponding set of languages. As a result, the class of regular languages and languages derived from them through a copying mechanism is characterized. Suggested by previous literature, this class of languages should approach the characterization of natural language word sets.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
A 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…
Gradients and Subgradients of Buffered Failure Probability
Gradients and subgradients are central to optimization and sensitivity analysis of buffered failure probabilities. We furnish a characterization of subgradients based on subdifferential calculus in the case of finite pro…
SensitivityStochastic Gradient MCMC for Nonlinear State Space Models
State space models (SSMs) provide a flexible framework for modeling complex time series via a latent stochastic process. Inference for nonlinear, non-Gaussian SSMs is often tackled with particle methods that do not scale…
Bayesian InferenceState Space ModelsTime SeriesTime Series AnalysisIdentity-Based Patterns in Deep Convolutional Networks: Generative Adversarial Phonology and Reduplication
This paper models unsupervised learning of an identity-based pattern (or copying) in speech called reduplication from raw continuous data with deep convolutional neural networks. We use the ciwGAN architecture Begu\v{s} …
Asynchronous Federated Learning with Bidirectional Quantized Communications and Buffered Aggregation
Asynchronous Federated Learning with Buffered Aggregation (FedBuff) is a state-of-the-art algorithm known for its efficiency and high scalability. However, it has a high communication cost, which has not been examined wi…
Federated LearningQuantization