|Abstract||The “surge in use of finite-state methods” () in computational linguistics has largely, if not completely, left semantics untouched. The present paper is directed towards correcting this situation. Techniques explained in  are applied to a fragment of temporal semantics through an approach we call finite-state temporality. This proceeds from the intuition of an event as “a series of snapshots” (; see also ), equating snapshots with symbols that collectively form our alphabet. A sequence of snapshots then becomes a string over that alphabet, evoking comic/film strips. Jackendoff has, among others, objected to conceptualizing events in terms of snapshots (). To counter these objections, we step up from events-as-strings to event-typesas-regular languages ([5, 6]), recognizing the need for variable granularity. Beyond the introduction of disjunction implicit in the step from a single string up to a set of strings, we obtain a useful logic from the regular operations and a careful choice of the snapshots (constituting our alphabet).|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Only published papers are available at libraries|
Similar books and articles
Tim Fernando (2007). Observing Events and Situations in Time. Linguistics and Philosophy 30 (5):527-550.
Added to index2009-01-28
Total downloads10 ( #114,329 of 722,826 )
Recent downloads (6 months)2 ( #36,645 of 722,826 )
How can I increase my downloads?