Arborescence optimization problems solvable by Edmonds' algorithm
Theoretical Computer Science
Ultraconservative online algorithms for multiclass problems
The Journal of Machine Learning Research
Learning event durations from event descriptions
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Non-projective dependency parsing using spanning tree algorithms
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Online Passive-Aggressive Algorithms
The Journal of Machine Learning Research
Algorithms for deterministic incremental dependency parsing
Computational Linguistics
EMNLP '06 Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing
Jointly combining implicit constraints improves temporal ordering
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
SemEval-2007 task 15: TempEval temporal relation identification
SemEval '07 Proceedings of the 4th International Workshop on Semantic Evaluations
CU-TMP: temporal relation classification using syntactic and semantic features
SemEval '07 Proceedings of the 4th International Workshop on Semantic Evaluations
NAIST.Japan: temporal relation identification using dependency parsed tree
SemEval '07 Proceedings of the 4th International Workshop on Semantic Evaluations
Predicting unknown time arguments based on cross-event propagation
ACLShort '09 Proceedings of the ACL-IJCNLP 2009 Conference Short Papers
Learning to tell tales: a data-driven approach to story generation
ACL '09 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: Volume 1 - Volume 1
Jointly identifying temporal relations with Markov Logic
ACL '09 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: Volume 1 - Volume 1
SemEval-2010 task 13: TempEval-2
SemEval '10 Proceedings of the 5th International Workshop on Semantic Evaluation
TRIPS and TRIOS system for TempEval-2: Extracting temporal information from text
SemEval '10 Proceedings of the 5th International Workshop on Semantic Evaluation
TIPSem (English and Spanish): Evaluating CRFs and semantic roles in TempEval-2
SemEval '10 Proceedings of the 5th International Workshop on Semantic Evaluation
Using query patterns to learn the duration of events
IWCS '11 Proceedings of the Ninth International Conference on Computational Semantics
Increasing informativeness in temporal annotation
LAW V '11 Proceedings of the 5th Linguistic Annotation Workshop
Evaluating dependency parsing: robust and heuristics-free cross-nnotation evaluation
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Hi-index | 0.00 |
We propose a new approach to characterizing the timeline of a text: temporal dependency structures, where all the events of a narrative are linked via partial ordering relations like BEFORE, AFTER, OVERLAP and IDENTITY. We annotate a corpus of children's stories with temporal dependency trees, achieving agreement (Krippendorff's Alpha) of 0.856 on the event words, 0.822 on the links between events, and of 0.700 on the ordering relation labels. We compare two parsing models for temporal dependency structures, and show that a deterministic non-projective dependency parser outperforms a graph-based maximum spanning tree parser, achieving labeled attachment accuracy of 0.647 and labeled tree edit distance of 0.596. Our analysis of the dependency parser errors gives some insights into future research directions.