Sciweavers

621 search results - page 37 / 125
» Parsing As Tree Traversal
Sort
View
ACL
2012
12 years 9 days ago
Higher-order Constituent Parsing and Parser Combination
This paper presents a higher-order model for constituent parsing aimed at utilizing more local structural context to decide the score of a grammar rule instance in a parse tree. E...
Xiao Chen, Chunyu Kit
ICIP
1999
IEEE
14 years 11 months ago
Unsupervised Progressive Parsing of Poisson Fields Using Minimum Description Length, Criteria
This paper describes novel methods for estimating piecewise homogeneous Poisson elds based on minimum description length (MDL) criteria. By adopting a coding-theoretic approach, o...
Mário A. T. Figueiredo, Robert D. Nowak
NIPS
2001
13 years 11 months ago
A Bayesian Model Predicts Human Parse Preference and Reading Times in Sentence Processing
Narayanan and Jurafsky (1998) proposed that human language comprehension can be modeled by treating human comprehenders as Bayesian reasoners, and modeling the comprehension proce...
S. Narayanan, Daniel Jurafsky
CORR
1998
Springer
142views Education» more  CORR 1998»
13 years 9 months ago
How to define a context-free backbone for DGs: Implementing a DG in the LFG formalism
This paper presents a multidimensional Dependency Grammar (DG), which decouples the dependency tree from word order, such that surface ordering is not determined by traversing the...
Norbert Bröker
ACL
1998
13 years 11 months ago
An Alternative LR Algorithm for TAGs
We present a new LR algorithm for treeadjoining grammars. It is an alternative to an existing algorithm that is shown to be incorrect. Furthermore, the new algorithm is much simpl...
Mark-Jan Nederhof