<?xml version="1.0"?><!DOCTYPE article SYSTEM "/project/take/software/searchbench_offline_processing/paperxml_generator/aclextractor/src/python/../resource/dtd/paperxml.dtd"><article><header><firstpageheader><page local="1" global="337"/><title>USFD2: Annotating Temporal Expresions and TLINKs for TempEval-2</title><pubinfo>Proceedings of the 5th International Workshop on Semantic Evaluation, ACL 2010,pages 337-340, Uppsala, Sweden, 15-16 July 2010. ©2010 Association for Computational Linguistics</pubinfo><author surname="Derczynski" givenname="Leon"><org  name="University of Sheffield" country="United Kingdom" city="Sheffield"/></author><author surname="Gaizauskas" givenname="Robert"><org  name="University of Sheffield" country="United Kingdom" city="Sheffield"/></author></firstpageheader><frontmatter><p><b>USFD2: Annotating Temporal Expresions and TLINKs for TempEval-2</b></p><p><b>Leon Derczynski</b></p><p>Dept of Computer Science University of Sheffield Regent Court 211 Portobello Sheffield S1 4DP, UK leon@dcs.shef.ac.uk</p><p><b>Robert Gaizauskas</b></p><p>Dept of Computer Science University of Sheffield Regent Court</p><p>211 Portobello</p><p>Sheffield S1 4DP, UK robertg@dcs.shef.ac.uk</p></frontmatter><abstract>We describe the University of Sheffield system used in the TempEval-2 challenge, USFD2. The challenge requires the au­tomatic identification of temporal entities and relations in text. USFD2 identifies and anchors temporal expressions, and also attempts two of the four temporal relation assignment tasks. A rule-based system picks out and an­chors temporal expressions, and a max­imum entropy classifier assigns temporal link labels, based on features that include descriptions of associated temporal signal words. USFD2 identified temporal expres­sions successfully, and correctly classified their type in 90% of cases. Determin­ing the relation between an event and time expression in the same sentence was per­formed at 63% accuracy, the second high­est score in this part of the challenge. </abstract></header><body><section number="1" title="Introduction"><p>The TempEval-2 (Pustejovsky and Verhagen, 2009) challenge proposes six tasks. Our system tackles three of these: task A - identifying time ex­pressions, assigning <b>TIMEX3 </b>attribute values, and anchoring them; task C - determining the tempo­ral relation between an event and time in the same sentence; and task E - determining the temporal relation between two main events in consecutive sentences. For our participation in the task, we decided to employ both rule- and ML-classifier-based approaches. Temporal expressions are dealt with by sets of rules and regular expressions, and relation labelling performed by NLTK's<footnote anchor="1"/> maxi­mum entropy classifier with rule-based processing applied during feature generation. The features (described in full in Section 2) included attributes from the TempEval-2 training data annotation, augmented by features that can be directly derived from the annotated texts. There are two main aims of this work: (1) to create a rule-based tempo­ral expression annotator that includes knowledge from work published since GUTime (Mani and Wilson, 2000) and measure its performance, and (2) to measure the performance of a classifier that includes features based on temporal signals.</p><footnote label="1">See http://www.nltk.org/ .</footnote><p>Our entry to the challenge, USFD2, is a succes­sor to USFD (Hepple et al., 2007). In the rest of this paper, we will describe how USFD2 is con­structed (Section 2), and then go on to discuss its overall performance and the impact of some internal parameters on specific TempEval tasks. Regarding classifiers, we found that despite us­ing identical feature sets across relation classifi­cation tasks, performance varied significantly. We also found that USFD2 performance trends with TempEval-2 did not match those seen when clas­sifiers were trained on other data while perform­ing similar tasks. The paper closes with comments about future work.</p></section><section number="2" title="System Description"><p>The TempEval-2 training and test sets are parti­tioned into data for entity recognition and descrip­tion, and data for temporal relation classification. We will first discuss our approach for temporal ex­pression recognition, description and anchoring, and then discuss our approach to two of the re­lation labelling tasks.</p><subsection number="2.1" title="Identifying, describing and anchoring temporal expressions"><p>Task A of TempEval-2 requires the identification of temporal expressions (or <b>timex</b>es) by defining a start and end boundary for each expression, and assigning an ID to it. After this, systems should attempt to describe the temporal expression, de­termining its type and value (described below).</p><page local="2" global="338"/><p>Our timex recogniser works by building a set of n-grams from the data to be annotated (1 &lt; <i>n &lt; </i>5), and comparing each n-gram against a hand­crafted set of regular expressions. This approach has been shown to achieve high precision, with re­call increasing in proportion to ruleset size (Han et al., 2006; Mani and Wilson, 2000; Ahn et al., 2005). The recogniser chooses the largest possible sequence of words that could be a single temporal expression, discarding any sub-parts that indepen­dently match any of our set of regular expressions. The result is a set of boundary-pairs that describe temporal expression locations within documents. This part of the system achieved 0.84 precision and 0.79 recall, for a balanced fl-measure of 0.82.</p><p>The next part of the task is to assign a type to each temporal expression. These can be one of <b>TIME, DATE, DURATION, </b>or <b>SET. </b>USFD2 only distinguishes between <b>DATE </b>and <b>DURATION </b>timexes. If the words <i>for </i>or <i>during </i>occur in the three words before the timex, the timex ends with an <i>s </i>(such as in <i>seven years), </i>or the timex is a bi-gram whose first token is <i>a </i>(e.g. in <i>a month), </i>then the timex is deemed to be of type <b>DURATION; </b>oth­erwise it is a <b>DATE. </b>These three rules for deter­mining type were created based on observation of output over the test data, and are correct 90% of the time with the evaluation data.</p><p>The final part of task A is to provide a value for the timex. As we only annotate <b>DATEs </b>and <b>DURATIONS, </b>these will be either a fixed calendrical reference in the format YYYY-MM-DD, or a duration in according to the TIMEX2 standard (Ferro et al., 2005). Timex strings of <i>today </i>or <i>now </i>were assigned the special value <b>PRESENTJR.EF, </b>which assumes that <i>today </i>is be­ing used in a literal and not figurative manner, an assumption which holds around 90% of the time in newswire text (Ahn et al., 2005) such as that provided for TempEval-2. In an effort to calcu­late a temporal distance from the document cre­ation time (DCT), USFD2 then checks to see if numeric words (e.g. <i>one, seven hundred) </i>are in the timex, as well as words like <i>last </i>or <i>next </i>which determine temporal offset direction. This distance figure supplies either the second parameter to a <b>DURATION </b>value, or helps calculate DCT offset. Strings that describe an imprecise amount, such as <i>few, </i>are represented in duration values with an <b>X,</b><b> </b>as per the TIMEX2 standard. We next search the timex for temporal unit strings (e.g. <i>quarter, day).</i></p><p>Table 1 : Features used by USFD2 to train a tem­poral relation classifier.</p><p>This helps build either a duration length or an off­set. If we are anchoring a date, the offset is applied to DCT, and date granularity adjusted according to the coarsest temporal primitive present - for ex­ample, if DCT is 1997-06-12 and our timex is <i>six months ago, </i>a value of 1997-01 is assigned, as it is unlikely that the temporal expression refers to the day precisely six months ago, unless followed by the word <i>today.</i></p><p>Where weekday names are found, we used Baldwin's 7-day window (Baldwin, 2002) to an­chor these to a calendrical timeline. This tech­nique has been found to be accurate over 94% of the time with newswire text (Mazur and Dale, 2008). Where dates are found that do not specify a year or a clear temporal direction marker (e.g., <i>April 1</i>7 vs. <i>last July), </i>our algorithm counts the number of days between DCT and the next oc­currence of that date. If this is over a limit /, then the date is assumed to be last year. This is a very general rule and does not take into account the tendency of very-precisely-described dates to be closer to DCT, and far off dates to be loosely specified. An / of 14 days gives the highest per­formance based on the TempEval-2 training data.</p><p>Anchoring dates / specifying duration lengths was the most complex part of task A and our naïve rule set was correct only 17% of the time.</p><table class="main" frame="box" rules="all" border="1" regular="False"><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>Feature</b></p></td><td class="cell"><p><b>Type</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><i>For events</i></p></td><td class="cell"><p></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Tense</p></td><td class="cell"><p>String</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Aspect</p></td><td class="cell"><p>String</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Polarity</p></td><td class="cell"><p>pos or neg</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Modality</p></td><td class="cell"><p>String</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><i>For timexes</i></p></td><td class="cell"><p></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Type</p></td><td class="cell"><p>Timex type</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Value</p></td><td class="cell"><p>String</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><i>Describing signals</i></p></td><td class="cell"><p></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Signal text</p></td><td class="cell"><p>String</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Signal hint</p></td><td class="cell"><p>Relation type</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Arg 1 before signal?</p></td><td class="cell"><p>Boolean</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Signal before Arg 2?</p></td><td class="cell"><p>Boolean</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><i>For every relation</i></p></td><td class="cell"><p></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Arguments are same tense</p></td><td class="cell"><p>Boolean</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Arguments are same aspect</p></td><td class="cell"><p>Boolean</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Arg 1 before Arg 2?</p></td><td class="cell"><p>Boolean</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><i>For every interval</i></p></td><td class="cell"><p></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Token number in sentence / 5</p></td><td class="cell"><p>Integer</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Text annotated</p></td><td class="cell"><p>String</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>Interval type</p></td><td class="cell"><p>event or timex</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr></table><page local="3" global="339"/><table caption="Table 2: A sample of signals and the TempEval-2 temporal relation they suggest."></table></subsection><subsection number="2.2" title="Labelling temporal relations"><p>Our approach for labelling temporal relations (or <b>TLINK</b>s) is based on NLTK's maximum en­tropy classifier, using the feature sets initially pro­posed in Mani et al. (2006). Features that de­scribe temporal signals have been shown to give a 30% performance boost in TLINKs that em­ploy a signal (Derczynski and Gaizauskas, 2010). Thus, the features in Mani et al. (2006) are aug­mented with those used to describe signals de­tailed in Derczynski and Gaizauskas (2010), with some slight changes. Firstly, as there are no spe­cific TLINK/signal associations in the TempEval-2 data (unlike TimeBank (Pustejovsky et al., 2003)), USFD2 needs to perform signal identifi­cation and then associate signals with a temporal relation between two events or timexes. Secondly, a look-up list is used to provide TLINK label hints based on a signal word. A list of features em­ployed by USFD2 is in Table 1.</p><p>We used a simplified version of the approach in Cheng et al. (2007) to identify signal words. This involved the creation of a list of signal phrases that occur in TimeBank with a frequency of 2 or more, and associating a signal from this list with a temporal entity if it is in the same sentence and clause. The textually nearest signal is chosen in the case of conflict.</p><p>As this list of signal phrases only contained 42 entries, we also decided to define a "most-likely" temporal relation for each signal. This was done by imagining a short sentence of the form <i>eventl - signal - event2, </i>and describing the type of re­lation between event 1 and event 2. An excerpt from these entries is shown in Table 2. The hint from this table was included as a feature. Determining whether or not to invert the suggested rela­tion type based on word order was left to the clas­sifier, which is already provided with word order features. It would be possible to build these sug­gestions from data such as TimeBank, but a num­ber of problems stand in the way; the TimeML and TempEval-2 relation types are not identical, word order often affects the actual relationship type sug­gested by a signal (e.g. compare <i>He ran home before he showered </i>and <i>Before he ran home, he showered), </i>and noise in mined data is a problem with the low corpus occurrence frequency of most signals.</p><p>This approach was used for both the intra-sentence timex/event TLINK labelling task and also the task of labelling relations between main events in adjacent sentences.</p></subsection></section><section number="3" title="Discussion"><p>USFD2's rule-based element for timex identifica­tion and description performs well, even achieving above-average recall despite a much smaller rule set than comparable and more complex systems. However, the temporal anchoring component per­forms less strongly. The "all-or-nothing" metric employed for evaluating the annotation of timex values gives non-strict matches a zero score (e.g. if the expected answer is 1990-05-14, no reward is given for 1990-05) even if values are close, which many were.</p><p>In previous approaches that used a maxi­mum entropy classifier and comparable feature set (Mani et al., 2006; Derczynski and Gaizauskas, 2010), the accuracy of event-event relation classi­fication was higher than that of event-timex clas­sification. Contrary to this, USFD2's event-event classification of relations between main events of successive sentences (Task E) was less accu­rate than the classification of event-timex rela­tions between events and timexes in the same sen­tence (Task C). Accuracy in Task C was good (63%), despite the lack of explicit signal/TLINK associations and the absence of a sophisticated signal recognition and association mechanism. This is higher than USFD2's accuracy in Task E (45%) though the latter is a harder task, as most TempEval-2 systems performed significantly worse at this task than event/timex relation classi­fication.</p><p>Signal information was not relied on by many cusses signals to some extent but the system de­scribed only includes a single feature - the sig­nal text), and certainly no processing of this data was performed for that challenge.<page local="4" global="340"/> USFD2 begins to leverage this information, and gives very com­petitive performance at event/timex classification. In this case, the signals provided an increase from 61.5% to 63.1% predictive accuracy in task C. The small size of the improvement might be due to the crude and unevaluated signal identification and as­sociation system that we implemented.</p><doubt alpha="55.6" length="45" tooSmall="False" monospace="0.0">TempEval 2007 systems (Min et al. (2007) dis-</doubt><table class="main" frame="box" rules="all" border="1" regular="False"><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p><b>Signal phrase</b></p></td><td class="cell"><p><b>Suggested relation</b></p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>previous</p></td><td class="cell"><p>AFTER</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>ahead of</p></td><td class="cell"><p>BEFORE</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>so far</p></td><td class="cell"><p>OVERLAP</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>thereafter</p></td><td class="cell"><p>BEFORE</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>in anticipation of</p></td><td class="cell"><p>BEFORE</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>follows</p></td><td class="cell"><p>AFTER</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>since then</p></td><td class="cell"><p>BEFORE</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>soon after</p></td><td class="cell"><p>AFTER</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>as of</p></td><td class="cell"><p>OVERLAP-OR-AFTER</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"><p>throughout</p></td><td class="cell"><p>OVERLAP</p></td><td class="cell"></td></tr><tr class="row"><td class="cell"></td><td class="cell"></td><td class="cell"></td><td class="cell"></td></tr></table><p>The performance of classifier based approaches to temporal link labelling seems to be levelling off - the 60%-70% relation labelling accuracy of work such as Mani et al. (2006) has not been greatly exceeded. This performance level is still the peak of the current generation of systems. Re­cent improvements, while employing novel ap­proaches to the task that rely on constraints be­tween temporal link types or on complex linguistic information beyond that describable by TimeML attributes, still yield marginal improvements (e.g. Yoshikawa et al. (2009)). It seems that to break through this performance "wall", we need to con­tinue to innovate with and discuss temporal re­lation labelling, using information and knowl­edge from many sources to build practical high­performance systems.</p></section><section number="4" title="Conclusion"><p>In this paper, we have presented USFD2, a novel system that annotates temporal expressions and temporal links in text. The system relies on new hand-crafted rules, existing rule sets, machine learning and temporal signal information to make its decisions. Although some of the TempEval-2 tasks are difficult, USFD2 manages to create good and useful annotations of temporal information. USFD2 is available via Google Code<footnote anchor="2"/>.</p></section><section title="Acknowledgments"><p>Both authors are grateful for the efforts of the TempEval-2 team and appreciate their hard work. The first author would like to acknowledge the UK Engineering and Physical Science Research Council for support in the form of a doctoral stu­dentship.</p><footnote label="2">See http://code.google.com/p/usfd2/ .</footnote></section><references><p>D. Ahn, S.F. Adafre, and MD Rijke. 2005. Towards task-based temporal extraction and recognition. In <i>Dagstuhl Seminar Proceedings, </i>volume 5151.</p><p>J.A. Baldwin. 2002. <i>Learning temporal annotation of French news. </i>Ph.D. thesis, Georgetown University.</p><p>Y. Cheng, M. Asahara, and Y. Matsumoto. 2007. Temporal relation identification using dependency parsed tree. In <i>Proceedings of the 4th International Workshop on Semantic Evaluations, </i>pages 245-248.</p><p>L. Derczynski and R. Gaizauskas. 2010. Using sig­nals to improve automatic classification of temporal relations. In <i>Proceedings of the ESSLLI StuS. </i>Sub­mitted.</p><p>L. Ferro, L. Gerber, I. Mani, B. Sundheim, and G. Wil­son. 2005. TIDES 2005 standard for the annotation oftemporal expressions. Technical report, MITRE.</p><p>B. Han, D. Gates, and L. Levin. 2006. From language to time: A temporal expression anchorer. In <i>Tem­poral Representation and Reasoning (TIME), </i>pages 196-203.</p><p>M. Hepple, A. Setzer, and R. Gaizauskas. 2007. USFD: preliminary exploration of features and clas­sifiers for the TempEval-2007 tasks. In <i>Proceedings ofSemEval-2007, </i>pages 438-441.</p><p>I. Mani and G. Wilson. 2000. Robust temporal pro­cessing of news. In <i>Proceedings of the 38th Annual Meeting on ACL, </i>pages 69-76. ACL.</p><p>I. Mani, M. Verhagen, B. Wellner, C.M. Lee, and J. Pustejovsky. 2006. Machine learning of tem­poral relations. In <i>Proceedings ofthe 2lst Inter­national Conference on Computational Linguistics,</i> page 760. ACL.</p><p>P. Mazur and R. Dale. 2008. Whats the date? High accuracy interpretation of weekday. In <i>22nd Inter­national Conference on Computational Linguistics (Coling 2008), Manchester, UK, </i>pages 553-560.</p><doubt alpha="57.1" length="49" tooSmall="False" monospace="0.0">C. Min, M. Srikanth, and A. Fowler. 2007. LCC-TE:</doubt><p>a hybrid approach to temporal relation identification in news text. In <i>Proceedings ofthe 4th International Workshop on Semantic Evaluations, </i>pages 219-222.</p><p>J. Pustejovsky and M. Verhagen. 2009. SemEval-2010 task 13: evaluating events, time expressions, and temporal relations (TempEval-2). In <i>Proceedings of the Workshop on Semantic Evaluations, </i>pages 112­116. ACL.</p><doubt alpha="64.4" length="132" tooSmall="False" monospace="0.0">J. Pustejovsky,P.Hanks, R. Sauri, A. See, R. Gaizauskas, A. Setzer, D. Radev, D. Day, L. Ferro, et al. 2003. The Timebank Corpus. In</doubt><p><i>Corpus Linguistics, </i>volume 2003, page 40.</p><p>K. Yoshikawa, S. Riedel, M. Asahara, and Y. Mat-sumoto. 2009. Jointly identifying temporal rela­tions with markov logic. In <i>IJCNLP: Proceedings of 47th Annual Meeting of the ACL, </i>pages 405-413.</p></references></body></article>