Sciweavers

1942 search results - page 11 / 389
» Parse
Sort
View
ACL
2006
13 years 11 months ago
Exploring the Potential of Intractable Parsers
We revisit the idea of history-based parsing, and present a history-based parsing framework that strives to be simple, general, and flexible. We also provide a decoder for this pr...
Mark Hopkins, Jonas Kuhn
IJCNLP
2004
Springer
14 years 3 months ago
Iterative CKY Parsing for Probabilistic Context-Free Grammars
This paper presents an iterative CKY parsing algorithm for probabilistic contextfree grammars (PCFG). This algorithm enables us to prune unnecessary edges produced during parsing,...
Yoshimasa Tsuruoka, Jun-ichi Tsujii
ESOP
2009
Springer
14 years 1 months ago
Verified, Executable Parsing
We describe the mechanisation of SLR parsing, covering background properties of context-free languages and grammars, as well as the construction of an SLR automaton. Among the vari...
Aditi Barthwal, Michael Norrish
ACL
2007
13 years 11 months ago
Constituent Parsing with Incremental Sigmoid Belief Networks
We introduce a framework for syntactic parsing with latent variables based on a form of dynamic Sigmoid Belief Networks called Incremental Sigmoid Belief Networks. We demonstrate ...
Ivan Titov, James Henderson
LREC
2008
74views Education» more  LREC 2008»
13 years 11 months ago
Robust Parsing with a Large HPSG Grammar
In this paper we propose a partial parsing model which achieves robust parsing with a large HPSG grammar. Constraint-based precision grammars, like the HPSG grammar we are using f...
Yi Zhang 0003, Valia Kordoni