Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
3,534
A Transition-Based Dependency Parser Using a Dynamic Parsing Strategy
"... We present a novel transition-based, greedy dependency parser which implements a flexible mix of bottom-up and top-down strategies. The new strategy allows the parser to postpone difficult decisions until the relevant information becomes available. The novel parser has a ∼12 % error reduction in unl ..."
Abstract
-
Cited by 7 (2 self)
- Add to MetaCart
We present a novel transition-based, greedy dependency parser which implements a flexible mix of bottom-up and top-down strategies. The new strategy allows the parser to postpone difficult decisions until the relevant information becomes available. The novel parser has a ∼12 % error reduction
A New Statistical Parser Based on Bigram Lexical Dependencies
, 1996
"... This paper describes a new statistical parser which is based on probabilities of dependencies between head-words in the parse tree. Standard bigram probability estimation techniques are extended to calculate probabilities of dependencies between pairs of words. Tests using Wall Street Journal ..."
Abstract
-
Cited by 490 (4 self)
- Add to MetaCart
This paper describes a new statistical parser which is based on probabilities of dependencies between head-words in the parse tree. Standard bigram probability estimation techniques are extended to calculate probabilities of dependencies between pairs of words. Tests using Wall Street
Generating typed dependency parses from phrase structure parses
- IN PROC. INT’L CONF. ON LANGUAGE RESOURCES AND EVALUATION (LREC
, 2006
"... This paper describes a system for extracting typed dependency parses of English sentences from phrase structure parses. In order to capture inherent relations occurring in corpus texts that can be critical in real-world applications, many NP relations are included in the set of grammatical relations ..."
Abstract
-
Cited by 655 (26 self)
- Add to MetaCart
relations used. We provide a comparison of our system with Minipar and the Link parser. The typed dependency extraction facility described here is integrated in the Stanford Parser, available for download.
Dynamic Programming Algorithms for Transition-Based Dependency Parsers
"... We develop a general dynamic programming technique for the tabulation of transition-based dependency parsers, and apply it to obtain novel, polynomial-time algorithms for parsing with the arc-standard and arc-eager models. We also show how to reverse our technique to obtain new transition-based depe ..."
Abstract
-
Cited by 14 (4 self)
- Add to MetaCart
We develop a general dynamic programming technique for the tabulation of transition-based dependency parsers, and apply it to obtain novel, polynomial-time algorithms for parsing with the arc-standard and arc-eager models. We also show how to reverse our technique to obtain new transition-based
Integrating GraphBased and Transition-Based Dependency Parsers
- In Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies (ACL-08: HLT
, 2008
"... Previous studies of data-driven dependency parsing have shown that the distribution of parsing errors are correlated with theoretical properties of the models used for learning and inference. In this paper, we show how these results can be exploited to improve parsing accuracy by integrating a graph ..."
Abstract
-
Cited by 81 (8 self)
- Add to MetaCart
Previous studies of data-driven dependency parsing have shown that the distribution of parsing errors are correlated with theoretical properties of the models used for learning and inference. In this paper, we show how these results can be exploited to improve parsing accuracy by integrating a
Transition-based dependency parsing with selectional branching
- In Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics
, 2013
"... We present a novel approach, called selectional branching, which uses confidence estimates to decide when to employ a beam, providing the accuracy of beam search at speeds close to a greedy transition-based dependency parsing approach. Selectional branching is guaranteed to perform a fewer number of ..."
Abstract
-
Cited by 13 (1 self)
- Add to MetaCart
We present a novel approach, called selectional branching, which uses confidence estimates to decide when to employ a beam, providing the accuracy of beam search at speeds close to a greedy transition-based dependency parsing approach. Selectional branching is guaranteed to perform a fewer number
Transition-based Spinal Parsing
"... We present a transition-based arc-eager model to parse spinal trees, a dependency-based representation that includes phrase-structure information in the form of con-stituent spines assigned to tokens. As a main advantage, the arc-eager model can use a rich set of features combining depen-dency and c ..."
Abstract
- Add to MetaCart
We present a transition-based arc-eager model to parse spinal trees, a dependency-based representation that includes phrase-structure information in the form of con-stituent spines assigned to tokens. As a main advantage, the arc-eager model can use a rich set of features combining depen-dency
Transition-Based Dependency Parsing With Pluggable Classifiers
"... In principle, the design of transition-based dependency parsers makes it possible to experiment with any general-purpose clas-sifier without other changes to the pars-ing algorithm. In practice, however, it of-ten takes substantial software engineering to bridge between the different representa-tion ..."
Abstract
- Add to MetaCart
In principle, the design of transition-based dependency parsers makes it possible to experiment with any general-purpose clas-sifier without other changes to the pars-ing algorithm. In practice, however, it of-ten takes substantial software engineering to bridge between the different
Memory-based dependency parsing
- In Proceedings of CoNLL
, 2004
"... In order to realize the full potential of dependency-based syntactic parsing, it is desirable to allow non-projective dependency structures. We show how a datadriven deterministic dependency parser, in itself restricted to projective structures, can be combined with graph transformation techniques t ..."
Abstract
-
Cited by 287 (48 self)
- Add to MetaCart
In order to realize the full potential of dependency-based syntactic parsing, it is desirable to allow non-projective dependency structures. We show how a datadriven deterministic dependency parser, in itself restricted to projective structures, can be combined with graph transformation techniques
A tabular method for dynamic oracles in transition-based parsing
, 2014
"... Abstract We develop parsing oracles for two transition-based dependency parsers, including the arc-standard parser, solving a problem that was left open in ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Abstract We develop parsing oracles for two transition-based dependency parsers, including the arc-standard parser, solving a problem that was left open in
Results 1 - 10
of
3,534
