17 search results - page 3 / 4 » Anytime Algorithms for Speech Parsing |
IPPS
2003
IEEE
14 years 1 months ago
2003
IEEE
The MiPPS library supports a hybrid model of parallel programming. The library is targeted at commodity multiprocessors, with support for clusters. The implementation of the concu...
ACL
1998
13 years 10 months ago
1998
Word graphs are able to represent a large number of different utterance hypotheses in a very compact manner. However, usually they contain a huge amount of redundancy in terms of ...
ACL
2007
13 years 10 months ago
2007
This paper presents a comparative study of five parameter estimation algorithms on four NLP tasks. Three of the five algorithms are well-known in the computational linguistics com...
CEC
2010
IEEE
13 years 9 months ago
2010
IEEE
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...
EMNLP
2011
12 years 8 months ago
2011
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...