Morphologically Simplex D-Quantifiers Are Strictly 2-Local

Graf, Thomas

Abstract Even though languages can express a wide range of quantifiers, only a small number are ever realized as morphologically simplex determiners: every, no, some, and most. This is puzzling because I) most is much more complex than the other three, and II) quantifiers like an even number are simpler than most yet cannot belong to this class. Building on concepts from subregular complexity, I present a new way of measuring a quantifier’s complexity in terms of its verification pattern. The quantifiers every, no, some, and most all have strictly 2-local (SL-2) verification patterns, but quantifiers like an even number do not. This suggest that subregular complexity, and in particular strict locality, plays a crucial role for how much meaning can be packed into morphologically simplex expressions.

Files [pdf]

@InProceedings{Graf24SCiL,
  author    = {Graf, Thomas},
  title     = {Morphologically Simplex {D}-quantifiers are Strictly 2-Local},
  year      = {2024},
  booktitle = {Proceedings of the {Society} for {Computation} in
               {Linguistics} ({SCiL}) 2024},
  pages     = {32--42},
  doi       = {10.7275/scil.2127},
  openaccess = {gold},
}

More Output

Morphologically Simplex D-Quantifiers Are Strictly 2-Local

Graf, Thomas

Cyclic Scope and Processing Difficulty in a Minimalist Parser

Pasternak, Robert, and Thomas Graf

Abstract A common view in the theoretical literature is that quantifier raising (QR) is a clause-bounded operation. But in a paper published in Glossa, Wurmbrand (2018) argues that (i) QR is not clause-bounded, and the apparent clause-boundedness of QR is …

More Output

links

contact