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 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.

• Type: Conference
• Year: 2002
• Where: TIME
• Authors: Tim Fernando
• Keywords: Automated Reasoning, Natural Language Semantics, Relevant finite Automata, TIME 2002, Usual Regular Constructs