Sciweavers

681 search results - page 51 / 137
» Parsing as Natural Deduction
Sort
View
ACL
1998
14 years 11 months ago
Eliminative Parsing with Graded Constraints
Abstract Resource adaptlvity" Because the sets of strucNatural language parsing is conceived to be a procedure of disambiguation, which successively reduces an initially total...
Johannes Heinecke, Jürgen Kunze, Wolfgang Men...
CORR
1998
Springer
84views Education» more  CORR 1998»
14 years 9 months ago
A Variant of Earley Parsing
The Earley algorithm is a widely used parsing method in natural language processing applications. We introduce a variant of Earley parsing that is based on a “delayed” recognit...
Mark-Jan Nederhof, Giorgio Satta
EMNLP
2010
14 years 7 months ago
Dual Decomposition for Parsing with Non-Projective Head Automata
This paper introduces algorithms for nonprojective parsing based on dual decomposition. We focus on parsing algorithms for nonprojective head automata, a generalization of head-au...
Terry Koo, Alexander M. Rush, Michael Collins, Tom...
EMNLP
2009
14 years 7 months ago
An Alternative to Head-Driven Approaches for Parsing a (Relatively) Free Word-Order Language
Applying statistical parsers developed for English to languages with freer wordorder has turned out to be harder than expected. This paper investigates the adequacy of different s...
Reut Tsarfaty, Khalil Sima'an, Remko Scha
EACL
2006
ACL Anthology
14 years 11 months ago
Lexicalising Word Order Constraints for Implemented Linearisation Grammar
This paper presents a way in which a lexicalised HPSG grammar can handle word order constraints in a computational parsing system, without invoking an additional layer of represen...
Yo Sato