Sciweavers

284 search results - page 6 / 57
» Efficient Parsing for French
Sort
View
ACL
1989
13 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
EUROCAST
2007
Springer
122views Hardware» more  EUROCAST 2007»
13 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...
EACL
2009
ACL Anthology
14 years 8 months ago
Learning Efficient Parsing
Gertjan van Noord
ENTCS
2010
122views more  ENTCS 2010»
13 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
ACL
1994
13 years 8 months ago
Decision Lists for Lexical Ambiguity Resolution: Application to Accent Restoration in Spanish and French
This paper presents a statistical decision procedure for lexical ambiguity resolution. The algorithm exploits both local syntactic patterns and more distant collocational evidence...
David Yarowsky