1 |
The Match-Extend Serialization Algorithm in Multiprecedence ...
|
|
|
|
BASE
|
|
Show details
|
|
2 |
Precedence and the Lack Thereof: Precedence-Relation-Oriented Phonology ...
|
|
|
|
BASE
|
|
Show details
|
|
3 |
Precedence and the Lack Thereof: Precedence-Relation-Oriented Phonology
|
|
|
|
Abstract:
The study of representations, their limits and capacities, is an indispensable part of the formal study of language. The representations are the limits of what can be stored and computed upon, and the details of a representation have a major influence on the form of any analysis. Broadly, the goal of this thesis is to explore a lower bound of complexity for the phonological module. By exploring the capacities of a representation that I will argue requires fewer stipulations than anything offered before it, I will defend the claim that the freedom of this more powerful representation matches the power of morphology. More specifically I will argue that the representation of phonology is not strings, but directed graphs, and that this representation is simpler and more powerful and that its power exactly matches the set of attested phenomena of word-formation and phonology. The goal of this dissertation is to expand on the theory of Multiprecedence, which is both promising and under-explored.
|
|
Keyword:
allomorphy; Linguistics; Morphology; Multiprecedence; Phonology; vowel harmony; word tone
|
|
URL: http://hdl.handle.net/1903/26391 https://doi.org/10.13016/wcal-jq9q
|
|
BASE
|
|
Hide details
|
|
|
|