Sciweavers

672 search results - page 46 / 135
» Words and forbidden factors
Sort
View
DAARC
2007
Springer
137views Algorithms» more  DAARC 2007»
15 years 6 months ago
Anaphora Resolution as Equality by Default
The resolution of anaphora is dependent on a number of factors discussed in the literature: syntactic parallelism, topicality, etc. A system that attempts to resolve anaphora will ...
Ariel Cohen
STACS
1992
Springer
15 years 3 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
LREC
2008
81views Education» more  LREC 2008»
15 years 1 months ago
Speech Errors on Frequently Observed Homophones in French: Perceptual Evaluation vs Automatic Classification
The present contribution aims at increasing our understanding of automatic speech recognition (ASR) errors involving frequent homophone or almost homophone words by confronting th...
Rena Nemoto, Ioana Vasilescu, Martine Adda-Decker
PADL
2010
Springer
15 years 8 months ago
Lazy Explanations for Constraint Propagators
Explanations are a technique for reasoning about constraint propagation, which have been applied in many learning, backjumping and user-interaction algorithms for constraint progra...
Ian P. Gent, Ian Miguel, Neil C. A. Moore
KI
2009
Springer
15 years 6 months ago
Maximum a Posteriori Estimation of Dynamically Changing Distributions
This paper presents a sequential state estimation method with arbitrary probabilistic models expressing the system’s belief. Probabilistic models can be estimated by Maximum a po...
Michael Volkhardt, Sören Kalesse, Steffen M&u...