Iterating semantic automata

Linguistics and Philosophy 36 (2):151-173 (2013)
  Copy   BIBTEX

Abstract

The semantic automata framework, developed originally in the 1980s, provides computational interpretations of generalized quantifiers. While recent experimental results have associated structural features of these automata with neuroanatomical demands in processing sentences with quantifiers, the theoretical framework has remained largely unexplored. In this paper, after presenting some classic results on semantic automata in a modern style, we present the first application of semantic automata to polyadic quantification, exhibiting automata for iterated quantifiers. We also discuss the role of semantic automata in linguistic theory and offer new empirical predictions for sentence processing with embedded quantifiers

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,809

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2013-06-10

Downloads
83 (#251,786)

6 months
10 (#399,629)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Shane Steinert-Threlkeld
University of Washington

Citations of this work

Some Properties of Iterated Languages.Shane Steinert-Threlkeld - 2016 - Journal of Logic, Language and Information 25 (2):191-213.

Add more citations

References found in this work

Vision.David Marr - 1982 - W. H. Freeman.
General semantics.David K. Lewis - 1970 - Synthese 22 (1-2):18--67.
On the proper treatment of connectionism.Paul Smolensky - 1988 - Behavioral and Brain Sciences 11 (1):1-23.
Generalized quantifiers and natural language.John Barwise & Robin Cooper - 1981 - Linguistics and Philosophy 4 (2):159--219.

View all 33 references / Add more references