Dependency parsing representation effects on the accuracy of semantic applications --- an example of an inflective language
In this paper we investigate how different dependency representations of a treebank influence the accuracy of the dependency parser trained on this treebank and the impact on several parser applications: named entity recognition, coreference resolution and limited semantic role labeling. For these experiments we use Latvian Treebank, whose native annotation format is dependency based hybrid augmented with phrase-like elements. We explore different representations of coordinations, complex predicates and punctuation mark attachment. Our experiments shows that parsers trained on the variously transformed treebanks vary significantly in their accuracy, but the best-performing parser as measured by attachment score not always leads to best accuracy for an end application.
Code (0)
등록된 구현이 없습니다.
Tasks
coreference-resolutionCoreference ResolutionDependency Parsingnamed-entity-recognitionNamed Entity RecognitionNamed Entity Recognition (NER)Semantic Role LabelingSimilar Papers 제목 키워드 기반
Improving Semantic Dependency Parsing with Syntactic Features
We extend a state-of-the-art deep neural architecture for semantic dependency parsing with features defined over syntactic dependency trees. Our empirical results show that only gold-standard syntactic information leads …
Dependency ParsingSemantic Dependency ParsingSemantic ParsingAn Empirical Comparison of Parsing Methods for Stanford Dependencies
Stanford typed dependencies are a widely desired representation of natural language sentences, but parsing is one of the major computational bottlenecks in text analysis systems. In light of the evolving definition of th…
Dependency ParsingParsing All: Syntax and Semantics, Dependencies and Spans
Both syntactic and semantic structures are key linguistic contextual clues, in which parsing the latter has been well shown beneficial from parsing the former. However, few works ever made an attempt to let semantic pars…
AllSemantic ParsingAMR Dependency Parsing with a Typed Semantic Algebra
We present a semantic parser for Abstract Meaning Representations which learns to parse strings into tree representations of the compositional structure of an AMR graph. This allows us to use standard neural techniques f…
Dependency ParsingDynGL-SDP: Dynamic Graph Learning for Semantic Dependency Parsing
A recent success in semantic dependency parsing shows that graph neural networks can make significant accuracy improvements, owing to its powerful ability in learning expressive graph representations. However, this work …
Dependency Parsinggraph constructionGraph LearningGraph Representation Learning+2