[PDF] Top 20 A Search Based Dynamic Reranking Model for Dependency Parsing
Has 10000 "A Search Based Dynamic Reranking Model for Dependency Parsing" found on our website. Below are the top 20 most common "A Search Based Dynamic Reranking Model for Dependency Parsing".
A Search Based Dynamic Reranking Model for Dependency Parsing
... that reranking candidates can be constructed by modifying unconfident actions in the baseline parser output, and letting the base- line parser re-decode the sentence from the mod- ified ...novel ... See full document
10
Analyzing the Effect of Global Learning and Beam Search on Transition Based Dependency Parsing
... global model trained using the same method as Zhang and Nivre (2011), ‘local’ refers to a local classifier trained using the averaged perceptron, ‘base features’ refers to the set of base feature templates in ... See full document
10
A Transition Based Dependency Parser Using a Dynamic Parsing Strategy
... in parsing, predating empirical ...discourse parsing, where right spines are usually called right frontiers; see for instance Subba and Di Eugenio ...transition-based dependency parsers, right ... See full document
10
Transition based Dependency DAG Parsing Using Dynamic Oracles
... art parsing performances with a language agnostic approach on the different syntactic structures of different languages (Buchholz and Marsi, ...data-driven dependency parsers can be catego- rized into two ... See full document
6
A Dynamic Oracle for Arc Eager Dependency Parsing
... beam search and structured prediction for transition-based dependency parsing has shown that parsing accuracy can be improved considerably if models are trained to perform beam ... See full document
18
A Reranking Approach for Dependency Parsing with Variable-sized Subtree Features
... the parsing complexity of the base ...factorized search space which agreed with the conclusion in (Hall, 2007) that an edge-factored model can reach good oracle performance when generating relatively ... See full document
10
Character Level Chinese Dependency Parsing
... Character-Level Dependency Parsing A transition-based framework with global learn- ing and beam search decoding (Zhang and Clark, 2011) has been applied to a number of natural lan- guage ... See full document
11
Distilling Knowledge for Search based Structured Prediction
... reference model, we study the effect of α in Equation ...transition- based dependency parsing and neural machine translation experiments and plot the model’s per- formance on development sets ... See full document
10
Dependency Parsing Based on Dynamic Local Optimization
... Another characteristic is the directionality of de- pendency relations. As Table 1 showed, many rela- tions in treebanks are bi-directional, which increases the number of the relation actually. Furthermore, the ... See full document
5
Generative Constituent Parsing and Discriminative Dependency Reranking: Experiments on English and French
... this approach lies in its complexity. The constraints can, theoretically, range over any aspect of the final structures, which prevents from using efficient dy- namic programming techniques when searching for a global ... See full document
11
Efficient Stacked Dependency Parsing by Forest Reranking
... discriminative reranking with higher-order graph-based features, which works on the forests output by the first-stage dynamic pro- gramming shift-reduce parser and integrates non- local features ... See full document
12
Stochastic Dependency Parsing Based on A* Admissible Search
... of search state but indicating the way a state can be uniquely ...example, search state cannot be represented simply with the current city, because traveling salesperson problem requires every city has to ... See full document
8
Layer-Based Dependency Parsing
... a model for scoring possible dependency graphs of an input sentence and apply exhaustive search algorithms to find the one that maximizes the ...whole dependency graph) both in training and ... See full document
10
Integrating Graph Based and Transition Based Dependency Parsers
... data-driven dependency parsing, which can be seen as targeting the specific weaknesses of graph-based and transition-based models, respectively, though without integrating the two ...beam ... See full document
9
K Best Spanning Tree Dependency Parsing With Verb Valency Lexicon Reranking
... dency parsing of Croatian ...Croatian Dependency Treebank (Tadi´c, 2007; Agi´c, 2012; Berovi´c et ...baseline. Parsing baselines in data-driven dependency parsing are usually topped by ... See full document
12
Memory Based Dependency Parsing
... concerning parsing accuracy to those obtained for other languages (given that there are no comparable results available for Swedish), we note that the best unlabeled attachment score is lower than for English, ... See full document
8
Arc Standard Spinal Parsing with Stack LSTMs
... pendency parsing metrics. To this end, we em- ulate a dependency parser using a spinal model by taking standard Stanford dependency trees and adding a dummy constituent for every head with all ... See full document
7
Improving Graph based Dependency Parsing with Decision History
... The parsing algorithms used in Carreras (2007) independently find the left and right dependents of a word and then combine them later in a bottom- up style based on Eisner ... See full document
9
Parsing Chinese Synthetic Words with a Character-based Dependency Model
... character-based parsing, providing both internal structures to synthetic words and global structure to sentences in a seamless ...word parsing is not yet satisfactory, due to the lack of ... See full document
6
Improving Neural Parsing by Disentangling Model Combination and Reranking Effects
... implicit model combination, can we gain even more by combining the models explicitly? We find that this is indeed the case: simply taking a weighted aver- age of the scores of both models when selecting a parse ... See full document
6
Related subjects