ClearTK-TimeML: A minimalist approach to TempEval 2013

Steven Bethard

ClearTK-TimeML: A minimalist approach to TempEval 2013

Steven Bethard

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

The ClearTK-TimeML submission to TempEval 2013 competed in all English tasks: identifying events, identifying times, and identifying temporal relations. The system is a pipeline of machine-learning models, each with a small set of features from a simple morpho-syntactic annotation pipeline, and where temporal relations are only predicted for a small set of syntactic constructions and relation types. ClearTK-TimeML ranked 1^st for temporal relation F1, time extent strict F1 and event tense accuracy.

Original language	English (US)
Title of host publication	*SEM 2013 - 2nd Joint Conference on Lexical and Computational Semantics
Publisher	Association for Computational Linguistics (ACL)
Pages	10-14
Number of pages	5
ISBN (Electronic)	9781937284497
State	Published - 2013
Externally published	Yes
Event	2nd Joint Conference on Lexical and Computational Semantics, *SEM 2013 - Atlanta, United States Duration: Jun 13 2013 → Jun 14 2013

Publication series

Name	*SEM 2013 - 2nd Joint Conference on Lexical and Computational Semantics
Volume	2

Conference

Conference	2nd Joint Conference on Lexical and Computational Semantics, *SEM 2013
Country/Territory	United States
City	Atlanta
Period	6/13/13 → 6/14/13

ASJC Scopus subject areas

Computational Theory and Mathematics
Computer Science Applications
Theoretical Computer Science

Cite this

ClearTK-TimeML: A minimalist approach to TempEval 2013. / Bethard, Steven.
*SEM 2013 - 2nd Joint Conference on Lexical and Computational Semantics. Association for Computational Linguistics (ACL), 2013. p. 10-14 (*SEM 2013 - 2nd Joint Conference on Lexical and Computational Semantics; Vol. 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Bethard, S 2013, ClearTK-TimeML: A minimalist approach to TempEval 2013. in *SEM 2013 - 2nd Joint Conference on Lexical and Computational Semantics. *SEM 2013 - 2nd Joint Conference on Lexical and Computational Semantics, vol. 2, Association for Computational Linguistics (ACL), pp. 10-14, 2nd Joint Conference on Lexical and Computational Semantics, *SEM 2013, Atlanta, United States, 6/13/13.

@inproceedings{ad68a6d2d32c4b7d8cc12839be34d321,

title = "ClearTK-TimeML: A minimalist approach to TempEval 2013",

abstract = "The ClearTK-TimeML submission to TempEval 2013 competed in all English tasks: identifying events, identifying times, and identifying temporal relations. The system is a pipeline of machine-learning models, each with a small set of features from a simple morpho-syntactic annotation pipeline, and where temporal relations are only predicted for a small set of syntactic constructions and relation types. ClearTK-TimeML ranked 1st for temporal relation F1, time extent strict F1 and event tense accuracy.",

author = "Steven Bethard",

note = "Publisher Copyright: c 2013 Association for Computational Linguistics; 2nd Joint Conference on Lexical and Computational Semantics, *SEM 2013 ; Conference date: 13-06-2013 Through 14-06-2013",

year = "2013",

language = "English (US)",

series = "*SEM 2013 - 2nd Joint Conference on Lexical and Computational Semantics",

publisher = "Association for Computational Linguistics (ACL)",

pages = "10--14",

booktitle = "*SEM 2013 - 2nd Joint Conference on Lexical and Computational Semantics",

}

TY - GEN

T1 - ClearTK-TimeML

T2 - 2nd Joint Conference on Lexical and Computational Semantics, *SEM 2013

AU - Bethard, Steven

PY - 2013

Y1 - 2013

N2 - The ClearTK-TimeML submission to TempEval 2013 competed in all English tasks: identifying events, identifying times, and identifying temporal relations. The system is a pipeline of machine-learning models, each with a small set of features from a simple morpho-syntactic annotation pipeline, and where temporal relations are only predicted for a small set of syntactic constructions and relation types. ClearTK-TimeML ranked 1st for temporal relation F1, time extent strict F1 and event tense accuracy.

AB - The ClearTK-TimeML submission to TempEval 2013 competed in all English tasks: identifying events, identifying times, and identifying temporal relations. The system is a pipeline of machine-learning models, each with a small set of features from a simple morpho-syntactic annotation pipeline, and where temporal relations are only predicted for a small set of syntactic constructions and relation types. ClearTK-TimeML ranked 1st for temporal relation F1, time extent strict F1 and event tense accuracy.

UR - https://www.scopus.com/pages/publications/85028026169

UR - https://www.scopus.com/pages/publications/85028026169#tab=citedBy

M3 - Conference contribution

AN - SCOPUS:85028026169

T3 - *SEM 2013 - 2nd Joint Conference on Lexical and Computational Semantics

SP - 10

EP - 14

BT - *SEM 2013 - 2nd Joint Conference on Lexical and Computational Semantics

PB - Association for Computational Linguistics (ACL)

Y2 - 13 June 2013 through 14 June 2013

ER -

ClearTK-TimeML: A minimalist approach to TempEval 2013

Abstract

Publication series

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this