Event Matching Using the Transitive Closure of Dependency Relations

14 years 11 months ago

Download aclweb.org

This paper describes a novel event-matching strategy using features obtained from the transitive closure of dependency relations. The method yields a model capable of matching events with an F-measure of 66.5%.

Daniel M. Bikel, Vittorio Castelli

Real-time Traffic

ACL 2008 | Computational Linguistics | Dependency Relations | Paper | Transitive Closure |

claim paper

» An Account of Implementing Applicative Term Rewriting

» LargeScale Discovery of Spatially Related Images

» Public and private communication are different results on relative expressivity

» Semantic Data Management Towards Querying Data with their Meaning

» Local velocityadapted motion events for spatiotemporal recognition

» Partial Order Reduction for Model Checking of Timed Automata

» Using SpaceTime Interest Points for Video Sequence Synchronization

» Consensus Genetic Maps A Graph Theoretic Approach

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2008
Where	ACL
Authors	Daniel M. Bikel, Vittorio Castelli

Comments (0)

Sciweavers

Event Matching Using the Transitive Closure of Dependency Relations

ACL 2008 | Computational Linguistics | Dependency Relations | Paper | Transitive Closure |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers