Aleksei Ioulevitch Nazarov
Biographic Data
| ID | 9041416 |
|---|---|
| NAME | Aleksei Ioulevitch Nazarov |
| GIVEN NAMES | Aleksei Ioulevitch |
| FAMILY NAME | Nazarov |
| SIGNATURE | NAZAROV A I |
| AFFILIATIONS | Utrecht University |
| ORCID | 0000-0002-6682-6687 |
| VERIFIED | Yes |
| TOTAL WORKS | 9 |
| TOTAL CITATIONS | 0 |
| WORKS AS AUTHOR | 9 |
| WORKS AS EDITOR | 0 |
| FIRST PUBLICATION YEAR | 2016 |
| LATEST PUBLICATION YEAR | 2023 |
| H-INDEX | 0 |
Modelling opacity and variation in Gran Canarian Spanish apocope
In this paper, we present novel data from Spanish spoken on Gran Canaria which show an interaction of two lenition processes: final consonant deletion and vowel apocope. We show that in certain positions in an utterance, these processes optionally combine in a fed counterfeeding interaction. Furthermore, the variation present in the dialect due to process optionality uncovers a latent opacity pattern, i.e. an additional opaque interaction that is…
Generalizing French Schwa Deletion
Indexed constraints (like cophonologies) increase a grammar’s fit to seen data, but do they hurt the grammar’s ability to generalize to unseen data? We focus on French schwa deletion, an optional process whose rate of application is modulated by both phonological and lexical factors, and we propose three indexed constraint learners in the Maximum Entropy (MaxEnt) framework. Using data from Racine (2008), we test the ability of four learners to ca…
Learning phonetically and phonologically natural classes through constraint indexation
Phonological processes tend to be defined over natural classes (Chomsky & Halle 1968), but there are some arbitrary and language-specific aspects to class behaviour (e.g., Mielke 2004). This paper shows that it is possible to implement a procedure of finding language specific natural classes using contrast detection (Dresher 2014, Sanstedt 2018), but in standard OT with domain-general methods. Three toy languages are constructed, based on those i…
The Credit Problem in parametric stress
In this paper, we introduce a novel domain-general, statistical learning model for P&P grammars: the Expectation Driven Parameter Learner (EDPL). We show that the EDPL provides a mathematically principled solution to the Credit Problem (Dresher 1999). We present the first systematic tests of the EDPL and an existing and closely related model, the Naïve Parameter Learner (NPL), on a full stress typology, the one generated by Dresher & Kaye’s (1990…
Bedouin Arabic multiple opacity with indexed constraints in Parallel OT
Opaque interactions between phonological processes (Kiparsky 1973) can be a significant challenge to Optimality Theoretical accounts of phonology (Idsardi 2000, Bakovic 2011). McCarthy (2007) presents the case of multiple opacity in Bedouin Arabic that seems to require extrinsic process ordering (as provided by OT-CC, McCarthy 2007, and Serial Markedness Reduction, Jarosz 2014). It is a counterexample to the Stratal OT approach: one of the opaque…
Learning within- and between-word variation in probabilistic OT grammars
This paper proposes a novel method of inferring diacritics for representing between-word variation (exceptionality) in Optimality Theoretic (OT) grammars (e.g., Pater 2000, 2010) that makes it possible to infer such diacritics in the face of within-word variation. Existing methods of inferring diacritics in OT (Pater 2010, Becker 2009, Coetzee 2009) are based in categorical grammar learning (Tesar 1995), which makes them unable to handle within-w…
Learning opacity in Stratal Maximum Entropy Grammar
Opaque phonological patterns are sometimes claimed to be difficult to learn; specific hypotheses have been advanced about the relative difficulty of particular kinds of opaque processes (Kiparsky 1971, 1973), and the kind of data that is helpful in learning an opaque pattern (Kiparsky 2000). In this paper, we present a computationally implemented learning theory for one grammatical theory of opacity, a Maximum Entropy version of Stratal OT (Bermú…
Learning Parametric Stress without Domain-Specific Mechanisms
State-of-the-art learning mechanisms for stress in Optimality Theory (see, e.g., Tesar and Smolensky 2000; Boersma and Pater 2016; Jarosz 2013) make use of probabilistic mechanisms that are domain-general in that they do not refer to the content of constraints and must not be in UG. By contrast, Pearl (2007, 2011) has argued that domain-general probabilistic learners of parametric grammars (Yang 2002) are insufficient for word stress, and, instea…
Dutch Reduction Domains
[Abstract not available]
No prominent works on this page.
Dutch Reduction Domains
[Abstract not available]
Learning opacity in Stratal Maximum Entropy Grammar
Opaque phonological patterns are sometimes claimed to be difficult to learn; specific hypotheses have been advanced about the relative difficulty of particular kinds of opaque processes (Kiparsky 1971, 1973), and the kind of data that is helpful in learning an opaque pattern (Kiparsky 2000). In this paper, we present a computationally implemented learning theory for one grammatical theory of opacity, a Maximum Entropy version of Stratal OT (Bermú…
Learning Parametric Stress without Domain-Specific Mechanisms
State-of-the-art learning mechanisms for stress in Optimality Theory (see, e.g., Tesar and Smolensky 2000; Boersma and Pater 2016; Jarosz 2013) make use of probabilistic mechanisms that are domain-general in that they do not refer to the content of constraints and must not be in UG. By contrast, Pearl (2007, 2011) has argued that domain-general probabilistic learners of parametric grammars (Yang 2002) are insufficient for word stress, and, instea…
Learning within- and between-word variation in probabilistic OT grammars
This paper proposes a novel method of inferring diacritics for representing between-word variation (exceptionality) in Optimality Theoretic (OT) grammars (e.g., Pater 2000, 2010) that makes it possible to infer such diacritics in the face of within-word variation. Existing methods of inferring diacritics in OT (Pater 2010, Becker 2009, Coetzee 2009) are based in categorical grammar learning (Tesar 1995), which makes them unable to handle within-w…
Bedouin Arabic multiple opacity with indexed constraints in Parallel OT
Opaque interactions between phonological processes (Kiparsky 1973) can be a significant challenge to Optimality Theoretical accounts of phonology (Idsardi 2000, Bakovic 2011). McCarthy (2007) presents the case of multiple opacity in Bedouin Arabic that seems to require extrinsic process ordering (as provided by OT-CC, McCarthy 2007, and Serial Markedness Reduction, Jarosz 2014). It is a counterexample to the Stratal OT approach: one of the opaque…
The Credit Problem in parametric stress
In this paper, we introduce a novel domain-general, statistical learning model for P&P grammars: the Expectation Driven Parameter Learner (EDPL). We show that the EDPL provides a mathematically principled solution to the Credit Problem (Dresher 1999). We present the first systematic tests of the EDPL and an existing and closely related model, the Naïve Parameter Learner (NPL), on a full stress typology, the one generated by Dresher & Kaye’s (1990…
Learning phonetically and phonologically natural classes through constraint indexation
Phonological processes tend to be defined over natural classes (Chomsky & Halle 1968), but there are some arbitrary and language-specific aspects to class behaviour (e.g., Mielke 2004). This paper shows that it is possible to implement a procedure of finding language specific natural classes using contrast detection (Dresher 2014, Sanstedt 2018), but in standard OT with domain-general methods. Three toy languages are constructed, based on those i…
Modelling opacity and variation in Gran Canarian Spanish apocope
In this paper, we present novel data from Spanish spoken on Gran Canaria which show an interaction of two lenition processes: final consonant deletion and vowel apocope. We show that in certain positions in an utterance, these processes optionally combine in a fed counterfeeding interaction. Furthermore, the variation present in the dialect due to process optionality uncovers a latent opacity pattern, i.e. an additional opaque interaction that is…
Generalizing French Schwa Deletion
Indexed constraints (like cophonologies) increase a grammar’s fit to seen data, but do they hurt the grammar’s ability to generalize to unseen data? We focus on French schwa deletion, an optional process whose rate of application is modulated by both phonological and lexical factors, and we propose three indexed constraint learners in the Maximum Entropy (MaxEnt) framework. Using data from Racine (2008), we test the ability of four learners to ca…
Computer Science (9 works) · Linguistics (9 works) · Artificial Intelligence (8 works) · Linguistic Variation and Morphology (6 works) · Mathematics (6 works) · Natural language processing (6 works) · Philosophy (6 works) · Natural Language Processing Techniques (5 works) · Phonetics and Phonology Research (5 works) · Probabilistic logic (4 works)