The Expressivity of Autosegmental Grammars

Journal of Logic, Language and Information 28 (1):9-54 (2019)
  Copy   BIBTEX

Abstract

This paper extends a notion of local grammars in formal language theory to autosegmental representations, in order to develop a sufficiently expressive yet computationally restrictive theory of well-formedness in natural language tone patterns. More specifically, it shows how to define a class ASL\ of stringsets using local grammars over autosegmental representations and a mapping g from strings to autosegmental structures. It then defines a particular class ASL\ using autosegmental representations specific to tone and compares its expressivity to established formal language grammars that have been successfully applied to other areas of phonology.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,779

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Highly constrained unification grammars.Daniel Feinstein & Shuly Wintner - 2008 - Journal of Logic, Language and Information 17 (3):345-381.
Geometric Representations for Minimalist Grammars.Peter Beim Graben & Sabrina Gerth - 2012 - Journal of Logic, Language and Information 21 (4):393-432.
Tagba Tone: a case of tier hierarchization.Mori Edwige Luo Traoré - 2019 - Corela. Cognition, Représentation, Langage 17.
The “no crossing constraint” in autosegmental phonology.John Coleman & John Local - 1991 - Linguistics and Philosophy 14 (3):295 - 338.
Commutative Lambek Grammars.Tikhon Pshenitsyn - 2023 - Journal of Logic, Language and Information 32 (5):887-936.

Analytics

Added to PP
2018-05-16

Downloads
4 (#1,642,475)

6 months
1 (#1,720,529)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Weak Second‐Order Arithmetic and Finite Automata.J. Richard Büchi - 1960 - Mathematical Logic Quarterly 6 (1-6):66-92.
Aural Pattern Recognition Experiments and the Subregular Hierarchy.James Rogers & Geoffrey K. Pullum - 2011 - Journal of Logic, Language and Information 20 (3):329-342.
Weak Second-Order Arithmetic and Finite Automata.J. Richard Buchi - 1963 - Journal of Symbolic Logic 28 (1):100-102.
Three Models for the Description of Language.N. Chomsky - 1956 - IRE Transactions on Information Theory 2:113-124.
The “no crossing constraint” in autosegmental phonology.John Coleman & John Local - 1991 - Linguistics and Philosophy 14 (3):295 - 338.

View all 6 references / Add more references