I want to use nltk.containers.Trie to perform simple operations like inserting a word into the trie, retrieving all words with a given prefix, find nodes with most descendants (i.e. most common pre...

I am starting to read about Trie. I got also references from friends here in: Tutorials on Trie I am not clear on the following: It seems that to go on and use a Trie one assumes that all the inp...

I have a collection of sets that I'd like to place in a trie. Normal tries are made of strings of elements - that is, the order of the elements is important. Sets lack a defined order, so there's ...

I'm looking to implement a typeahead/autocomplete search for fun. I have a few attributes within my schema in mongoDB, but I want to be able to search only by category, title, preview, or date. Th...

I am looking for the most efficient way to store binary strings in a data structure (insert function) and then when getting a string I want to check if some cyclic string of the given string is in ...

Tries are very fast data structures. Looking up a word takes O(sizeofword) time, while std::maps are self-balacing trees. Why aren't the standard C++ map templates implemented with tries. Is there ...

Suppose I have a character stream as my input. What is the most optimal way to find the longest palindromic substring after each new character is added without reprocessing the whole string all o...

I am confused as to how the Trie implementation saves space & stores data in most compact form! If you look at the tree below. When you store a character at any node, you also need to store a...

Anyone knows a ready-to-use trie [sic] implementation in Delphi? An optimized trie would be even better. Thanks in advance!

Possible Duplicate: Where do I find a standard Trie based map implementation in Java? I want to use Trie in Java, is there an implementation I can use ? (I tried looking for one but I...

I am looking to implement a VBA trie-building algorithm that is able to process a substantial English lexicon (~50,000 words) in a relatively short amount of time (less than 15-20 seconds). Since I...

Which data structure is best in terms of computational complexity to implement a dictionary of (key,val) items, which must support only following commands: Insert(key) - appends an item (key,val)...

I am using trie for the first time.I wanted to know which is the best data structure to use for a trie while deciding which is the next branch that one is supposed to traverse. I was looking among ...

What I’m trying to do: Build a mobile web application where the user can get help finding words to play when playing scrabble Users get word suggestions by typing in any amount of letters and 0 o...

I. Just implemented a kind of bitwise trie (based on nedtries), but my code does lot Of memory allocation (for each node). Contrary to my implemetation, nedtries are claimed to be fast , among ot...

I'm looking for a good data structure to represent strings of the form: Domain:Key1=Value1,Key2=Value2... Each "Domain" can contain the following pattern characters - *, ? (* - 0 or more charac...

Does anyone know of a really rock solid C++ library for suffix tries? Other than the one in Mummer? Ideally, I'd like: Some concept of concurrency. Good caching behavior. Permissive license. ...

I need to store millions of string with common prefixes (they don't correspond to file system paths) in a Set like structure in memory, and query the Collection to see if a path exists. e.g. /pat...

I need information about any standard python package which can be used for "longest prefix match" on URLs. I have gone through the two standard packages http://packages.python.org/PyTrie/#pytrie.St...

I need to have an array of python objects to be used in creating a trie datastructure. I need a structure that will be fixed-length like a tuple and mutable like a list. I don't want to use a list ...

I am working on an autocompletion script and was thinking about using a trie. My problem is I want everything that matches to be returned. So for example I type in the letter r I want all entries s...

Over the holidays, my family loves to play Boggle. Problem is, I'm terrible at Boggle. So I did what any good programmer would do: wrote a program to play for me. At the core of the algorithm is a...

I'm trying to build a Trie but on a mobile phone which has very limited memory capacity. I figured that it is probably best that the whole structure be stored on disk, and only loaded as necessary...

A patricia trie is the well-know, recommended data structure for storing IPv4 allocations/assignments and performing lookup. Is this true for IPv6 adddresses too? Just a deeper/taller trie to acco...

Lately I've been studying Patricia tries, and working with a really good C++ implementation which can be used as an STL Sorted Associative Container. Patricia tries differ from normal binary trees ...