A Finite-State Approach to Event Semantics

@inproceedings{Fernando2002AFA,
  title={A Finite-State Approach to Event Semantics},
  author={Tim Fernando},
  booktitle={TIME},
  year={2002}
}
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… CONTINUE READING