Sciweavers

2835 search results - page 211 / 567
» Automatic Question Answering
Sort
View
JSYML
2007
95views more  JSYML 2007»
15 years 4 months ago
Applications of Kolmogorov complexity to computable model theory
In this paper we answer the following well-known open question in computable model theory. Does there exist a computable not ℵ0-categorical saturated structure with a unique com...
Bakhadyr Khoussainov, Pavel Semukhin, Frank Stepha...
NDJFL
1998
81views more  NDJFL 1998»
15 years 4 months ago
An Undecidable Linear Order That Is n-Decidable for All n
A linear order is n-decidable if its universe is N and the relations determined by n formulas are uniformly computable. This means that there is a computable procedure which, when ...
John Chisholm, Michael Moses
JMLR
2010
104views more  JMLR 2010»
14 years 11 months ago
How to Explain Individual Classification Decisions
After building a classifier with modern tools of machine learning we typically have a black box at hand that is able to predict well for unseen data. Thus, we get an answer to the...
David Baehrens, Timon Schroeter, Stefan Harmeling,...
AAAI
2011
14 years 4 months ago
Analogical Dialogue Acts: Supporting Learning by Reading Analogies in Instructional Texts
Analogy is heavily used in instructional texts. We introduce the concept of analogical dialogue acts (ADAs), which represent the roles utterances play in instructional analogies. ...
David Michael Barbella, Kenneth D. Forbus
LREC
2008
81views Education» more  LREC 2008»
15 years 6 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