Sciweavers

72 search results - page 4 / 15
» Two Kinds of Probabilistic Induction
Sort
View
CORR
2000
Springer
110views Education» more  CORR 2000»
14 years 9 months ago
Efficient probabilistic top-down and left-corner parsing
This paper examines efficient predictive broadcoverage parsing without dynamic programming. In contrast to bottom-up methods, depth-first top-down parsing produces partial parses ...
Brian Roark, Mark Johnson
ACL
2010
14 years 7 months ago
PCFGs, Topic Models, Adaptor Grammars and Learning Topical Collocations and the Structure of Proper Names
This paper establishes a connection between two apparently very different kinds of probabilistic models. Latent Dirichlet Allocation (LDA) models are used as "topic models&qu...
Mark Johnson
IFL
2001
Springer
137views Formal Methods» more  IFL 2001»
15 years 1 months ago
A Generic Programming Extension for Clean
Abstract. Generic programming enables the programmer to define functions by induction on the structure of types. Defined once, such a generic function can be used to generate a s...
Artem Alimarine, Marinus J. Plasmeijer
IJCAI
1997
14 years 10 months ago
Combining Probabilistic Population Codes
We study the problemof statisticallycorrect inference in networks whose basic representations are population codes. Population codes are ubiquitous in the brain, and involve the s...
Richard S. Zemel, Peter Dayan
ATAL
2010
Springer
14 years 10 months ago
Learning context conditions for BDI plan selection
An important drawback to the popular Belief, Desire, and Intentions (BDI) paradigm is that such systems include no element of learning from experience. In particular, the so-calle...
Dhirendra Singh, Sebastian Sardiña, Lin Pad...