Sciweavers

6829 search results - page 159 / 1366
» Quantitative Generalizations of Languages
Sort
View
NECO
2002
106views more  NECO 2002»
15 years 4 months ago
Learning Nonregular Languages: A Comparison of Simple Recurrent Networks and LSTM
In response to Rodriguez' recent article (2001) we compare the performance of simple recurrent nets and "Long Short-Term Memory" (LSTM) recurrent nets on context-fr...
Jürgen Schmidhuber, Felix A. Gers, Douglas Ec...
ACL
2009
15 years 2 months ago
Improved Smoothing for N-gram Language Models Based on Ordinary Counts
Kneser-Ney (1995) smoothing and its variants are generally recognized as having the best perplexity of any known method for estimating N-gram language models. Kneser-Ney smoothing...
Robert C. Moore, Chris Quirk
GVD
2009
125views Database» more  GVD 2009»
15 years 2 months ago
A quantum logic-based query processing approach for extending relational query languages
Evaluating a traditional database query against a data tuple returns a true on match and a false on mismatch. Unfortunately, there are many application scenarios where such an eva...
Sebastian Lehrack
159
Voted
IADIS
2009
15 years 2 months ago
Rendezvous-based associations: Language abstractions for robot collaboration
IONS FOR ROBOT COLLABORATION Bent Bruun Kristensen Maersk Mc-Kinney Moller Institute, University of Southern Denmark Campusvej 55, DK-5230, Odense M, Denmark Collaboration between...
Bent Bruun Kristensen
AGI
2011
14 years 8 months ago
Systematically Grounding Language through Vision in a Deep, Recurrent Neural Network
Human intelligence consists largely of the ability to recognize and exploit structural systematicity in the world, relating our senses simultaneously to each other and to our cogni...
Derek Monner, James A. Reggia