Difference between revisions of "Temporal ordering"
From Cohen Courses
Jump to navigationJump to search| Line 1: | Line 1: | ||
| − | This is a [[category::problem]] to automatically order events in text based on time. Temporal relation between any two events can be categorized into one of the 13 classes defined over | + | This is a [[category::problem]] to automatically order events in text based on time. Temporal relation between any two events can be categorized into one of the 13 classes defined over : ''before'', ''ibefore'' (immediately before), ''includes'', ''begins'', ''ends'', ''overlap'' and their inverses, plus ''simultaneous''. |
== Relevant Papers == | == Relevant Papers == | ||
Revision as of 01:54, 28 September 2011
This is a problem to automatically order events in text based on time. Temporal relation between any two events can be categorized into one of the 13 classes defined over : before, ibefore (immediately before), includes, begins, ends, overlap and their inverses, plus simultaneous.
