Skip to content

Look into n-gram entropy #6

Description

@evamaxfield

From Bill:

(word1, frequncy), (word2, frequency), ...
then trying to measure how far that distribution is from uniform
one simple nice way is entropy
P(word1)*log(P(word1)) + P(word2)*log(P(word2)) + ...
where P(word1) is just frequency of word1 / total words

It's nice because it measures how "unpredictable" the signal is. If most words are zero, and only a few words are common, then it's predictable. Or, if all words are exactly the same, then it's predictable. But if it's crazy town, then it's not predictable.

This seems like a decent resource: http://normal-extensions.com/2013/08/04/entropy-for-n-grams/

Activity

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Labels

    enhancementNew feature or request

    Type

    No type

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions