• Refine your search:
  • 
    Keyword
  • 
    Creator / Publisher:
    
    • Narayanan, Shrikanth S. (8)
    • Cosi, Piero (7)
    • Wang, DeLiang (7)
    • Gibbon, Dafydd (6)
    • Rao, K. Sreenivasa (6)
    • Carson-Berndsen, Julie (5)
    • Möbius, Bernd (5)
    • Carstensen, Kai-Uwe (4)
    • Damper, Robert I. (4)
    • Fakotakis, Nikos (4)
    •   more
  • 
    Year
  • 
    Medium:
    
    • Print (327)
    • Online (32)
    • CD-ROM, DVD (4)
    • Microfilm (1)
  • 
    Type
  • 
    BLLDB-Access

Search in the Catalogues and Directories

All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year Sort by creator [A → Z]' creator [Z → A]' publishing year ↑ (asc)' publishing year ↓ (desc)' title [A → Z]' title [Z → A]' Simple Search Page: 1 2 3 4 5...19 Hits 1 – 20 of 364 1 Non-local Phonological Processes as Multi-tiered Strictly Local Maps ... Burness, Phillip. - : Université d'Ottawa / University of Ottawa, 2022 BASE Show details 2 Non-local Phonological Processes as Multi-tiered Strictly Local Maps Burness, Phillip. - : Université d'Ottawa / University of Ottawa, 2022 BASE Show details 3 MaxEnt Learners are Biased Against Giving Probability to Harmonically Bounded Candidates O'Hara, Charlie In: Proceedings of the Society for Computation in Linguistics (2022) BASE Show details 4 Input and output locality and representation Chandlee, Jane; Jardine, Adam In: Glossa: a journal of general linguistics; Vol 6, No 1 (2021); 43 ; 2397-1835 (2021) BASE Show details 5 Computational Perspectives on Phonological Constituency and Recursion Yu, Kristine M.. - 2021 BASE Show details 6 Modeling phonological interactions using recursive schemes Oakden, Christopher Donal (author); Jardine, Adam (chair); Akinlabi, Akinbiyi (member); McCollum, Adam (member); Chandlee, Jane (member); Rutgers University; School of Graduate Studies. - 2021 Abstract: This dissertation pursues a computational theory of phonological process interactions whereby individual processes are formalized as input-output mappings (i.e. functions), and interactions are the combinations of those functions using a set of two operators: one previously defined in the literature and another defined in this dissertation. Building on hypotheses regarding the computational complexity of phonological processes in isolation (Heinz and Lai, 2013), the primary novel contribution of this dissertation is to extend these insights to interactions within larger phonological grammars, but in a systematic way. Specifically, it shows that the subsequential class of functions, sufficient to describe a great majority of phonological generalizations in isolation, also provides a well-motivated upper bound on the complexity of phonological interactions. Analyses developed in this work offer a straightforward solution to a number of outstanding cases of interactions in the Chinese tone sandhi literature. Crucially, this includes sandhi paradigms for which traditional generative phonological theories (rule-based SPE (Chomsky and Halle, 1968) and Optimality Theory (Prince and Smolensky, 2004)) fail to account. Thus this novel approach permits an explicit, restrictive theory of phonological interactions whose predictions more closely align with attested data. The formal apparatus for defining functions and operators used in this work is boolean monadic recursive schemes (BMRS; Bhaskar et al., 2020; Chandlee and Jardine, 2020). BMRS are a logical formalism rooted in theoretical computer science, and have been recently applied to computational analyses of phonology. Thus another important contribution of this dissertation is that it represents the first major work using BMRS to explore a specific type of linguistic phenomenon. In addition to demonstrating its application to specific tone sandhi paradigms, this study identifies advantages to BMRS in modeling interactions more generally, especially in comparison to other computational formalisms. The dissertation also leverages the phenomenon-independent nature of this logical formalism by applying BMRS to questions of phonological representation. Specifically, it is shown how operations over BMRS contribute to recent computational work using model theory and logic to explore notational equivalence across representational theories (Strother-Garcia and Heinz, 2015; Danis and Jardine, 2019; Oakden, 2020). ; Ph.D. ; Includes bibliographical references Keyword: Computational phonology; Linguistics; Phonological interactions; Tone sandhi URL: http://dissertations.umi.com/gsnb.rutgers:11413 BASE Hide details 7 Computational Perspectives on Phonological Constituency and Recursion Kristine M. Yu In: Catalan Journal of Linguistics, Vol 20 (2021) (2021) BASE Show details 8 A Method for Projecting Features from Observed Sets of Phonological Classes Mayer, Connor; Daland, Robert In: LINGUISTIC INQUIRY, vol 51, iss 4 (2020) BASE Show details 9 Eines computacionals per a la creació i explotació de corpus orals en català Garrido Almiñana, Juan M. In: Zeitschrift für Katalanistik. - Freiburg : Romanisches Seminar der Universität 33 (2020), 131-154 BLLDB Show details 10 Corpus phonetics for under-documented languages: a vowel harmony example Kempton, Timothy; Pearce, Mary. - 2020 BASE Show details 11 Frequency Matching Behavior in On-line MaxEnt Learners O'Hara, Charlie In: Proceedings of the Society for Computation in Linguistics (2020) BASE Show details 12 Questioning to Resolve Transduction Problems Meinhardt, Eric; Mai, Anna; Bakovic, Eric... In: Proceedings of the Society for Computation in Linguistics (2020) BASE Show details 13 A Logical and Computational Methodology for Exploring Systems of Phonotactic Constraints Lambert, Dakotah; Rogers, James In: Proceedings of the Society for Computation in Linguistics (2019) BASE Show details 14 Place and Position are Computationally Different O'Hara, Charlie In: Proceedings of the Society for Computation in Linguistics (2019) BASE Show details 15 An Algorithm for Learning Phonological Classes from Distributional Similarity Mayer, Connor. - : eScholarship, University of California, 2018 In: Mayer, Connor. (2018). An Algorithm for Learning Phonological Classes from Distributional Similarity. UCLA: Linguistics 0510. Retrieved from: http://www.escholarship.org/uc/item/5jp6q2xn (2018) BASE Show details 16 Learning Both Variability and Exceptionality in Probabilistic OT Grammars Nazarov, Aleksei In: Proceedings of the Society for Computation in Linguistics (2018) BASE Show details 17 Investigating the Consequences of Iterated Learning in Phonological Typology Hughto, Coral In: Proceedings of the Society for Computation in Linguistics (2018) BASE Show details 18 Long-distance consonant agreement and subsequentiality Luo, Huan In: Glossa: a journal of general linguistics; Vol 2, No 1 (2017); 52 ; 2397-1835 (2017) BASE Show details 19 Cross-language forced alignment to assist community-based linguistics for low resource languages Kempton, Timothy. - 2017 BASE Show details 20 Gradient Exceptionality in Maximum Entropy Grammar with Lexically Specific Constraints Moore-Cantwell, Claire; Pater, Joe. - 2016 BASE Show details Page: 1 2 3 4 5...19

Mobile view All Catalogues UB Frankfurt Linguistik 42 IDS Mannheim 0 OLC Linguistik 149 UB Frankfurt Retrokatalog 0 DNB Subject Category Language 0 Institut für Empirische Sprachwissenschaft 3 Leibniz-Centre General Linguistics (ZAS) 0 Bibliographies BLLDB 336 BDSL 0 IDS Bibliografie zur deutschen Grammatik 0 IDS Bibliografie zur Gesprächsforschung 0 IDS Konnektoren im Deutschen 0 IDS Präpositionen im Deutschen 0 IDS OBELEX meta 0 MPI-SHH Linguistics Collection 0 MPI for Psycholinguistics 0 Linked Open Data catalogues Annohub 0 Online resources Link directory 0 Journal directory 0 Database directory 0 Dictionary directory 0 Open access documents BASE 27 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0