Abstract
In this paper, we present a hybrid approach to Temporal Slot Filling (TSF) task. Our method decomposes the task into two steps: temporal classification and temporal aggregation. As in many other NLP tasks, a key challenge lies in capturing relations between text elements separated by a long context. We have observed that features derived from a structured text representation can help compressing the context and reducing ambiguity. On the other hand, surface lexical features are more robust and work better in some cases. Experiments on the KBP2011 temporal training data set show that both surface and structured approaches outperform a baseline bag-of-word based classifier and the proposed hybrid method can further improve the performance significantly. Our system achieved the top performance in KBP2011 evaluation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bethard, S., Martin, J.H.: Cu-tmp: Temporal relation classification using syntactic and semantic features. In: SemEval 2007: 4th International Workshop on Semantic Evaluations (2007)
Bunescu, R.C., Mooney, R.J.: A shortest path dependency kernel for relation extraction. In: Proc. of the HLT and EMNLP, pp. 724–731 (2005)
Chambers, N., Wang, S., Jurafsky, D.: Classifying temporal relations between events. In: Annual Meeting of the Association for Computational Linguistics (ACL), pp. 173–176 (2007)
Chang, C.C., Lin, C.J.: LIBSVM: a library for support vector machines (2001)
Cheng, Y., Asahara, M., Matsumoto, Y.: Naist.japan: Temporal relation identification using dependency parsed tree. In: Proceedings of the Fourth International Workshop on Semantic Evaluations (SemEval 2007), pp. 245–248 (2007)
Cortes, C., Vapnik, V.: Support-vector networks. Machine Learning, 273–297 (1995)
Finkel, J.R., Grenager, T., Manning, C.D.: Incorporating non-local information into information extraction systems by gibbs sampling. In: ACL (2005)
Grishman, R.: The NYU System for MUC-6 or Where’s the Syntax? In: Proceedings of the MUC-6 workshop (2010)
Ji, H., Grishman, R., Dang, H.T., Li, X., Griffitt, K., Ellis, J.: An Overview of the TAC2011 Knowledge Base Population Track. In: Proc. Text Analytics Conference (TAC 2011) (2010)
Ling, X., Weld, D.: Temporal information extraction. In: Proceedings of the Twenty Fifth National Conference on Artificial Intelligence (2010)
Lodhi, H., Saunders, C., Shawe-Taylor, J., Cristianini, N., Watkins, C.: Text classification using string kernels. The Journal of Machine Learning Research 2, 419–444 (2002)
Marneffe, M.C.D., Maccartney, B., Manning, C.D.: Generating Typed Dependency Parses from Phrase Structure Parses. In: LREC 2006 (2006)
Mintz, M., Bills, S., Snow, R., Jurafsky, D.: Distant supervision for relation extraction without labeled data. In: ACL/AFNLP, pp. 1003–1011 (2009)
Puşcaşu, G.: Wvali: Temporal relation identification by syntactico-semantic analysis. In: Proceedings of the Fourth International Workshop on Semantic Evaluations (SemEval 2007), pp. 484–487 (2007)
Pustejovsky, J., Verhagen, M.: Semeval-2010 task 13: Evaluating events, time expressions, and temporal relations (tempeval-2) (2010)
Snow, R., Jurafsky, D., Ng, A.Y.: Learning syntactic patterns for automatic hypernym discovery. In: Advances in Neural Information Processing Systems, vol. 17, pp. 1297–1304 (2005)
Verhagen, M., Gaizauskas, R., Schilder, F., Katz, G., Pustejovsky, J.: Semeval2007 task 15: Tempeval temporal relation identification. In: SemEval 2007: 4th International Workshop on Semantic Evaluations (2007)
Wu, F., Weld, D.S.: Open Information Extraction using Wikipedia. In: Proc. of the 48th Annual Meeting of the Association for Computational Linguistics (2010)
Yoshikawa, K., Riedel, S., Asahara, M., Matsumoto, Y.: Jointly identifying temporal relations with markov logic. In: Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP, pp. 405–413 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, Q., Artiles, J., Cassidy, T., Ji, H. (2012). Combining Flat and Structured Approaches for Temporal Slot Filling or: How Much to Compress?. In: Gelbukh, A. (eds) Computational Linguistics and Intelligent Text Processing. CICLing 2012. Lecture Notes in Computer Science, vol 7182. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28601-8_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-28601-8_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28600-1
Online ISBN: 978-3-642-28601-8
eBook Packages: Computer ScienceComputer Science (R0)