Jane Chandlee
Dados Biográficos
| ID | 793414 |
|---|---|
| NOME | Jane Chandlee |
| PRENOMES | Jane |
| SOBRENOME | Chandlee |
| ASSINATURA | CHANDLEE J |
| AFILIAÇÕES | Haverford College |
| ORCID | 0000-0001-9143-1305 |
| VERIFICADO | Sim |
| TOTAL DE OBRAS | 11 |
| TOTAL DE CITAÇÕES | 9 |
| TOTAL COMO AUTOR | 11 |
| TOTAL COMO EDITOR | 0 |
| PRIMEIRO ANO DE PUBLICAÇÃO | 2014 |
| ANO MAIS RECENTE DE PUBLICAÇÃO | 2023 |
| ÍNDICE H | 2 |
Decision trees, entropy, and the contrastive feature hierarchy
Dresher (2009) argues that language-particular hierarchies of features are the best way to identify contrastive features in a phonological inventory. While not universal, this ordering of features is also not fully unconstrained. But what limits the space of possible feature orders remains an open question. This paper demonstrates how the concept of entropy establishes a partial ordering of features that both allows for but also constrains langua…
Less is more
Long-distance phonological processes as tier-based strictly local functions
Whether we analyze phonological processes using a system of rules or constraints, the resulting map from underlying representations to surface pronunciations can be characterized as a function. Viewing processes as mathematical objects in this way allows us to study properties of phonology that hold no matter how it is implemented. Work in this vein has found that a majority of phonological processes only consider information within a finite wind…
Input and output locality and representation
Using a rigorous, computational notion of locality, this paper evaluates one of the central motivations for autosegmental representations (ARs)—that they reduce long-distance processes to local ones. We analyze a variety of tone processes using two computational notions of locality: input strict locality as defined by Chandlee (2014) and Chandlee & Jardine (2019a) and a corresponding notion of output strict locality we call recursive strict local…
Computational universals in linguistic theory
This article presents BOOLEAN MONADIC RECURSIVE SCHEMES (BMRSs), adapted from the mathematical study of computation, as a phonological theory that both explains the observed computational properties of phonological patterns and directly captures phonological substance and linguistically significant generalizations. BMRSs consist of structures defined as logical predicates and situated in an ‘if ... then ... else’ syntax in such a way that they va…
A Computational Account of Tone Sandhi Interaction
This paper presents a computational account of three tone sandhi rules in Tianjin Chinese that have received a lot of attention in the literature due to the seemingly complex way in which they interact. Two of the rules apply right-to-left while the third applies left-to-right, making it difficult for both rule- and constraint-based formalisms to account for the interaction in a unified way. In the computational framework advocated for in this pa…
Input Strictly Local opaque maps
This paper gives a computational characterisation of opaque interactions in phonology. Specifically, a range of opaque interactions are shown to be Input Strictly Local (ISL) maps (Chandlee 2014), which are string-to-string functions that determine output based only on contiguous sequences of input symbols. Examples from Baković’s (2007) extended typology of counterfeeding, counterbleeding, self-destructive feeding, non-gratuitous feeding and cro…
Strict Locality and Phonological Maps
In this article, we identify Strict Locality as a strong computational property of a certain class of phonological maps from underlying to surface forms. We show that these maps can be modeled with Input Strictly Local functions, a previously undefined class of subregular relations. These functions extend the conception of locality from the Strictly Local formal languages (recognizers/acceptors) ( McNaughton and Papert 1971 , Rogers and Pullum 20…
Computational locality in morphological maps
Learning Repairs for Marked Structures
[Abstract not available]
Learning Phonological Mappings by Learning Strictly Local Functions
In this paper we identify strict locality as a defining computational property of the input-output mapping that underlies local phonological processes. We provide an automata-theoretic characterization for the class of Strictly Local functions, which are based on the well-studied Strictly Local formal languages (McNaughton & Papert 1971; Rogers & Pullum 2011; Rogers et al. 2013), and show how they can model a range of phonological processes. We t…
Strict Locality and Phonological Maps
In this article, we identify Strict Locality as a strong computational property of a certain class of phonological maps from underlying to surface forms. We show that these maps can be modeled with Input Strictly Local functions, a previously undefined class of subregular relations. These functions extend the conception of locality from the Strictly Local formal languages (recognizers/acceptors) ( McNaughton and Papert 1971 , Rogers and Pullum 20…
Computational locality in morphological maps
Computational universals in linguistic theory
This article presents BOOLEAN MONADIC RECURSIVE SCHEMES (BMRSs), adapted from the mathematical study of computation, as a phonological theory that both explains the observed computational properties of phonological patterns and directly captures phonological substance and linguistically significant generalizations. BMRSs consist of structures defined as logical predicates and situated in an ‘if ... then ... else’ syntax in such a way that they va…
Learning Phonological Mappings by Learning Strictly Local Functions
In this paper we identify strict locality as a defining computational property of the input-output mapping that underlies local phonological processes. We provide an automata-theoretic characterization for the class of Strictly Local functions, which are based on the well-studied Strictly Local formal languages (McNaughton & Papert 1971; Rogers & Pullum 2011; Rogers et al. 2013), and show how they can model a range of phonological processes. We t…
Learning Repairs for Marked Structures
[Abstract not available]
Computational locality in morphological maps
Input Strictly Local opaque maps
This paper gives a computational characterisation of opaque interactions in phonology. Specifically, a range of opaque interactions are shown to be Input Strictly Local (ISL) maps (Chandlee 2014), which are string-to-string functions that determine output based only on contiguous sequences of input symbols. Examples from Baković’s (2007) extended typology of counterfeeding, counterbleeding, self-destructive feeding, non-gratuitous feeding and cro…
Strict Locality and Phonological Maps
In this article, we identify Strict Locality as a strong computational property of a certain class of phonological maps from underlying to surface forms. We show that these maps can be modeled with Input Strictly Local functions, a previously undefined class of subregular relations. These functions extend the conception of locality from the Strictly Local formal languages (recognizers/acceptors) ( McNaughton and Papert 1971 , Rogers and Pullum 20…
A Computational Account of Tone Sandhi Interaction
This paper presents a computational account of three tone sandhi rules in Tianjin Chinese that have received a lot of attention in the literature due to the seemingly complex way in which they interact. Two of the rules apply right-to-left while the third applies left-to-right, making it difficult for both rule- and constraint-based formalisms to account for the interaction in a unified way. In the computational framework advocated for in this pa…
Long-distance phonological processes as tier-based strictly local functions
Whether we analyze phonological processes using a system of rules or constraints, the resulting map from underlying representations to surface pronunciations can be characterized as a function. Viewing processes as mathematical objects in this way allows us to study properties of phonology that hold no matter how it is implemented. Work in this vein has found that a majority of phonological processes only consider information within a finite wind…
Input and output locality and representation
Using a rigorous, computational notion of locality, this paper evaluates one of the central motivations for autosegmental representations (ARs)—that they reduce long-distance processes to local ones. We analyze a variety of tone processes using two computational notions of locality: input strict locality as defined by Chandlee (2014) and Chandlee & Jardine (2019a) and a corresponding notion of output strict locality we call recursive strict local…
Computational universals in linguistic theory
This article presents BOOLEAN MONADIC RECURSIVE SCHEMES (BMRSs), adapted from the mathematical study of computation, as a phonological theory that both explains the observed computational properties of phonological patterns and directly captures phonological substance and linguistically significant generalizations. BMRSs consist of structures defined as logical predicates and situated in an ‘if ... then ... else’ syntax in such a way that they va…
Less is more
Decision trees, entropy, and the contrastive feature hierarchy
Dresher (2009) argues that language-particular hierarchies of features are the best way to identify contrastive features in a phonological inventory. While not universal, this ordering of features is also not fully unconstrained. But what limits the space of possible feature orders remains an open question. This paper demonstrates how the concept of entropy establishes a partial ordering of features that both allows for but also constrains langua…
Computer Science (10 obras) · Linguistics (9 obras) · Natural Language Processing Techniques (9 obras) · Artificial Intelligence (7 obras) · Mathematics (7 obras) · Phonetics and Phonology Research (6 obras) · Locality (5 obras) · Phonology (5 obras) · Algorithm (4 obras) · Speech and dialogue systems (4 obras)