TY - GEN
T1 - An Analysis of Bootstrapping for the Recognition of Temporal Expressions
AU - Poveda, Jordi
AU - Surdeanu, Mihai
AU - Turmo, Jordi
N1 - Publisher Copyright:
©2009 Association for Computational Linguistics.
PY - 2009
Y1 - 2009
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84859016261&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84859016261&partnerID=8YFLogxK
U2 - 10.3115/1621829.1621836
DO - 10.3115/1621829.1621836
M3 - Conference contribution
AN - SCOPUS:84859016261
T3 - NAACL HLT 2009 - Semi-Supervised Learning for Natural Language Processing, Proceedings of the Workshop
SP - 49
EP - 57
BT - NAACL HLT 2009 - Semi-Supervised Learning for Natural Language Processing, Proceedings of the Workshop
A2 - Wang, Qin Iris
A2 - Duh, Kevin
A2 - Lin, Dekang
PB - Association for Computational Linguistics (ACL)
T2 - 2009 Semi-Supervised Learning for Natural Language Processing, SSL-NLP2009
Y2 - 4 June 2009
ER -