A Finite-State Approach to Event Semantics
Events employed in natural language semantics are characterized in terms of regular languages, each string in which can be regarded as a motion picture. The relevant ﬁnite automata then amount to movie cameras/projectors, or more formally, to ﬁnite Kripke structures with par- tial valuations. The usual regular constructs (concatena- tion, choice, etc) are supplemented with superposition of strings/automata/languages, realized model-theoretically as conjunction.
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Observing Events and Situations in Time.Tim Fernando - 2007 - Linguistics and Philosophy 30 (5):527-550.
Automata for Epistemic Temporal Logic with Synchronous Communication.Swarup Mohalik & R. Ramanujam - 2010 - Journal of Logic, Language and Information 19 (4):451-484.
Automata Presenting Structures: A Survey of the Finite String Case.Sasha Rubin - 2008 - Bulletin of Symbolic Logic 14 (2):169-209.
Understanding Quantifiers in Language.Jakub Szymanik & Marcin Zajenkowski - 2009 - In N. A. Taatgen & H. van Rijn (eds.), Proceedings of the 31st Annual Conference of the Cognitive Science Society.
Added to index2010-12-22
Total downloads62 ( #80,645 of 2,146,177 )
Recent downloads (6 months)3 ( #227,266 of 2,146,177 )
How can I increase my downloads?
There are no threads in this forum
Nothing in this forum yet.