Lisbon: Evaluating TurboSemanticParser on Multiple Languages and Out-of-Domain Data
Mariana S. C. Almeida,André F. T. Martins +1 more
- 01 Jun 2015
- pp 970-973
TL;DR: The experiments have shown that, even though the parser’s performance in Chinese and Czech attains around 80% (not too far from English performance), domain shift is a serious issue, suggesting domain adaptation as an interesting avenue for future research.
read more
Abstract: As part of the SemEval-2015 shared task on Broad-Coverage Semantic Dependency Parsing, we evaluate the performace of our last year’s system (TurboSemanticParser) on multiple languages and out-of-domain data. Our system is characterized by a feature-rich linear model, that includes scores for first and second-order dependencies (arcs, siblings, grandparents and co-parents). For decoding this second-order model, we solve a linear relaxation of that problem using alternating directions dual decomposition (AD 3 ). The experiments have shown that, even though the parser’s performance in Chinese and Czech attains around 80% (not too far from English performance), domain shift is a serious issue, suggesting domain adaptation as an interesting avenue for future research.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Simpler but More Accurate Semantic Dependency Parsing
Timothy Dozat,Christopher D. Manning +1 more
- 01 Jul 2018
TL;DR: The LSTM-based syntactic parser of Dozat and Manning (2017) is extended to train on and generate graph structures that aim to capture between-word relationships that are more closely related to the meaning of a sentence, using graph-structured representations.
Broad-Coverage Semantic Parsing as Transduction
Sheng Zhang,Xutai Ma,Kevin Duh,Benjamin Van Durme +3 more
- 01 Nov 2019
TL;DR: This article propose an attention-based neural transducer that incrementally builds meaning representation via a sequence of semantic relations, which can be effectively trained without relying on a pre-trained aligner.
•Posted Content
Deep Multitask Learning for Semantic Dependency Parsing
TL;DR: The authors presented a deep neural architecture that parses sentences into three semantic dependency graph formalisms using efficient, nearly arc-factored inference and a bidirectional-LSTM composed with a multi-layer perceptron.
110
A Transition-Based Directed Acyclic Graph Parser for UCCA
Daniel Hershcovich,Omri Abend,Ari Rappoport +2 more
- 01 Jul 2017
TL;DR: This work presents the first parser for UCCA, a cross-linguistically applicable framework for semantic representation, which builds on extensive typological work and supports rapid annotation and its ability to handle more general graph structures can inform the development of parsers for other semantic DAG structures, and in languages that frequently use discontinuous structures.
A Transition-Based Directed Acyclic Graph Parser for UCCA
TL;DR: The authors present a transition-based parser for UCCA, a cross-linguistically applicable framework for semantic representation, which builds on extensive typological work and supports rapid annotation.
References
•Journal Article
Online Passive-Aggressive Algorithms
TL;DR: This work presents a unified view for online classification, regression, and uni-class problems, and proves worst case loss bounds for various algorithms for both the realizable case and the non-realizable case.
Domain Adaptation with Structural Correspondence Learning
John Blitzer,Ryan McDonald,Fernando Pereira +2 more
- 22 Jul 2006
TL;DR: This work introduces structural correspondence learning to automatically induce correspondences among features from different domains in order to adapt existing models from a resource-rich source domain to aresource-poor target domain.
•Proceedings Article
Frustratingly Easy Domain Adaptation
Hal Daumé
- 01 Jun 2007
TL;DR: This work describes an approach to domain adaptation that is appropriate exactly in the case when one has enough “target” data to do slightly better than just using only “source’ data.
1.7K
•Proceedings Article
Online Passive-Aggressive Algorithms
Shai Shalev-Shwartz,Koby Crammer,Ofer Dekel,Yoram Singer +3 more
- 09 Dec 2003
TL;DR: In this article, a unified view for online classification, regression, and uni-class problems is presented, which leads to a single algorithmic framework for the three problems, and the authors prove worst case loss bounds for various algorithms for both the realizable case and the non-realizable case.
•Posted Content
Frustratingly Easy Domain Adaptation
TL;DR: In this paper, the authors describe an approach to domain adaptation that is appropriate exactly in the case when one has enough target data to do slightly better than just using only source data.
1.3K
Related Papers (5)
Jeffrey Pennington,Richard Socher,Christopher D. Manning +2 more
- 01 Oct 2014
Timothy Dozat,Christopher D. Manning +1 more
- 04 Nov 2016