A Universal Framework for Inductive Transfer Parsing across Multi-typed Treebanks
Various treebanks have been released for dependency parsing. Despite that treebanks may belong to different languages or have different annotation schemes, they contain common syntactic knowledge that is potential to benefit each other. This paper presents a universal framework for transfer parsing across multi-typed treebanks with deep multi-task learning. We consider two kinds of treebanks as source: the multilingual universal treebanks and the monolingual heterogeneous treebanks. Knowledge across the source and target treebanks are effectively transferred through multi-level parameter sharing. Experiments on several benchmark datasets in various languages demonstrate that our approach can make effective use of arbitrary source treebanks to improve target parsing models.
Code (0)
등록된 구현이 없습니다.
Tasks
Dependency ParsingInformation RetrievalMulti-Task LearningSimilar Papers 제목 키워드 기반
Graphonomy: Universal Human Parsing via Graph Transfer Learning
Prior highly-tuned human parsing models tend to fit towards each dataset in a specific domain or with discrepant label granularity, and can hardly be adapted to other human parsing tasks without extensive re-training. In…
Human ParsingTransfer LearningA Representation Learning Framework for Multi-Source Transfer Parsing
Cross-lingual model transfer has been a promising approach for inducing dependency parsers for low-resource languages where annotated treebanks are not available. The major obstacles for the model transfer approach are t…
Cross-lingual zero-shot dependency parsingRepresentation LearningGraphonomy: Universal Image Parsing via Graph Reasoning and Transfer
Prior highly-tuned image parsing models are usually studied in a certain domain with a specific set of semantic labels and can hardly be adapted into other scenarios (e.g., sharing discrepant label granularity) without e…
Graph Representation LearningHuman ParsingPanoptic SegmentationRepresentation Learning+1Parsing Universal Dependencies without training
We propose UDP, the first training-free parser for Universal Dependencies (UD). Our algorithm is based on PageRank and a small set of head attachment rules. It features two-step decoding to guarantee that function words …
Semantic Human Parsing via Scalable Semantic Transfer over Multiple Label Domains
This paper presents Scalable Semantic Transfer (SST), a novel training paradigm, to explore how to leverage the mutual benefits of the data from different label domains (i.e. various levels of label granularity) to train…
Human ParsingRepresentation Learning