Adam Jardine
Biographic Data
| ID | 793415 |
|---|---|
| NAME | Adam Jardine |
| GIVEN NAMES | Adam |
| FAMILY NAME | Jardine |
| SIGNATURE | JARDINE A |
| AFFILIATIONS | Rutgers Sexual and Reproductive Health and Rights |
| ORCID | 0000-0001-9436-8014 |
| VERIFIED | Yes |
| TOTAL WORKS | 15 |
| TOTAL CITATIONS | 13 |
| AUTHOR COUNT | 15 |
| EDITOR COUNT | 0 |
| FIRST PUBLICATION YEAR | 2014 |
| LATEST PUBLICATION YEAR | 2023 |
| H-INDEX | 1 |
Computing Process-Specific Constraints
This squib demonstrates how process-specific constraints—in which related but distinct processes in a language can be subject to differing conditions—can be captured with Boolean monadic recursive schemes (BMRSs), a computational formalism for phonological analysis based in mathematical logic. We use the case study of pharyngeal harmony in Palestinian Arabic, which motivated a discussion between Davis (1995) and McCarthy (1997) about the relative…
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…
A Formal Investigation of Q-Theory in Comparison to Autosegmental Representations
We use model theory to rigorously evaluate Q-Theory as proposed in Shih and Inkelas 2019 as an alternative to Autosegmental Phonology. We find that Q-Theory is remarkably similar to Autosegmental Phonology, contra some of Shih and Inkelas's claims. In particular, Q-Theory does not eschew the association relation, in Q-Theory the tone-bearing unit is the vowel, and Q-Theory and Autosegmental Phonology are equivalent in terms of the constraints the…
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…
Representation and the Computation of Long Distance Tone Processes
This paper shows how enhancing the representation, while fixing the logical power of computation, provides a better characterization of the computationally complex tone processes, the unbounded circumembient (UC) processes noted in Jardine (2016). Using Autosegmental Representations, we define tone-TBU associations as quantifier-free least fixed point transductions, which allow us to extend the notion of subsequentiality to the otherwise non subs…
The computational nature of stress assignment
While computational studies of stress patterns as phonotactics have yielded restrictive characterizations of stress (Rogers et al., 2013) with provably correct learning procedures (Heinz, 2009), an outstanding question is the nature of stress assignment as a function which assigns stress to an underlying bare string of syllables. This paper fills this gap by locating stress patterns with respect to the subsequential class of functions (Mohri, 199…
Melody learning and long-distance phonotactics in tone
Computation also matters
This article responds to Pater (2018) by arguing for a view of phonology that captures the computational properties of phonological processes. Jardine's (2016) statement that tone is formally more complex than segmental phonology is not a claim, as Pater characterises it, but an empirical observation. This article outlines how phonological theories can incorporate such observations, and integrate them with considerations of phonological substance…
Tone Association and Output Locality in Non-Linear Structures
This paper offers a computational characterization of tone-to-TBU association processes using a restricted least-fixed point logic. Crucially, least fixed point logics allow recursive definitions which capture output-oriented processes. The added requirement that these definitions are quantifier-free ensures that they are inherently local, a restriction that is well-motivated for phonological processes in general. The typology developed here dist…
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…
The local nature of tone-association patterns
A computational notion of locality, based on forbidden substructures of a fixed size, is applied to autosegmental representations, and tone-association patterns are argued to be local. This is significant for phonological theory, for two reasons. First, this notion of locality provides for an explicit theory of tonal well-formedness that is superior to previous explanations in that it makes clear, restrictive typological predictions. Second, it p…
Learning Repairs for Marked Structures
[Abstract not available]
Computationally, tone is different
This paper establishes that unbounded circumambient processes, phonological processes for which crucial information in the environment may appear unboundedly far away on both sides of a target, are common in tonal phonology, but rare in segmental phonology. It then argues that this typological asymmetry is best characterised by positing that tone is more computationally complex than segmental phonology. The evidence for the asymmetry is based aro…
Logic and the Generative Power of Autosegmental Phonology
Autosegmental Phonology is studied in the framework of Formal Language Theory, which classifies the computational complexity of patterns. In contrast to previous computational studies of Autosegmental Phonology, which were mainly concerned with finite-state implementations of the formalism, a methodology for a model-theoretic study of autosegmental diagrams with monadic second-order logic is introduced. Monadic second order logic provides a mathe…
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…
Computationally, tone is different
This paper establishes that unbounded circumambient processes, phonological processes for which crucial information in the environment may appear unboundedly far away on both sides of a target, are common in tonal phonology, but rare in segmental phonology. It then argues that this typological asymmetry is best characterised by positing that tone is more computationally complex than segmental phonology. The evidence for the asymmetry is based aro…
A Formal Investigation of Q-Theory in Comparison to Autosegmental Representations
We use model theory to rigorously evaluate Q-Theory as proposed in Shih and Inkelas 2019 as an alternative to Autosegmental Phonology. We find that Q-Theory is remarkably similar to Autosegmental Phonology, contra some of Shih and Inkelas's claims. In particular, Q-Theory does not eschew the association relation, in Q-Theory the tone-bearing unit is the vowel, and Q-Theory and Autosegmental Phonology are equivalent in terms of the constraints the…
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…
Melody learning and long-distance phonotactics in tone
Logic and the Generative Power of Autosegmental Phonology
Autosegmental Phonology is studied in the framework of Formal Language Theory, which classifies the computational complexity of patterns. In contrast to previous computational studies of Autosegmental Phonology, which were mainly concerned with finite-state implementations of the formalism, a methodology for a model-theoretic study of autosegmental diagrams with monadic second-order logic is introduced. Monadic second order logic provides a mathe…
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]
Computationally, tone is different
This paper establishes that unbounded circumambient processes, phonological processes for which crucial information in the environment may appear unboundedly far away on both sides of a target, are common in tonal phonology, but rare in segmental phonology. It then argues that this typological asymmetry is best characterised by positing that tone is more computationally complex than segmental phonology. The evidence for the asymmetry is based aro…
The local nature of tone-association patterns
A computational notion of locality, based on forbidden substructures of a fixed size, is applied to autosegmental representations, and tone-association patterns are argued to be local. This is significant for phonological theory, for two reasons. First, this notion of locality provides for an explicit theory of tonal well-formedness that is superior to previous explanations in that it makes clear, restrictive typological predictions. Second, it p…
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…
Computation also matters
This article responds to Pater (2018) by arguing for a view of phonology that captures the computational properties of phonological processes. Jardine's (2016) statement that tone is formally more complex than segmental phonology is not a claim, as Pater characterises it, but an empirical observation. This article outlines how phonological theories can incorporate such observations, and integrate them with considerations of phonological substance…
Tone Association and Output Locality in Non-Linear Structures
This paper offers a computational characterization of tone-to-TBU association processes using a restricted least-fixed point logic. Crucially, least fixed point logics allow recursive definitions which capture output-oriented processes. The added requirement that these definitions are quantifier-free ensures that they are inherently local, a restriction that is well-motivated for phonological processes in general. The typology developed here dist…
Representation and the Computation of Long Distance Tone Processes
This paper shows how enhancing the representation, while fixing the logical power of computation, provides a better characterization of the computationally complex tone processes, the unbounded circumembient (UC) processes noted in Jardine (2016). Using Autosegmental Representations, we define tone-TBU associations as quantifier-free least fixed point transductions, which allow us to extend the notion of subsequentiality to the otherwise non subs…
The computational nature of stress assignment
While computational studies of stress patterns as phonotactics have yielded restrictive characterizations of stress (Rogers et al., 2013) with provably correct learning procedures (Heinz, 2009), an outstanding question is the nature of stress assignment as a function which assigns stress to an underlying bare string of syllables. This paper fills this gap by locating stress patterns with respect to the subsequential class of functions (Mohri, 199…
Melody learning and long-distance phonotactics in tone
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…
A Formal Investigation of Q-Theory in Comparison to Autosegmental Representations
We use model theory to rigorously evaluate Q-Theory as proposed in Shih and Inkelas 2019 as an alternative to Autosegmental Phonology. We find that Q-Theory is remarkably similar to Autosegmental Phonology, contra some of Shih and Inkelas's claims. In particular, Q-Theory does not eschew the association relation, in Q-Theory the tone-bearing unit is the vowel, and Q-Theory and Autosegmental Phonology are equivalent in terms of the constraints the…
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…
Computing Process-Specific Constraints
This squib demonstrates how process-specific constraints—in which related but distinct processes in a language can be subject to differing conditions—can be captured with Boolean monadic recursive schemes (BMRSs), a computational formalism for phonological analysis based in mathematical logic. We use the case study of pharyngeal harmony in Palestinian Arabic, which motivated a discussion between Davis (1995) and McCarthy (1997) about the relative…
Computer Science (12 works) · Linguistics (12 works) · Phonetics and Phonology Research (10 works) · Natural Language Processing Techniques (9 works) · Artificial Intelligence (8 works) · Mathematics (8 works) · Philosophy (7 works) · Phonology (7 works) · Algorithm (5 works) · Speech Recognition and Synthesis (5 works)