There are many methods to improve performance of statistical parsers. Resolving structural ambiguities is a major task of these methods. In the proposed approach, the parser produces a set of n-best trees based on a feature-extended PCFG grammar and then selects the best tree structure based on association strengths of dependency word-pairs. However, there is no sufficiently large Treebank producing reliable statistical distributions of all word-pairs. This paper aims to provide a self-learning method to resolve the problems. The word association strengths were automatically extracted and learned by parsing a giga-word corpus. Although the automatically learned word associations were not perfect, the constructed structure evaluation model i...
This article uses semi-supervised Expectation Maximization (EM) to learn lexico-syntactic dependenci...
Problems for parsing morphologically rich languages are, amongst others, caused by the higher variab...
The aim of this thesis is to improve Natural Language Dependency Parsing. We employ a linear Shift R...
There are many methods to improve performances of statistical parsers. Among them, resolving structu...
We describe a new self-learning framework for parser lexicalisation that requires only a plain-text ...
Pretrained language models are generally acknowledged to be able to encode syntax [Tenney et al., 20...
We present a simple and effective semisupervised method for training dependency parsers. We focus on...
The paper introduces a methodological innovation as well as a practical innovation. Firstly, two sce...
Probabilistic syntactic parsing has made rapid progress, but is reaching a performance ceiling. More...
We present a simple, but surprisingly effective, method of self-training a twophase parser-reranker ...
The paper explores different domain-independent techniques to adapt a dependency parser trained on a...
We apply the well-known parsing technique of self-training to a new type of text: language-learner t...
We evaluate discriminative parse reranking and parser self-training on a new English test set using ...
In this work, we apply statistical learning algorithms to Lexicalized Tree Adjoining Grammar (LTAG) ...
We present a simple, but surprisingly ef-fective, method of self-training a two-phase parser-reranke...
This article uses semi-supervised Expectation Maximization (EM) to learn lexico-syntactic dependenci...
Problems for parsing morphologically rich languages are, amongst others, caused by the higher variab...
The aim of this thesis is to improve Natural Language Dependency Parsing. We employ a linear Shift R...
There are many methods to improve performances of statistical parsers. Among them, resolving structu...
We describe a new self-learning framework for parser lexicalisation that requires only a plain-text ...
Pretrained language models are generally acknowledged to be able to encode syntax [Tenney et al., 20...
We present a simple and effective semisupervised method for training dependency parsers. We focus on...
The paper introduces a methodological innovation as well as a practical innovation. Firstly, two sce...
Probabilistic syntactic parsing has made rapid progress, but is reaching a performance ceiling. More...
We present a simple, but surprisingly effective, method of self-training a twophase parser-reranker ...
The paper explores different domain-independent techniques to adapt a dependency parser trained on a...
We apply the well-known parsing technique of self-training to a new type of text: language-learner t...
We evaluate discriminative parse reranking and parser self-training on a new English test set using ...
In this work, we apply statistical learning algorithms to Lexicalized Tree Adjoining Grammar (LTAG) ...
We present a simple, but surprisingly ef-fective, method of self-training a two-phase parser-reranke...
This article uses semi-supervised Expectation Maximization (EM) to learn lexico-syntactic dependenci...
Problems for parsing morphologically rich languages are, amongst others, caused by the higher variab...
The aim of this thesis is to improve Natural Language Dependency Parsing. We employ a linear Shift R...