Sciweavers

4 search results - page 1 / 1
» Polyhedral outer approximations with application to natural ...
Sort
View
ICML
2009
IEEE
14 years 5 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....
EACL
2009
ACL Anthology
14 years 5 months ago
Translation as Weighted Deduction
We present a unified view of many translation algorithms that synthesizes work on deductive parsing, semiring parsing, and efficient approximate search algorithms. This gives rise...
Adam Lopez
LREC
2010
152views Education» more  LREC 2010»
13 years 6 months ago
Grammar Extraction from Treebanks for Hindi and Telugu
Grammars play an important role in many Natural Language Processing (NLP) applications. The traditional approach to creating grammars manually, besides being labor-intensive, has ...
Prasanth Kolachina, Sudheer Kolachina, Anil Kumar ...
AAAI
1992
13 years 6 months ago
On the Minimality and Decomposability of Constraint Networks
Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint netwo...
Peter van Beek