Sciweavers

3145 search results - page 63 / 629
» A Computational Psycholinguistic Model of Natural Language P...
Sort
View
CORR
2010
Springer
101views Education» more  CORR 2010»
14 years 10 months ago
Computing the Least Fixed Point of Positive Polynomial Systems
We consider equation systems of the form X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where f1, . . . , fn are polynomials with positive real coefficients. In vector fo...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
CICLING
2003
Springer
15 years 3 months ago
Starting with Complex Primitives Pays Off
In setting up a formal system to specify a grammar formalism, the conventional (mathematical) wisdom is to start with primitives (basic primitive structures) as simple as possible...
Aravind K. Joshi
ACL
2012
13 years 6 days ago
Decoding Running Key Ciphers
There has been recent interest in the problem of decoding letter substitution ciphers using techniques inspired by natural language processing. We consider a different type of cla...
Sravana Reddy, Kevin Knight
HCI
2009
14 years 7 months ago
Partially Observable Markov Decision Process (POMDP) Technologies for Sign Language Based Human-Computer Interaction
Sign language (SL) recognition modules in human-computer interaction systems need to be both fast and reliable. In cases where multiple sets of features are extracted from the SL d...
Sylvie C. W. Ong, David Hsu, Wee Sun Lee, Hanna Ku...
ICPR
2010
IEEE
14 years 10 months ago
A Probabilistic Language Model for Hand Drawings
Probabilistic language models are critical to applications in natural language processing that include speech recognition, optical character recognition, and interfaces for text e...
Abdullah Akce, Timothy Bretl