DocumentCode
2147990
Title
A finite-state approach to event semantics
Author
Fernando, Tim
Author_Institution
Dept. of Comput. Sci., Trinity Coll., Dublin, Ireland
fYear
2002
fDate
2002
Firstpage
124
Lastpage
131
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 partial valuations. The usual regular constructs (concatenation, choice, etc) are supplemented with superposition of strings/automata/languages, realized model-theoretically as conjunction.
Keywords
computational linguistics; finite automata; formal languages; natural languages; temporal logic; temporal reasoning; conjunction; event semantics; finite Kripke structures; finite automata; finite-state approach; model theory; natural language semantics; partial valuations; regular languages; string; Automata; Cameras; Computer science; Cost accounting; Educational institutions; Labeling; Motion pictures; Natural languages; Proposals;
fLanguage
English
Publisher
ieee
Conference_Titel
Temporal Representation and Reasoning, 2002. TIME 2002. Proceedings.Ninth International Symposium on
ISSN
1530-1311
Print_ISBN
0-7695-1474-X
Type
conf
DOI
10.1109/TIME.2002.1027485
Filename
1027485
Link To Document