From: MikkelFJ <mikkelfj-anti-spam@...>
Date: 2003-05-28T07:52:39+09:00
Subject: Re: Binary Tree vs. Hash


"Dave Thomas" <dave@pragprog.com> wrote in message
news:3ED3DFE2.2090205@pragprog.com...
> >>Are you aware that there are efficient boolean operations for counting
>
> Um, yes - I reference and use them in the article...

Damn ... must read more carefully ...  I must have skipped way down or
something...??
Thats what you get when you have an attention span of a kitten catching
flies.

BTW: I've found the article on finite state machines as tries - low memory
overhead, in particular, the fsm can be updated incrementally and it is fast
to do so:

Incremental Construction of Minimal Acyclic Finite-State Automata
http://acl.ldc.upenn.edu/J/J00/J00-1002.pdf

How to squeeze a lexicon
http://sun.iinf.polsl.gliwice.pl/~mciura/lexicon.pdf

http://www.google.com/search?sourceid=navclient&hl=da&ie=UTF-8&oe=UTF-8&q=Da
ciuk+minimal+tries

(Robert Feldt posted a link here at c.l.r. a year back)
http://lampwww.epfl.ch/papers/idealhashtrees.pdf