<--- Back to Details
First PageDocument Content
Historical linguistics / Optimality theory / Reduplication / Junko Itō / Michael Kenstowicz / Axininca language / Jeroen van de Weijer / The Linguistic Review / Jennifer S. Cole / Linguistics / Phonology / Language
Date: 2001-12-04 18:34:54
Historical linguistics
Optimality theory
Reduplication
Junko Itō
Michael Kenstowicz
Axininca language
Jeroen van de Weijer
The Linguistic Review
Jennifer S. Cole
Linguistics
Phonology
Language

Prosodic Morphology Constraint Interaction and Satisfaction

Add to Reading List

Source URL: roa.rutgers.edu

Download Document from Source Website

File Size: 1,37 MB

Share Document on Facebook

Similar Documents

Optimality Theory and Human Sentence Processing* Edward Gibson and Kevin Broihier, Massachusetts Institute of Technology This paper applies the idea of a winner-take-all constraint satisfaction system like that found in

DocID: 1sgkZ - View Document

Phonology / Linguistics / Historical linguistics / Optimality theory / Markedness / Sound change / Lenition / Phonotactics / Phonological rule / Phonological change / Feeding order / Feature

1 Phonological change in Optimality Theory Ricardo Bermúdez-Otero In: Keith Brown (ed), Encyclopedia of language and linguistics, 2nd edn, vol. 9, .

DocID: 1qXUW - View Document

Linguistics / Language / Phonology / Phonotactics / Vowels / Amharic / Catalan phonology / Optimality theory / Catalan language / Schwa / Epenthesis / Apophony

22 Manchester Phonology Meeting Manchester, 29-31 May 2014 The free-ride procedure to morphophonemic learning is correct

DocID: 1qWci - View Document

Transaction processing / Computing / Data management / Data / Databases / Concurrency control / Operations research / Scheduling / Two-phase locking / Schedule / Windows Task Scheduler / Serializability

An Optimality Theory of Concurrency Control for Databases H. T. Kung Department of Computer Scionco Carnogio-Mellon University

DocID: 1qUDi - View Document

Operations research / Algorithm / Mathematical logic / Theoretical computer science / Mathematical optimization / Academia / Mathematics / Applied mathematics / Dynamic programming / Randomized algorithms as zero-sum games / Randomized rounding

CS264: Beyond Worst-Case Analysis Lecture #20: From Unknown Input Distributions to Instance Optimality∗ Tim Roughgarden† December 3, 2014

DocID: 1qRou - View Document