An Analysis of Bootstrapping for the Recognition of Temporal Expressions

5Citations
Citations of this article
89Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a semi-supervised (bootstrapping) approach to the extraction of time expression mentions in large unlabelled corpora. Because the only supervision is in the form of seed examples, it becomes necessary to resort to heuristics to rank and filter out spurious patterns and candidate time expressions. The application of bootstrapping to time expression recognition is, to the best of our knowledge, novel. In this paper, we describe one such architecture for bootstrapping Information Extraction (IE) patterns —suited to the extraction of entities, as opposed to events or relations— and summarize our experimental findings. These point out to the fact that a pattern set with a good increase in recall with respect to the seeds is achievable within our framework while, on the other side, the decrease in precision in successive iterations is succesfully controlled through the use of ranking and selection heuristics. Experiments are still underway to achieve the best use of these heuristics and other parameters of the bootstrapping algorithm.

Cite

CITATION STYLE

APA

Poveda, J., Surdeanu, M., & Turmo, J. (2009). An Analysis of Bootstrapping for the Recognition of Temporal Expressions. In NAACL HLT 2009 - Semi-Supervised Learning for Natural Language Processing, Proceedings of the Workshop (pp. 49–57). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1621829.1621836

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free