Sciweavers

2621 search results - page 48 / 525
» Generalized Algorithms for Constructing Statistical Language...
Sort
View
FMSD
2007
101views more  FMSD 2007»
14 years 9 months ago
Timed substitutions for regular signal-event languages
In the classical framework of formal languages, a refinement n is modeled by a substitution and an abstraction by an inverse substitution. These mechanisms have been widely studie...
Béatrice Bérard, Paul Gastin, Antoin...
CP
2005
Springer
15 years 3 months ago
SPREAD: A Balancing Constraint Based on Statistics
Many combinatorial problems require of their solutions that they achieve a certain balance of given features. In the constraint programming literature, little has been written to s...
Gilles Pesant, Jean-Charles Régin
68
Voted
SIGIR
2008
ACM
14 years 9 months ago
Improving relevance feedback in language modeling with score regularization
We demonstrate that regularization can improve feedback in a language modeling framework. Categories and Subject Descriptors: H.3.3 Information Search and Retrieval: Relevance Fee...
Fernando D. Diaz
STOC
1994
ACM
108views Algorithms» more  STOC 1994»
15 years 1 months ago
Pseudorandomness for network algorithms
We define pseudorandom generators for Yao's twoparty communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive com...
Russell Impagliazzo, Noam Nisan, Avi Wigderson
MT
2006
116views more  MT 2006»
14 years 9 months ago
Dependency treelet translation: the convergence of statistical and example-based machine-translation?
We describe a novel approach to machine translation that combines the strengths of the two leading corpus-based approaches: Phrasal SMT and EBMT. We use a syntactically informed d...
Christopher Quirk, Arul Menezes