Jason Riggle
Biographic Data
| ID | 1610186 |
|---|---|
| NAME | Jason Riggle |
| GIVEN NAMES | Jason |
| FAMILY NAME | Riggle |
| SIGNATURE | RIGGLE J |
| AFFILIATIONS | University of Chicago |
| VERIFIED | No |
| TOTAL WORKS | 11 |
| TOTAL CITATIONS | 24 |
| AUTHOR COUNT | 10 |
| EDITOR COUNT | 1 |
| FIRST PUBLICATION YEAR | 2006 |
| LATEST PUBLICATION YEAR | 2016 |
| H-INDEX | 3 |
OT grammars, beyond partial orders: ERC sets and antimatroids
Productivity and Lexicalization in Pima Compounds
Productivity and Lexicalization in Pima Compounds
Information theoretic approaches to phonological structure: The case of Finnish vowel harmony
Consequences of Candidate Omission
In this squib, we explore the generative consequences of candidate omission for constraint-based grammars. In principle, the candidate set for an input form i is the range of Gen(i) for a given generating function Gen (see Prince and Smolensky 1993:17). In practice, however, analyses often cover just a few candidates that are deemed relevant. The consequences of this practice are the focus of this squib.Whether the omission is by oversight or by …
The Handbook of Phonological Theory
The Syllable
This chapter provides an overview of the syllable, a fundamental unit in the organization of speech sounds. It discusses the syllable's internal structure, including the onset, nucleus, and coda, and explores the various phonotactic constraints that govern the permissible combinations of sounds within a syllable. The chapter also examines the role of the syllable in stress assignment, prosodic phrasing, and other phonological processes. It consid…
The VC dimension of constraint-based grammars
The Complexity of Ranking Hypotheses in Optimality Theory
Given a constraint set with k constraints in the framework of Optimality Theory (OT), what is its capacity as a classification scheme for linguistic data? One useful measure of this capacity is the size of the largest data set of which each subset is consistent with a different grammar hypothesis. This measure is known as the Vapnik-Chervonenkis dimension (VCD) and is a standard complexity measure for concept classes in computational learnability…
Evaluating the Complexity of Optimality Theory
Idsardi (2006) claims that Optimality Theory (OT; Prince and Smolensky 1993, 2004) is "in general computationally intractable" on the basis of a proof adapted from Eisner 1997a. We take issue with this conclusion on two grounds. First, the intractability result holds only in cases where the constraint set is not fixed in advance (contra usual definitions of OT), and second, the result crucially depends on a particular representation of OT grammar…
Infixing reduplication in Pima and its theoretical consequences
Information theoretic approaches to phonological structure: The case of Finnish vowel harmony
Infixing reduplication in Pima and its theoretical consequences
The Complexity of Ranking Hypotheses in Optimality Theory
Given a constraint set with k constraints in the framework of Optimality Theory (OT), what is its capacity as a classification scheme for linguistic data? One useful measure of this capacity is the size of the largest data set of which each subset is consistent with a different grammar hypothesis. This measure is known as the Vapnik-Chervonenkis dimension (VCD) and is a standard complexity measure for concept classes in computational learnability…
The VC dimension of constraint-based grammars
Evaluating the Complexity of Optimality Theory
Idsardi (2006) claims that Optimality Theory (OT; Prince and Smolensky 1993, 2004) is "in general computationally intractable" on the basis of a proof adapted from Eisner 1997a. We take issue with this conclusion on two grounds. First, the intractability result holds only in cases where the constraint set is not fixed in advance (contra usual definitions of OT), and second, the result crucially depends on a particular representation of OT grammar…
The Syllable
This chapter provides an overview of the syllable, a fundamental unit in the organization of speech sounds. It discusses the syllable's internal structure, including the onset, nucleus, and coda, and explores the various phonotactic constraints that govern the permissible combinations of sounds within a syllable. The chapter also examines the role of the syllable in stress assignment, prosodic phrasing, and other phonological processes. It consid…
Infixing reduplication in Pima and its theoretical consequences
The Complexity of Ranking Hypotheses in Optimality Theory
Given a constraint set with k constraints in the framework of Optimality Theory (OT), what is its capacity as a classification scheme for linguistic data? One useful measure of this capacity is the size of the largest data set of which each subset is consistent with a different grammar hypothesis. This measure is known as the Vapnik-Chervonenkis dimension (VCD) and is a standard complexity measure for concept classes in computational learnability…
Evaluating the Complexity of Optimality Theory
Idsardi (2006) claims that Optimality Theory (OT; Prince and Smolensky 1993, 2004) is "in general computationally intractable" on the basis of a proof adapted from Eisner 1997a. We take issue with this conclusion on two grounds. First, the intractability result holds only in cases where the constraint set is not fixed in advance (contra usual definitions of OT), and second, the result crucially depends on a particular representation of OT grammar…
The VC dimension of constraint-based grammars
The Handbook of Phonological Theory
The Syllable
This chapter provides an overview of the syllable, a fundamental unit in the organization of speech sounds. It discusses the syllable's internal structure, including the onset, nucleus, and coda, and explores the various phonotactic constraints that govern the permissible combinations of sounds within a syllable. The chapter also examines the role of the syllable in stress assignment, prosodic phrasing, and other phonological processes. It consid…
Information theoretic approaches to phonological structure: The case of Finnish vowel harmony
Consequences of Candidate Omission
In this squib, we explore the generative consequences of candidate omission for constraint-based grammars. In principle, the candidate set for an input form i is the range of Gen(i) for a given generating function Gen (see Prince and Smolensky 1993:17). In practice, however, analyses often cover just a few candidates that are deemed relevant. The consequences of this practice are the focus of this squib.Whether the omission is by oversight or by …
Productivity and Lexicalization in Pima Compounds
Productivity and Lexicalization in Pima Compounds
OT grammars, beyond partial orders: ERC sets and antimatroids
Computer Science (9 works) · Artificial Intelligence (7 works) · Linguistics (6 works) · Mathematics (6 works) · Philosophy (6 works) · Natural Language Processing Techniques (5 works) · Optimality theory (5 works) · Phonetics and Phonology Research (5 works) · semigroups and automata theory (5 works) · Natural language processing (4 works)