Re: Ternary search trees for Unicode dictionaries

From: Philippe Verdy (verdy_p@wanadoo.fr)
Date: Tue Nov 18 2003 - 14:15:54 EST

  • Next message: Peter Constable: "RE: Linguistic Diversity and National Unity: Language Ecology in Thailand"

    From: "Mark Davis" <mark.davis@jtcsv.com>
    > Sorry, I read your message too quickly; you are right -- tries are for
    character
    > lookup, not strings. Tom Emerson of Basis gave a very nice talk on data
    > structures for string lookup at the last UTC; you should contact him.

    I see abosolutely no reason why a trie cannot be used for string lookup.
    There already exists such implementation, such as this one in an
    open-sourced project:
    http://core.limewire.org/source/browse/core/com/limegroup/gnutella/util/Trie.java

    This archive was generated by hypermail 2.1.5 : Tue Nov 18 2003 - 15:25:12 EST