Sciweavers

254 search results - page 5 / 51
» Efficient Transformation-Based Parsing
Sort
View
ACL
2006
15 years 8 months ago
Discriminative Classifiers for Deterministic Dependency Parsing
Deterministic parsing guided by treebankinduced classifiers has emerged as a simple and efficient alternative to more complex models for data-driven parsing. We present a systemat...
Johan Hall, Joakim Nivre, Jens Nilsson
ACL
1989
15 years 8 months ago
The Structure of Shared Forests in Ambiguous Parsing
The Context-Free backbone of some natural language analyzers produces all possible CF parses as some kind of shared forest, from which a single tree is to be chosen by a disambigu...
Sylvie Billot, Bernard Lang
196
Voted
EUROCAST
2007
Springer
122views Hardware» more  EUROCAST 2007»
15 years 11 months ago
Generation of Indexes for Compiling Efficient Parsers from Formal Specifications
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
Carlos Gómez-Rodríguez, Miguel A. Al...
155
Voted
EACL
2009
ACL Anthology
16 years 8 months ago
Learning Efficient Parsing
Gertjan van Noord
247
Voted
ENTCS
2010
122views more  ENTCS 2010»
15 years 4 months ago
Efficient Earley Parsing with Regular Right-hand Sides
We present a new variant of the Earley parsing algorithm capable of efficiently supporting context-free grammars with regular right hand-sides. We present the core state-machine d...
Trevor Jim, Yitzhak Mandelbaum