A finite-state approach to event semantics

被引：2
|
作者：
Fernando, T [1 ]
机构：
[1] Univ Dublin Trinity Coll, Dept Comp Sci, Dublin 2, Ireland
来源：
NINTH INTERNATIONAL SYMPOSIUM ON TEMPORAL REPRESENTATION AND REASONING, PROCEEDINGS | 2002年
关键词：
D O I：
10.1109/TIME.2002.1027485
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
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.
引用
收藏
页码：124 / 131
页数：8
相关论文
共 50 条
12345