John Meacham wrote:
In particular, a Huffman coding:
http://en.wikipedia.org/wiki/Huffman_coding
is ideal for this (assuming you just are taking advantage of frequency
analysis). A dynamic Huffman Tree will even adapt as it is being used to
whatever the current language is. Huffman Trees are easy
On Mon, Jun 21, 2010 at 06:50:41PM -0300, Maurício CA wrote:
> bitspeak is a small proof of concept application that allows
> writing text using only two commands (yes/no, 1/2, top/down etc.).
> It is intended to show how people with disabilities similar to
> Stephen Hawking's (i.e., good cognitiv
2010/6/21 Maurício CA :
> Hi, all,
>
> bitspeak is a small proof of concept application that allows
> writing text using only two commands (yes/no, 1/2, top/down etc.).
> It is intended to show how people with disabilities similar to
> Stephen Hawking's (i.e., good cognitive hability, but very few
On 21.06.2010 23:50, Maurício CA wrote:
Hi, all,
bitspeak is a small proof of concept application that allows
writing text using only two commands (yes/no, 1/2, top/down etc.).
Looks cool! Did you forget any dependencies tho? I get the following error:
0:16 nils` cabal update
Downloading th
Hi, all,
bitspeak is a small proof of concept application that allows
writing text using only two commands (yes/no, 1/2, top/down etc.).
It is intended to show how people with disabilities similar to
Stephen Hawking's (i.e., good cognitive hability, but very few
movements) can write text.
http
