[PDF] Top 20 An Efficient Dynamic Oracle for Unrestricted Non Projective Parsing
Has 10000 "An Efficient Dynamic Oracle for Unrestricted Non Projective Parsing" found on our website. Below are the top 20 most common "An Efficient Dynamic Oracle for Unrestricted Non Projective Parsing".
An Efficient Dynamic Oracle for Unrestricted Non Projective Parsing
... fast parsing times; their raw accuracy is still behind that of slower alternatives like transition- based parsers that use beam search (Zhang and Nivre, 2011; Choi and McCallum, ... See full document
6
A Dynamic Oracle for Arc Eager Dependency Parsing
... dependency parsing has shown that parsing accuracy can be improved considerably if models are trained to perform beam search instead of greedy one-best search, and if training is done using a global ... See full document
18
Non Deterministic Oracles for Unrestricted Non Projective Transition Based Dependency Parsing
... exploiting dynamic oracles for training greedy parsers known as training with ...The dynamic oracle then comes into play by guiding the model towards the best pos- sible tree, subject to the mistakes ... See full document
11
A Dynamic Oracle for Linear Time 2 Planar Dependency Parsing
... dependency parsing due to their efficiency and performance, but they cannot deal with non- projective ...of non-projective phenom- ena, and (3) needs no pre- or ... See full document
7
A Full Non Monotonic Transition System for Unrestricted Non Projective Parsing
... a non-monotonic system, we need a dynamic oracle with error exploration, so that the parser will be put in erroneous states and need to apply non-monotonic transitions in or- der to repair ... See full document
11
Non Projective Dependency Parsing with Non Local Transitions
... a dynamic oracle can be obtained for the NL-Covington parser by adapting the one for standard Covington of G´omez-Rodr´ıguez and Fern´andez-Gonz´alez ...incorporating non- monotonicity ... See full document
8
Approximate Dynamic Oracle for Dependency Parsing with Reinforcement Learning
... very efficient but suffer from the error propagation ...of dynamic oracles to train the parser with imitation learning methods to alleviate the ...ever, efficient dynamic oracles have mostly ... See full document
9
Non Projective Dependency Parsing using Spanning Tree Algorithms
... dependency parsing models is its uniformity and ...for parsing trees for both projective and non- projective ...resulting parsing algorithms are more efficient than lexi- ... See full document
8
A Polynomial Time Dynamic Oracle for Non Projective Dependency Parsing
... very efficient, allowing web-scale parsing with high ...in parsing efficiency; see for instance Zhang and Nivre (2011), Huang and Sagae (2010), Choi and McCallum ...transition-based parsing ... See full document
11
Arc Hybrid Non Projective Dependency Parsing with a Static Dynamic Oracle
... transition-based parsing only allow the con- struction of projective ...and parsing consists of performing a sequence of transitions on these ...of non-projective trees (Nivre and ... See full document
6
Neural Probabilistic Model for Non projective MST Parsing
... for non-projective de- pendency parsing. This parsing model uses bi-directional LSTM-CNNs (BLSTM-CNNs) as backbone to learn neural information representa- tions, on top of which a ... See full document
11
Treebank Grammar Techniques for Non Projective Dependency Parsing
... dependency parsing is the accurate and efficient treatment of non-projective ...reduce non- projective dependency parsing to parsing with Linear Context-Free ... See full document
9
Dynamic oracle Transition based Parsing with Calibrated Probabilistic Output
... Ryan McDonald, Joakim Nivre, Yvonne Quirmbach- Brundage, Yoav Goldberg, Dipanjan Das, Kuzman Ganchev, Keith Hall, Slav Petrov, Hao Zhang, Oscar T¨ackstr¨om, Claudia Bedini, N´uria Bertomeu Castell´o, and Jungmee Lee. ... See full document
9
Non Projective Dependency Parsing in Expected Linear Time
... Syntactic parsing using dependency structures has become a standard technique in natural language processing with many different parsing models, in particular data-driven models that can be trained on ... See full document
9
Global Transition based Non projective Dependency Parsing
... arc-hybrid projective transi- tion ...the non-projective case (k ą 3), and the known techniques used to derive previous associations between tabular and transition-based parsers do not seem to be ... See full document
12
Memory Based Dependency Parsing
... For comparison, we have included an earlier classifier that uses the same features as the non-lexical model, but where prediction is based on maximum conditional likeli- hood estimation. This classifier always ... See full document
8
Dual Decomposition for Parsing with Non Projective Head Automata
... for non-projective parsing, which leverage existing dynamic programming and MST ...consider projective structures by replac- ing Y with the set of projective trees, and then ... See full document
11
Exact Inference for Generative Probabilistic Non Projective Dependency Parsing
... We can view a transition-based dependency parser as a device mapping strings into graphs (de- pendency trees). Without any restriction on trans- ition functions in T , these functions might have an infinite domain, and ... See full document
12
Incremental Integer Linear Programming for Non projective Dependency Parsing
... In this paper we present a method which extends the applicability of ILP to a more complex set of problems. Instead of adding all the constraints we wish to capture to the formulation, we first solve the program with a ... See full document
9
Discontinuous Constituency Parsing with a Stack Free Transition System and a Dynamic Oracle
... Split-stack systems The second parsing strat- egy constructs discontinuous constituents by al- lowing the parser to reduce pairs of items that are not adjacent in the stack. In practice, Coavoux and Crabb´e ... See full document
14
Related subjects