Sciweavers

279 search results - page 39 / 56
» An Evaluation Framework for Controlled Natural Languages
Sort
View
112
Voted
NAACL
2007
15 years 3 months ago
Data-Driven Graph Construction for Semi-Supervised Graph-Based Learning in NLP
Graph-based semi-supervised learning has recently emerged as a promising approach to data-sparse learning problems in natural language processing. All graph-based algorithms rely ...
Andrei Alexandrescu, Katrin Kirchhoff
TCS
2008
15 years 1 months ago
Modeling spiking neural networks
A notation for the functional specification of a wide range of neural networks consisting of temporal or non-temporal neurons, is proposed. The notation is primarily a mathematica...
Ioannis D. Zaharakis, Achilles D. Kameas
118
Voted
NAACL
2010
14 years 11 months ago
Discriminative Learning over Constrained Latent Representations
This paper proposes a general learning framework for a class of problems that require learning over latent intermediate representations. Many natural language processing (NLP) dec...
Ming-Wei Chang, Dan Goldwasser, Dan Roth, Vivek Sr...
ACL
2009
14 years 11 months ago
Concise Integer Linear Programming Formulations for Dependency Parsing
We formulate the problem of nonprojective dependency parsing as a polynomial-sized integer linear program. Our formulation is able to handle non-local output features in an effici...
André L. Martins, Noah A. Smith, Eric P. Xi...
HEURISTICS
2008
136views more  HEURISTICS 2008»
15 years 7 days ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet