Publication at Faculty of Mathematics and Physics |
2016
Abstract
In the last 12 years, there has been a big progress in the field of unsupervised dependency parsing. Different approaches however sometimes differ in motivation and definition of the problem.
Some of them allow using resources that are forbidden by others, since they are treated as a kind of supervision. The goal of this paper is to define all the variants of unsupervised dependency parsing problem and show their motivation, progress, and the best results.
We also discuss the usefulness of the unsupervised parsing generally, both for the formal linguistics and for the applications.