{
  "id": "cond-mat/0205521",
  "version": "v2",
  "published": "2002-05-24T20:08:41.000Z",
  "updated": "2003-01-11T18:13:48.000Z",
  "title": "On an Application of Relative Entropy",
  "authors": [
    "Dmitry V. Khmelev",
    "William J. Teahan"
  ],
  "comment": "1 page, to be published in PRL",
  "categories": [
    "cond-mat.stat-mech",
    "cond-mat.dis-nn"
  ],
  "abstract": "We describe general approach to classification of character sequences (texts, DNA) using relative entropy estimated by off-the-shelf compression and Markov Chains and find them precise enough. We also notice that the method for estimating relative entropy described in the paper cond-mat/0108530 \"Language Trees...\" by D. Benedetto et al. was considered earlier and was found to be easily surpassed by the simple and computationally effective first order Markov Chain approach.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2003-01-11T18:13:48.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "relative entropy",
      "first order markov chain approach",
      "application",
      "effective first order markov chain",
      "computationally effective first order markov"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 1,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2002cond.mat..5521K"
    }
  }
}