Re: Ternary search trees for Unicode dictionaries

From: Theodore H. Smith (delete@elfdata.com)
Date: Tue Nov 18 2003 - 22:56:54 EST

Next message: Doug Ewell: "Re: Ternary search trees for Unicode dictionaries"

Previous message: jameskass@att.net: "RE: Definitions"
Maybe in reply to: Theodore H. Smith: "Re: Ternary search trees for Unicode dictionaries"
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Mail actions: [ respond to this message ] [ mail a new topic ]

>> We tend to use tries, which have very good performance
>> characteristics.
> See
>> "bits of unicode" on my site: www.macchiato.com.
>
> You'll find many references of books, and papers available in PDF
> format on:
> http://citeseer.nj.nec.com/147026.html

Thanks so much. This is actually the best article I've read. It seems
to be written by someone with proper practical experience with what
they are doing! (Unlike a lot of the other alternatives on the web,
which seem rather unpractical).

Next message: Doug Ewell: "Re: Ternary search trees for Unicode dictionaries"
Previous message: jameskass@att.net: "RE: Definitions"
Maybe in reply to: Theodore H. Smith: "Re: Ternary search trees for Unicode dictionaries"
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Mail actions: [ respond to this message ] [ mail a new topic ]

This archive was generated by hypermail 2.1.5 : Tue Nov 18 2003 - 23:45:36 EST