Sciweavers

135 search results - page 17 / 27
» A Deductive Approach to Dependency Parsing
Sort
View
ACL
2011
14 years 1 months ago
A Comparison of Loopy Belief Propagation and Dual Decomposition for Integrated CCG Supertagging and Parsing
Via an oracle experiment, we show that the upper bound on accuracy of a CCG parser is significantly lowered when its search space is pruned using a supertagger, though the supert...
Michael Auli, Adam Lopez
67
Voted
ICML
2009
IEEE
15 years 10 months ago
Polyhedral outer approximations with application to natural language parsing
Recent approaches to learning structured predictors often require approximate inference for tractability; yet its effects on the learned model are unclear. Meanwhile, most learnin...
André F. T. Martins, Noah A. Smith, Eric P....
SIGOPS
2010
80views more  SIGOPS 2010»
14 years 8 months ago
Mining dependency in distributed systems through unstructured logs analysis
Dependencies among system components are crucial to locating root errors in a distributed system. In this paper, we propose an approach to mine intercomponent dependencies from un...
Jian-Guang Lou, Qiang Fu, Yi Wang, Jiang Li
COLING
1996
14 years 11 months ago
Modularizing Codescriptive Grammars for Efficient Parsing
Unification-based theories of grammar allow to integrate different levels of linguistic descriptions in the common framework of typed feature structures. Dependencies among the le...
Walter Kasper, Hans-Ulrich Krieger
ACL
2012
13 years 22 hour ago
A Comparison of Chinese Parsers for Stanford Dependencies
Stanford dependencies are widely used in natural language processing as a semanticallyoriented representation, commonly generated either by (i) converting the output of a constitu...
Wanxiang Che, Valentin I. Spitkovsky, Ting Liu