What is the space efficiency of a directed acyclic word graph (dawg)? and is there a javascript implementation?
<p>I have a dictionary of keywords that I want to make available for autocomplete/suggestion on the client side of a web application.  The ajax turnaround introduces too much latency, so it would nice to store the entire word list on the client.</p>

<p>The list could be hundreds of thousands of words, maybe a couple of million.  I did a little bit of research, and it seams that a dawg structure would provide space and lookup efficiency, but I can't find real world numbers.</p>

<p>Also, feel free to suggest other possibilities for achieving the same functionality.</p>
