[PDF] Top 20 Punctuation: Making a Point in Unsupervised Dependency Parsing

... Inter-punctuation fragments correspond more strongly to dependencies (see Table 3, right). Only one production (rank 14) shows a daughter outside her mother’s fragment. Some number of such pro- ductions is ... See full document

... We trained on the standard Penn Treebank WSJ cor- pus (Marcus et al., 1993). Following Klein and Man- ning (2002), sentences longer than 10 words after removing punctuation are ignored. We refer to this variant as ... See full document

... The experimental results reveal that starting point is very important to the iterated reranking with the ∞-order generative model. On the one hand, that is a disadvantage compared to the other systems, which use ... See full document

... We observe crucial differences between the two training modes for each of the three initialization strategies. Both algorithms walk away from the supervised maximum-likelihood solution; how- ever, Viterbi EM loses at ... See full document

... In this paper, we showed how to use the DMV with Backoff and two fully-generative variants to explore the utility of word duration in fully lexicalized un- supervised dependency parsing. Although other re- ... See full document

... vised parsing (or grammar induction) was based on Dependency Model with Valence (DMV) in- troduced by (Klein and Manning, 2004); (Smith, 2007) and (Cohen et ...used punctuation marks for splitting a ... See full document

... Data We use data prepared for the CoNLL 2006/07 shared tasks (Buchholz and Marsi, 2006; Nivre et al., 2007). 4 We follow standard practice in removing punctuation and using short sentences (≤ 10 or ≤ 20 words) for ... See full document

... In examining the core assumptions of the IBM models, we note that there is a strong resemblance to those of DMV. The similarity is at an abstract level since the nature of the relationship that each model attempts to ... See full document

... Bayes Point Machine ...excluding punctuation, MIRA and BPM are both statistically significantly better than the averaged perceptron result reported in (McDon- ald et ...measuring dependency accuracy ... See full document

... state-of-the-art dependency gram- mar inducer since Klein and Manning (2004) relied on gold part-of-speech ...multi- point performance degradations caused by switching to automatically induced word ... See full document

... final dependency tree is created (one to- ken per node, including punctuation) that maximizes the product of edge probabilities gathered along the sampling ... See full document

... In Spitkovsky et al. (2009), the idea of learning the initial parameters of the model from shorter sentences leads to a method named “baby steps”. In “baby steps”, the model prior of each training set with the sentence ... See full document

... ing unsupervised dependency parsers for languages that have no labeled training data, but have translated text in a resource- rich ...monolingual dependency parser, requiring no human translations ... See full document

... We would like to stress that the setup is not identical for all experiments. For instance, normally the stopping criteria for training is different. While we train all our models for 100 iterations, most other works use ... See full document

... without making the sentence incorrect. Similarly, in the Dependency Analysis by Reduction (Lopatkov´a et ...of dependency analysis by splitting a sentence into all possible acceptable fragments is ... See full document

... structural baseline; either left-attach, i.e. all words attach to their left neighbor, or right-attach. Which structural baseline is used depends on the language in question. It is thus assumed that we know enough about ... See full document

... We formulate a generative Bayesian model that explains the observed data while accounting for declarative linguistic rules during inference. These rules are used as expectation constraints on the posterior distribution ... See full document

... jack-knifing. Parsing ac- curacy is evaluated using unlabelled attachment score (UAS), which is the percentage of words that are assigned the correct lexical ... See full document

... of unsupervised dependency parsers across different papers is not directly pos- sible, since different papers use different gold stan- dard annotations even when they are all derived from the Penn Treebank ... See full document

... traditional dependency for- mulations, which could learn from the boundaries of this sentence only that determiners might have no left- and that nouns might have no ...of dependency parsing mod- els ... See full document