Sciweavers

66 search results - page 13 / 14
» An Optimal Tabular Parsing Algorithm
Sort
View
CEC
2010
IEEE
13 years 9 months ago
Evolving natural language grammars without supervision
Unsupervised grammar induction is one of the most difficult works of language processing. Its goal is to extract a grammar representing the language structure using texts without a...
Lourdes Araujo, Jesus Santamaria
EMNLP
2008
13 years 9 months ago
Online Large-Margin Training of Syntactic and Structural Translation Features
Minimum-error-rate training (MERT) is a bottleneck for current development in statistical machine translation because it is limited in the number of weights it can reliably optimi...
David Chiang, Yuval Marton, Philip Resnik
EMNLP
2011
12 years 7 months ago
Training a Log-Linear Parser with Loss Functions via Softmax-Margin
Log-linear parsing models are often trained by optimizing likelihood, but we would prefer to optimise for a task-specific metric like Fmeasure. Softmax-margin is a convex objecti...
Michael Auli, Adam Lopez
CVPR
2007
IEEE
14 years 9 months ago
Combining Static Classifiers and Class Syntax Models for Logical Entity Recognition in Scanned Historical Documents
Class syntax can be used to 1) model temporal or locational evolvement of class labels of feature observation sequences, 2) correct classification errors of static classifiers if ...
Song Mao, Praveer Mansukhani, George R. Thoma
PODS
2003
ACM
132views Database» more  PODS 2003»
14 years 8 months ago
The view selection problem for XML content based routing
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
Ashish Kumar Gupta, Dan Suciu, Alon Y. Halevy