Sciweavers

63 search results - page 1 / 13
» Efficient Computation of Throughput Values of Context-Free L...
Sort
View
WIA
2007
Springer
13 years 11 months ago
Efficient Computation of Throughput Values of Context-Free Languages
Didier Caucal, Jurek Czyzowicz, Wojciech Fraczak, ...
NAACL
2010
13 years 2 months ago
Efficient Parsing of Well-Nested Linear Context-Free Rewriting Systems
The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively f...
Carlos Gómez-Rodríguez, Marco Kuhlma...
RSCTC
2000
Springer
126views Fuzzy Logic» more  RSCTC 2000»
13 years 8 months ago
Evolutionary Parsing for a Probabilistic Context Free Grammar
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
Lourdes Araujo
ACL
2009
13 years 2 months ago
Efficient Minimum Error Rate Training and Minimum Bayes-Risk Decoding for Translation Hypergraphs and Lattices
Minimum Error Rate Training (MERT) and Minimum Bayes-Risk (MBR) decoding are used in most current state-of-theart Statistical Machine Translation (SMT) systems. The algorithms wer...
Shankar Kumar, Wolfgang Macherey, Chris Dyer, Fran...
HPDC
1998
IEEE
13 years 9 months ago
Matchmaking: Distributed Resource Management for High Throughput Computing
Conventional resource management systems use a system model to describe resources and a centralized scheduler to control their allocation. We argue that this paradigm does not ada...
Rajesh Raman, Miron Livny, Marvin H. Solomon