Single malt or blended? A study in multilingual parser optimization
We describe a two-stage optimization of the MaltParser system for the ten languages in the
multilingual track of the CoNLL 2007 shared task on dependency parsing. The first stage …
multilingual track of the CoNLL 2007 shared task on dependency parsing. The first stage …
Algorithms for deterministic incremental dependency parsing
J Nivre - Computational Linguistics, 2008 - direct.mit.edu
Parsing algorithms that process the input from left to right and construct a single derivation
have often been considered inadequate for natural language parsing because of the …
have often been considered inadequate for natural language parsing because of the …
[PDF][PDF] Transition-based dependency parsing with selectional branching
We present a novel approach, called selectional branching, which uses confidence
estimates to decide when to employ a beam, providing the accuracy of beam search at …
estimates to decide when to employ a beam, providing the accuracy of beam search at …
Universal Dependency parsing for Hindi-English code-switching
Code-switching is a phenomenon of mixing grammatical structures of two or more
languages under varied social constraints. The code-switching data differ so radically from …
languages under varied social constraints. The code-switching data differ so radically from …
Differentiable perturb-and-parse: Semi-supervised parsing with a structured variational autoencoder
Human annotation for syntactic parsing is expensive, and large resources are available only
for a fraction of languages. A question we ask is whether one can leverage abundant …
for a fraction of languages. A question we ask is whether one can leverage abundant …
[PDF][PDF] Stacking dependency parsers
We explore a stacked framework for learning to predict dependency structures for natural
language sentences. A typical approach in graph-based dependency parsing has been to …
language sentences. A typical approach in graph-based dependency parsing has been to …
[PDF][PDF] Evaluation of dependency parsers on unbounded dependencies
We evaluate two dependency parsers, MSTParser and MaltParser, with respect to their
capacity to recover unbounded dependencies in English, a type of evaluation that has been …
capacity to recover unbounded dependencies in English, a type of evaluation that has been …
[PDF][PDF] Improving dependency parsing with subtrees from auto-parsed data
This paper presents a simple and effective approach to improve dependency parsing by
using subtrees from auto-parsed data. First, we use a baseline parser to parse large-scale …
using subtrees from auto-parsed data. First, we use a baseline parser to parse large-scale …
[PDF][PDF] Exploiting web-derived selectional preference to improve statistical dependency parsing
In this paper, we present a novel approach which incorporates the web-derived selectional
preferences to improve statistical dependency parsing. Conventional selectional preference …
preferences to improve statistical dependency parsing. Conventional selectional preference …
Dependency parsing with second-order feature maps and annotated semantic information
Dependency trees represent sentences as labeled directed graphs encoding syntactic
relations between words. The labels on the arcs represent grammatical relations such as …
relations between words. The labels on the arcs represent grammatical relations such as …