A synchronous context free grammar for time normalization

Research output: Chapter in Book/Report/Conference proceedingConference contribution

17 Scopus citations

Abstract

We present an approach to time normalization (e.g. the day before yesterday→2013-04-12) based on a synchronous context free grammar. Synchronous rules map the source language to formally defined operators for manipulating times (FINDENCLOSED, STARTATENDOF, etc.). Time expressions are then parsed using an extended CYK+ algorithm, and converted to a normalized form by applying the operators recursively. For evaluation, a small set of synchronous rules for English time expressions were developed. Our model outperforms HeidelTime, the best time normalization system in TempEval 2013, on four different time normalization corpora.

Original languageEnglish (US)
Title of host publicationEMNLP 2013 - 2013 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference
PublisherAssociation for Computational Linguistics (ACL)
Pages821-826
Number of pages6
ISBN (Electronic)9781937284978
StatePublished - 2013
Externally publishedYes
Event2013 Conference on Empirical Methods in Natural Language Processing, EMNLP 2013 - Seattle, United States
Duration: Oct 18 2013Oct 21 2013

Publication series

NameEMNLP 2013 - 2013 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference

Conference

Conference2013 Conference on Empirical Methods in Natural Language Processing, EMNLP 2013
Country/TerritoryUnited States
CitySeattle
Period10/18/1310/21/13

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Information Systems
  • Computer Vision and Pattern Recognition

Fingerprint

Dive into the research topics of 'A synchronous context free grammar for time normalization'. Together they form a unique fingerprint.

Cite this