Sciweavers

2047 search results - page 355 / 410
» The limits of speech recognition
Sort
View
ACL
2006
13 years 9 months ago
Highly Constrained Unification Grammars
Unification grammars are widely accepted as an expressive means for describing the structure of natural languages. In general, the recognition problem is undecidable for unificati...
Daniel Feinstein, Shuly Wintner
EMNLP
2004
13 years 9 months ago
Scaling Web-based Acquisition of Entailment Relations
Paraphrase recognition is a critical step for natural language interpretation. Accordingly, many NLP applications would benefit from high coverage knowledge bases of paraphrases. ...
Idan Szpektor, Hristo Tanev, Ido Dagan, Bonaventur...
DLT
2003
13 years 9 months ago
Boolean Grammars
A new generalization of context-free grammars is introduced: Boolean grammars allow the use of all set-theoretic operations as an integral part of the formalism of rules. Rigorous...
Alexander Okhotin
AVI
2008
13 years 8 months ago
Illustrative halos in information visualization
In many interactive scenarios, the fast recognition and localization of crucial information is very important to effectively perform a task. However, in information visualization...
Martin Luboschik, Heidrun Schumann
PR
2006
65views more  PR 2006»
13 years 7 months ago
Why direct LDA is not equivalent to LDA
In this paper, we present counterarguments against the direct LDA algorithm (D-LDA), which was previously claimed to be equivalent to Linear Discriminant Analysis (LDA). We show f...
Hui Gao, James W. Davis