Sciweavers

21 search results - page 1 / 5
» Dynamic Programming as Frame for Efficient Parsing
Sort
View
SCCC
1998
IEEE
13 years 9 months ago
Dynamic Programming as Frame for Efficient Parsing
The last few years have seen a renewal of interest in the consideration of dynamic programming in compiler technology. This is due to the compactness of the representations, which...
Manuel Vilares Ferro, Miguel A. Alonso, David Cabr...
CORR
2000
Springer
110views Education» more  CORR 2000»
13 years 4 months ago
Efficient probabilistic top-down and left-corner parsing
This paper examines efficient predictive broadcoverage parsing without dynamic programming. In contrast to bottom-up methods, depth-first top-down parsing produces partial parses ...
Brian Roark, Mark Johnson
ACL
1989
13 years 6 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
ACL
2010
13 years 3 months ago
Dynamic Programming for Linear-Time Incremental Parsing
Incremental parsing techniques such as shift-reduce have gained popularity thanks to their efficiency, but there remains a major problem: the search is greedy and only explores a ...
Liang Huang, Kenji Sagae
19
Voted
ECCV
2002
Springer
14 years 6 months ago
Learning to Parse Pictures of People
The detection of people is one of the foremost problems for indexing, browsing and retrieval of video. The main difficulty is the large appearance variations caused by action, clot...
Rémi Ronfard, Cordelia Schmid, Bill Triggs