A synchronous context free grammar for time normalization

Steven Bethard

A synchronous context free grammar for time normalization

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

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 language	English (US)
Title of host publication	EMNLP 2013 - 2013 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference
Publisher	Association for Computational Linguistics (ACL)
Pages	821-826
Number of pages	6
ISBN (Electronic)	9781937284978
State	Published - 2013
Externally published	Yes
Event	2013 Conference on Empirical Methods in Natural Language Processing, EMNLP 2013 - Seattle, United States Duration: Oct 18 2013 → Oct 21 2013

Publication series

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

Conference

Conference	2013 Conference on Empirical Methods in Natural Language Processing, EMNLP 2013
Country/Territory	United States
City	Seattle
Period	10/18/13 → 10/21/13

ASJC Scopus subject areas

Computational Theory and Mathematics
Information Systems
Computer Vision and Pattern Recognition

Cite this

Bethard, S. (2013). A synchronous context free grammar for time normalization. In EMNLP 2013 - 2013 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference (pp. 821-826). (EMNLP 2013 - 2013 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference). Association for Computational Linguistics (ACL).

A synchronous context free grammar for time normalization. / Bethard, Steven.

EMNLP 2013 - 2013 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference. Association for Computational Linguistics (ACL), 2013. p. 821-826 (EMNLP 2013 - 2013 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference).

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

Bethard, S 2013, A synchronous context free grammar for time normalization. in EMNLP 2013 - 2013 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference. EMNLP 2013 - 2013 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference, Association for Computational Linguistics (ACL), pp. 821-826, 2013 Conference on Empirical Methods in Natural Language Processing, EMNLP 2013, Seattle, United States, 10/18/13.

Bethard, Steven. / A synchronous context free grammar for time normalization. EMNLP 2013 - 2013 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference. Association for Computational Linguistics (ACL), 2013. pp. 821-826 (EMNLP 2013 - 2013 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference).

@inproceedings{422cdb9b456e45f79d7890fe52269581,

title = "A synchronous context free grammar for time normalization",

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.",

author = "Steven Bethard",

note = "Publisher Copyright: {\textcopyright} 2013 Association for Computational Linguistics.; 2013 Conference on Empirical Methods in Natural Language Processing, EMNLP 2013 ; Conference date: 18-10-2013 Through 21-10-2013",

year = "2013",

language = "English (US)",

series = "EMNLP 2013 - 2013 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference",

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

pages = "821--826",

booktitle = "EMNLP 2013 - 2013 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference",

}

TY - GEN

T1 - A synchronous context free grammar for time normalization

AU - Bethard, Steven

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84924426972&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84924426972&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84924426972

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

SP - 821

EP - 826

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

PB - Association for Computational Linguistics (ACL)

T2 - 2013 Conference on Empirical Methods in Natural Language Processing, EMNLP 2013

Y2 - 18 October 2013 through 21 October 2013

ER -

A synchronous context free grammar for time normalization

Abstract

Publication series

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this