Sciweavers

61 search results - page 2 / 13
» A Markov Language Learning Model for Finite Parameter Spaces
Sort
View
ICML
2005
IEEE
14 years 5 months ago
Exploiting syntactic, semantic and lexical regularities in language modeling via directed Markov random fields
We present a directed Markov random field (MRF) model that combines n-gram models, probabilistic context free grammars (PCFGs) and probabilistic latent semantic analysis (PLSA) fo...
Shaojun Wang, Shaomin Wang, Russell Greiner, Dale ...
AMAI
2004
Springer
13 years 10 months ago
Learning via Finitely Many Queries
This work introduces a new query inference model that can access data and communicate with a teacher by asking finitely many boolean queries in a language L. In this model the pa...
Andrew C. Lee
AAAI
1997
13 years 6 months ago
Reinforcement Learning with Time
This paper steps back from the standard infinite horizon formulation of reinforcement learning problems to consider the simpler case of finite horizon problems. Although finite ho...
Daishi Harada
ACL
1997
13 years 6 months ago
Co-evolution of Language and of the Language Acquisition Device
A new account of parameter setting during grammatical acquisition is presented in terms of Generalized Categorial Grammar embedded in a default inheritance hierarchy, providing a ...
Ted Briscoe
ACSC
2004
IEEE
13 years 8 months ago
Learning Models for English Speech Recognition
This paper reports on an experiment to determine the optimal parameters for a speech recogniser that is part of a computer aided instruction system for assisting learners of Engli...
Huayang Xie, Peter Andreae, Mengjie Zhang, Paul Wa...