Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

TIME
2002
IEEE

favoriteEmaildiscussreport

97views Automated Reasoning» more TIME 2002»

A Finite-State Approach to Event Semantics

13 years 9 months ago

A Finite-State Approach to Event Semantics

Download www.scss.tcd.ie

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 ﬁnite automata then amount to movie cameras/projectors, or more formally, to ﬁnite 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.

Tim Fernando

Real-time Traffic

Automated Reasoning | Natural Language Semantics | Relevant ﬁnite Automata | TIME 2002 | Usual Regular Constructs |

claim paper

Related Content

» A Semantic Content Analysis Model for Sports Video Based on Perception Concepts and Finite...

» Verifying FiniteState Graph Grammars An UnfoldingBased Approach

» A Framework for Semantic Classification of Scenes Using Finite State Machines

» Creating a FiniteState Parser with Application Semantics

» Constructing Finite State Automata for HighPerformance XML Web Services

» Concavity of Mutual Information Rate for InputRestricted FiniteState Memoryless Channels a...

» Pattern Classification In Symbolic Streams via Semantic Annihilation of Information

» Diagnosing DiscreteEvent Systems Extending the Diagnoser Approach to Deal with Telecommuni...

» Correlating Business Events for EventTriggered Rules

Post Info
More Details (n/a)

Added	16 Jul 2010
Updated	16 Jul 2010
Type	Conference
Year	2002
Where	TIME
Authors	Tim Fernando

Comments (0)