A Finite-State Approach to Event Semantics

Abstract
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 finite automata then amount to movie cameras/projectors, or more formally, to finite 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)
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Translate to english
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 31,317
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Added to PP index
2010-12-22

Total downloads
62 ( #94,524 of 2,223,805 )

Recent downloads (6 months)
3 ( #180,515 of 2,223,805 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature