Graph Based Parser
Related Papers
A Tale of Two Parsers: Investigating and Combining Graph-based and Transition-based Dependency Parsing
Graph-based and transition-based approaches to dependency parsing adopt very different views of the problem, each view having its own strengths and limitations. We study both approaches under the framework of …...
Stacking Dependency Parsers
We explore a stacked framework for learn- ing to predict dependency structures for natu- ral language sentences. A typical approach in graph-based dependency parsing has been to assume a factorized …...
Because Syntax Does Matter: Improving Predicate-Argument Structures Parsing with Syntactic Features
Parsing full-fledged predicate-argument struc- tures in a deep syntax framework requires graphs to be predicted. Using the DeepBank (Flickinger et al., 2012) and the Predicate- Argument Structure treebank (Miyao and …...
Old French Dependency Parsing: Results of Two Parsers Analysed from a Linguistic Point of View
AbstractThe treatment of medieval texts is a particular challenge for parsers. I compare how two dependency parsers, one graph-based, the other transition-based, perform on Old French, facing some typical problems …...
Multi-grained Chinese Word Segmentation with Weakly Labeled Data
AbstractIn contrast with the traditional single-grained word segmentation (SWS), where a sentence corresponds to a single word sequence, multi-grained Chinese word segmentation (MWS) aims to segment a sentence into multiple …...
Dependency parsing with structure preserving embeddings
AbstractModern neural approaches to dependency parsing are trained to predict a tree structure by jointly learning a contextual representation for tokens in a sentence, as well as a head–dependent scoring …...