Top Accuracy and Fast Dependency Parsing is not a Contradiction

By Bernd Bohnet. International Conference on Computational Linguistics, 2010

389 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/51cfde9bbc25a4cff1d5666815674c83886d933e

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Learning Structured Perceptrons for Coreference Resolution with Latent Antecedents and Non-local Features (2014, methodology): “We also implement the feature mapping function Φ as a hash kernel (Bohnet, 2010) and apply averaging (Collins, 2002), though for brevity we omit this from the pseudocode.”
Neural Semantic Role Labeling with Dependency Path Embeddings (2016, methodology): “To identify the relation that holds between two entities, their approaches make use of pooling layers that detect parts of a path that indicate a speciﬁc relation.”
Phrase Dependency Machine Translation with Quasi-Synchronous Tree-to-Tree Features (2014, methodology): “…available by the research community since we began this research and would be natural choices for further experimentation, such as ParZu (Sennrich et al. 2009) for German, the parser model from Bohnet (2010) adapted for German by Seeker and Kuhn (2012), and DuDuPlus (Chen et al. 2012) for Chinese.”
Using subcategorization knowledge to improve case prediction for translation to German (2013, methodology): “The German part of Europarl was dependency-parsed with Bohnet (2010), and subcategorization information was extracted as described in Scheible et al. (2013); the newspaper data (HGC - Huge German Corpus) was parsed with Schmid (2000), and subcategorization information was extracted as described in…”
Structured Training for Neural Network Transition-Based Parsing (2015, unknown): “Lately, dependency parsing has emerged as a popular approach to this problem due to the availability of dependency treebanks in many languages (Buchholz and Marsi, 2006; Nivre et al., 2007; McDonald et al., 2013) and the efficiency of dependency parsers. Transition-based parsers (Nivre, 2008) have b”
Phrase-Based SMT for Finnish with More Data, Better Models and Alternative Alignment and Translation Tools (2016, methodology): “, 2013), and the data is subsequently parsed using the mate-tools data-driven dependency parser (Bohnet, 2010).”
Overview of the 2012 Shared Task on Parsing the Web (2012, background): “• Many systems built on top of publicly available tools, most frequently the Berkeley parser (Petrov et al., 2006), the Charniak parser (Charniak , 2000) and the Mate dependency parser (Bohnet, 2010).”