Sciweavers

1548 search results - page 28 / 310
» Computational Approaches to Sentence Completion
Sort
View
LFP
1992
78views more  LFP 1992»
15 years 28 days ago
A Syntactic Approach to Fixed Point Computation on Finite Domains
We propose a syntactic approach to performing fixed point computation on finite domains. Finding fixed points in finite domains for monotonic functions is an essential task when c...
Tyng-Ruey Chuang, Benjamin Goldberg
ICML
2007
IEEE
16 years 17 days ago
Fast and effective kernels for relational learning from texts
In this paper, we define a family of syntactic kernels for automatic relational learning from pairs of natural language sentences. We provide an efficient computation of such mode...
Alessandro Moschitti, Fabio Massimo Zanzotto
86
Voted
INTERSPEECH
2010
14 years 6 months ago
A classifier-based target cost for unit selection speech synthesis trained on perceptual data
Our goal is to automatically learn a perceptually-optimal target cost function for a unit selection speech synthesiser. The approach we take here is to train a classifier on human...
Volker Strom, Simon King
ACL
2009
14 years 9 months ago
A Graph-based Semi-Supervised Learning for Question-Answering
We present a graph-based semi-supervised learning for the question-answering (QA) task for ranking candidate sentences. Using textual entailment analysis, we obtain entailment sco...
Asli Çelikyilmaz, Marcus Thint, Zhiheng Hua...
ICPR
2000
IEEE
15 years 4 months ago
JKanji: Wavelet-Based Interactive Kanji Completion
JKanji is an interactive character completion system that provides stroke-order-independent recognition of complex hand-written glyphs such as Japanese kanji or Chinese hanzi. As ...
Robert G. Stockton, Rahul Sukthankar