Sciweavers

1942 search results - page 119 / 389
» Parse
Sort
View
TSMC
1998
109views more  TSMC 1998»
15 years 6 months ago
Using graph parsing for automatic graph drawing
: This paper presents a procedure for automatically drawing directed graphs. Our system, CG, uses a unique clan-based graph decomposition to determine intrinsic substructures (clan...
Carolyn McCreary, Richard Chapman, Fwu-Shan Shieh
ACL
2010
15 years 4 months ago
Faster Parsing by Supertagger Adaptation
We propose a novel self-training method for a parser which uses a lexicalised grammar and supertagger, focusing on increasing the speed of the parser rather than its accuracy. The...
Jonathan K. Kummerfeld, Jessika Roesner, Tim Dawbo...
ACL
2010
15 years 4 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
ACL
2010
15 years 4 months ago
Hierarchical A* Parsing with Bridge Outside Scores
Hierarchical A (HA) uses of a hierarchy of coarse grammars to speed up parsing without sacrificing optimality. HA prioritizes search in refined grammars using Viterbi outside cost...
Adam Pauls, Dan Klein
ACL
2010
15 years 4 months ago
Importance of Linguistic Constraints in Statistical Dependency Parsing
Statistical systems with high accuracy are very useful in real-world applications. If these systems can capture basic linguistic information, then the usefulness of these statisti...
Bharat Ram Ambati