Unsupervised AMR-Dependency Parse Alignment
In this paper, we introduce an Abstract Meaning Representation (AMR) to Dependency Parse aligner. Alignment is a preliminary step for AMR parsing, and our aligner improves current AMR parser performance. Our aligner involves several different features, including named entity tags and semantic role labels, and uses Expectation-Maximization training. Results show that our aligner reaches an 87.1{\%} F-Score score with the experimental data, and enhances AMR parsing.
Code (0)
등록된 구현이 없습니다.
Tasks
Abstract Meaning RepresentationAMR ParsingSimilar Papers 제목 키워드 기반
Unsupervised Dependency Parsing: Let's Use Supervised Parsers
We present a self-training approach to unsupervised dependency parsing that reuses existing supervised and unsupervised parsing algorithms. Our approach, called `iterated reranking' (IR), starts with dependency trees gen…
Dependency ParsingRerankingUnsupervised Dependency ParsingA Survey of Unsupervised Dependency Parsing
Syntactic dependency parsing is an important task in natural language processing. Unsupervised dependency parsing aims to learn a dependency parser from sentences that have no annotation of their correct parse trees. Des…
Dependency ParsingSurveyUnsupervised Dependency ParsingUnsupervised Domain Adaptation Method with Semantic-Structural Alignment for Dependency Parsing
Unsupervised cross-domain dependency parsing is to accomplish domain adaptation for dependency parsing without using labeled data in target domain. Existing methods are often of the pseudo-annotation type, which generate…
Dependency ParsingDomain AdaptationUnsupervised Domain AdaptationEnhancing Unsupervised Generative Dependency Parser with Contextual Information
Most of the unsupervised dependency parsers are based on probabilistic generative models that learn the joint distribution of the given sentence and its parse. Probabilistic generative models usually explicit decompose t…
Constituency Grammar InductionDependency Grammar InductionSentenceUnsupervised Dependency ParsingFill it up: Exploiting partial dependency annotations in a minimum spanning tree parser
Unsupervised models of dependency parsing typically require large amounts of clean, unlabeled data plus gold-standard part-of-speech tags. Adding indirect supervision (e.g. language universals and rules) can help, but we…
Dependency Parsing