Sciweavers

2836 search results - page 7 / 568
» Parsing Algorithms and Metrics
Sort
View
ACL
1996
13 years 9 months ago
Incremental Parser Generation for Tree Adjoining Grammars
This paper describes the incremental generation of parse tables for the LR-type parsing of Tree Adjoining Languages (TALs). The algorithm presented handles modi cations to the inp...
Anoop Sarkar
CVPR
2008
IEEE
14 years 9 months ago
Superpixel lattices
Unsupervised over-segmentation of an image into superpixels is a common preprocessing step for image parsing algorithms. Ideally, every pixel within each superpixel region will be...
Alastair P. Moore, Simon Prince, Jonathan Warrell,...
DLT
2010
13 years 9 months ago
Fast Parsing for Boolean Grammars: A Generalization of Valiant's Algorithm
Abstract. The well-known parsing algorithm for the context-free grammars due to Valiant ("General context-free recognition in less than cubic time", Journal of Computer a...
Alexander Okhotin
CASCON
2006
117views Education» more  CASCON 2006»
13 years 9 months ago
A backtracking LR algorithm for parsing ambiguous context-dependent languages
Parsing context-dependent computer languages requires an ability to maintain and query data structures while parsing for the purpose of influencing the parse. Parsing ambiguous co...
Adrian D. Thurston, James R. Cordy
ACL
2008
13 years 9 months ago
A Deductive Approach to Dependency Parsing
We define a new formalism, based on Sikkel's parsing schemata for constituency parsers, that can be used to describe, analyze and compare dependency parsing algorithms. This ...
Carlos Gómez-Rodríguez, John A. Carr...