Lirias (KU Leuven) · 2012 · 48 citations · 31 references
Open access
Language StudiesComputer ScienceLinguisticsComputational LinguisticsDiscourse AnalysisNatural Language ProcessingDependency ParsingInformation ExtractionNarrative StructureParsingStory StructureSyntactic AnalysisAccuracyDependency TreesEdit DistanceGraph-based Dependency ParsingNon-projective DependenciesNon-projective Dependency ParsingNon-projective ParsingProjective Dependency Parsing
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.
31
Online Passive-Aggressive Algorithms
Koby Crammer, Ofer Dekel, Joseph Keshet et al. · 2006 · 1.5K citations
Mental Models in Cognitive Science
P. N. Johnson‐Laird · Cognitive Science · 1980 · 909 citations
Non-projective dependency parsing using spanning tree algorithms
Ryan McDonald, Fernando Pereira, Kiril Ribarov et al. · 2005 · 862 citations · Full text