Sciweavers

1826 search results - page 70 / 366
» Using Random Forests in the Structured Language Model
Sort
View
EMNLP
2010
13 years 6 months ago
Storing the Web in Memory: Space Efficient Language Models with Constant Time Retrieval
We present three novel methods of compactly storing very large n-gram language models. These methods use substantially less space than all known approaches and allow n-gram probab...
David Guthrie, Mark Hepple
IJAIT
2006
136views more  IJAIT 2006»
13 years 8 months ago
Model Checking for Multiagent Systems: the Mable Language and its Applications
We present MABLE, a fully implemented programming language for multiagent systems, which is intended to support the automatic verification of such systems via model checking. In a...
Michael Wooldridge, Marc-Philippe Huget, Michael F...
ACL
2007
13 years 10 months ago
Randomised Language Modelling for Statistical Machine Translation
A Bloom filter (BF) is a randomised data structure for set membership queries. Its space requirements are significantly below lossless information-theoretic lower bounds but it ...
David Talbot, Miles Osborne
ICML
2007
IEEE
14 years 9 months ago
Incremental Bayesian networks for structure prediction
We propose a class of graphical models appropriate for structure prediction problems where the model structure is a function of the output structure. Incremental Sigmoid Belief Ne...
Ivan Titov, James Henderson
BIOINFORMATICS
2010
94views more  BIOINFORMATICS 2010»
13 years 8 months ago
Globally, unrelated protein sequences appear random
Motivation: To test whether protein folding constraints and secondary structure sequence preferences significantly reduce the space of amino acid words in proteins, we compared th...
Daniel T. Lavelle, William R. Pearson