Classical Armenian declension
Pavel Caha
Nordlyd: Tromsø University Working Papers on Language & Linguistics · 2009
doi:10.7557/12.220 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
This paper looks in detail at the Classical Armenian declension.I argue that the system provides insights into two central issues in this empirical domain: the morphosyntactic structure of the forms which make up a case paradigm, and the fine working of spell-out.On the empirical side, I highlight a connection between case syncretism and its synthetic vs. analytic expression.More specifically, case syncretism in the language is restricted by contiguity in a linear order of cases.In the same ordering, analytic expression of categories gradually replaces synthetic expression.The technology which is proposed to account for this is a core part of nanosyntax (Starke 2005, this volume): fine grained syntax, and phrasal spell-out.Particular attention is devoted to the interaction of the Superset Principle and the "Biggest wins" theorem, two core components of the nanosyntactic spell-out machinery. *This paper is an extension of a chapter in my dissertation, and consequently, there are many people to thank.I mention here only Gillian Ramchand, Michal Starke and Peter Svenonius who commented on a previous version of the material as it appears in this paper.All errors are mine.1 The phrase "non-accidental" in (1) is intended to exclude two sources of homophony: (i) phonological conflation, whereby two distinct underlying forms end up homophonous due to a regular phonological process, and (ii) accidental homophony.Accidental homophony plays no role in this paper; however, one instance of homophony will be later on analyzed as an example of phonological conflation in the sense described above.
Abstract licence: CC BY-NC
References23
23 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.