Very predictive ngrams for space-limited probabilistic models

Paul R. Cohen, Charles A. Sutton

Research output: Contribution to journalArticle

1 Scopus citations

Abstract

In sequential prediction tasks, one repeatedly tries to predict the next element in a sequence. A classical way to solve these problems is to fit an order-n Markov model to the data, but fixed-order models are often bigger than they need to be. In a fixed-order model, all predictors are of length n, even if a shorter predictor would work just as well. We present a greedy algorithm, VPR, for finding variable-length predictive rules. Although VPR is not optimal, we show that on English text, it performs similarly to fixed-order models but uses fewer parameters.

Original languageEnglish (US)
Pages (from-to)134-142
Number of pages9
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2810
StatePublished - Dec 1 2003

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Very predictive ngrams for space-limited probabilistic models'. Together they form a unique fingerprint.

Cite this