Re: Ternary search trees for Unicode dictionaries

From: Theodore H. Smith (
Date: Tue Nov 18 2003 - 22:56:54 EST

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

    >> We tend to use tries, which have very good performance
    >> characteristics.
    > See
    >> "bits of unicode" on my site:
    > You'll find many references of books, and papers available in PDF
    > format on:

    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).

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