Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Fill it up: Exploiting partial dependency annotations in a minimum
  spanning tree parser   Unsupervised models of dependency parsing typically require large amounts of
clean, unlabeled data plus gold-standard part-of-speech tags. Adding indirect
supervision (e.g. language universals and rules) can help, but we show that
obtaining small amounts of direct supervision - here, partial dependency
annotations - provides a strong balance between zero and full supervision. We
adapt the unsupervised ConvexMST dependency parser to learn from partial
dependencies expressed in the Graph Fragment Language. With less than 24 hours
of total annotation, we obtain 7% and 17% absolute improvement in unlabeled
dependency scores for English and Spanish, respectively, compared to the same
parser using only universal grammar constraints.

18
The categories of this paper are: econ
23
The categories of this paper are: solv-int
16
The categories of this paper are: stat
22
The categories of this paper are: chao-dyn
13
The categories of this paper are: quant-ph
21
The categories of this paper are: adap-org
5
The categories of this paper are: gr-qc
26
The categories of this paper are: bayes-an
7
The categories of this paper are: hep-th
10
The categories of this paper are: q-bio
29
The categories of this paper are: funct-an
12
The categories of this paper are: nucl-th
37
The categories of this paper are: supr-con
33
The categories of this paper are: plasm-ph
34
The categories of this paper are: chem-ph
11
The categories of this paper are: hep-lat