Generate your own at
2010/11/30
http://huffman.ooz.ie/ - Huffman Tree Generator
Huffman Coding is a lossless data compression algorithm that builds weight-ordered binary tree of characters from a text and assigns each character a corresponding binary code value. The binary code depends on occurrence frequency of each character. This webapp is generating Huffman Trees out of short text snippets.
Generate your own at
Generate your own at
Subscribe to:
Post Comments (Atom)
3 comments:
Hello, thank you for your site. I really understood this algorithm with it.
Could you add default trees for usual languages (or the possibility to set the weight for each letters) ?
http://en.wikipedia.org/wiki/Letter_frequency#Relative_frequencies_of_letters_in_other_languages
Thank you
Could you please add support for non-alphabetic characters? Wikipedia links here for the tree of "TO BE OR NOT TO BE?" phrase, and the tree is generated for "TO BE OR NOT TO BE".
It's a minor problem, but still a little annoying.
The algorithm fails with such a well-known sentence:
THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG
;)
Post a Comment