Comments on: Efficient auto-complete with a ternary search tree http://igoro.com/archive/efficient-auto-complete-with-a-ternary-search-tree/ On programming, technology, and random things of interest Fri, 11 May 2012 19:47:05 +0000 hourly 1 http://wordpress.org/?v=3.1 By: Anonymous http://igoro.com/archive/efficient-auto-complete-with-a-ternary-search-tree/comment-page-1/#comment-40917 Anonymous Mon, 05 Mar 2012 10:01:21 +0000 http://igoro.com/?p=177#comment-40917 Ternary Search Tree is cool. I have just released a key-value data store based on Ternary Search Tree. Here is the URL: http://code.google.com/p/tstdb/ Ternary Search Tree is cool. I have just released a key-value data store based on Ternary Search Tree. Here is the URL: http://code.google.com/p/tstdb/

]]> By: Rick http://igoro.com/archive/efficient-auto-complete-with-a-ternary-search-tree/comment-page-1/#comment-27022 Rick Wed, 02 Nov 2011 08:02:19 +0000 http://igoro.com/?p=177#comment-27022 Contains(string) will return if the word is there in tree or not How will autocomplete work?? i.e How will you generate the list of all words with prefix s(string) ? Can you suggest any iterative or recursive method for same Contains(string) will return if the word is there in tree or not
How will autocomplete work??
i.e How will you generate the list of all words with prefix s(string) ?

Can you suggest any iterative or recursive method for same

]]> By: Igor Ostrovsky http://igoro.com/archive/efficient-auto-complete-with-a-ternary-search-tree/comment-page-1/#comment-2303 Igor Ostrovsky Mon, 31 Jan 2011 22:03:29 +0000 http://igoro.com/?p=177#comment-2303 Fair enough. When I made that diagram, I was only thinking about making sure that the tree in the diagram holds the right strings. I didn't think about making the tree consistent with the implied insertion order. Fair enough. When I made that diagram, I was only thinking about making sure that the tree in the diagram holds the right strings. I didn’t think about making the tree consistent with the implied insertion order.

]]> By: A. Shiraz http://igoro.com/archive/efficient-auto-complete-with-a-ternary-search-tree/comment-page-1/#comment-2302 A. Shiraz Mon, 31 Jan 2011 21:38:58 +0000 http://igoro.com/?p=177#comment-2302 ok I assumed that was the order of insertion implied in the text. AB, ABBA, ABCD, and BCD. ok I assumed that was the order of insertion implied in the text.
AB, ABBA, ABCD, and BCD.

]]> By: Igor Ostrovsky http://igoro.com/archive/efficient-auto-complete-with-a-ternary-search-tree/comment-page-1/#comment-2298 Igor Ostrovsky Mon, 31 Jan 2011 09:39:50 +0000 http://igoro.com/?p=177#comment-2298 A. Shiraz: That depends on the order of insertions. If ABBA was inserted before ABCD then yes, ABBA would be one straight branch. A. Shiraz: That depends on the order of insertions. If ABBA was inserted before ABCD then yes, ABBA would be one straight branch.

]]> By: A. Shiraz http://igoro.com/archive/efficient-auto-complete-with-a-ternary-search-tree/comment-page-1/#comment-2297 A. Shiraz Mon, 31 Jan 2011 04:46:54 +0000 http://igoro.com/?p=177#comment-2297 Perhaps your ternary search tree is incorrect? ABBA should be one straight branch. I have re written this here : http://techpanacea.blogspot.com/2011/01/ternary-search-trees.html Perhaps your ternary search tree is incorrect? ABBA should be one straight branch. I have re written this here :

http://techpanacea.blogspot.co.....trees.html

]]> By: handbag on sale http://igoro.com/archive/efficient-auto-complete-with-a-ternary-search-tree/comment-page-1/#comment-1915 handbag on sale Mon, 13 Dec 2010 04:22:00 +0000 http://igoro.com/?p=177#comment-1915 Excellent story once again! Thumbs up:) Excellent story once again! Thumbs up:)

]]> By: john http://igoro.com/archive/efficient-auto-complete-with-a-ternary-search-tree/comment-page-1/#comment-1810 john Thu, 02 Dec 2010 13:44:52 +0000 http://igoro.com/?p=177#comment-1810 Great post! Nice! Great post! Nice!

]]> By: John Haugeland http://igoro.com/archive/efficient-auto-complete-with-a-ternary-search-tree/comment-page-1/#comment-679 John Haugeland Wed, 03 Feb 2010 02:20:11 +0000 http://igoro.com/?p=177#comment-679 Igor: If you want to support nearest match, the easiest thing to do is to store and search against lexemes (say, metaphone or soundex or whatever). If you want, you can take the Levenstein difference between the potential string and the source string as a quick sort criterion for small matches; it wouldn't scale, though, since you'd have to apply it to every source string available. For larger matching that scales on machines with a fair amount of memory available, the easiest way to deal with it is to knock out one lexeme from the word at a time, and match the gap with a GADDAG or something. Also, a suffix trie is a rather simpler way to resolve this quandry you're approaching. Igor: If you want to support nearest match, the easiest thing to do is to store and search against lexemes (say, metaphone or soundex or whatever). If you want, you can take the Levenstein difference between the potential string and the source string as a quick sort criterion for small matches; it wouldn’t scale, though, since you’d have to apply it to every source string available.

For larger matching that scales on machines with a fair amount of memory available, the easiest way to deal with it is to knock out one lexeme from the word at a time, and match the gap with a GADDAG or something.

Also, a suffix trie is a rather simpler way to resolve this quandry you’re approaching.

]]> By: Gallery of Processor Cache Effects http://igoro.com/archive/efficient-auto-complete-with-a-ternary-search-tree/comment-page-1/#comment-656 Gallery of Processor Cache Effects Tue, 02 Feb 2010 06:42:47 +0000 http://igoro.com/?p=177#comment-656 [...] Efficient auto-complete with a ternary search tree [...] [...] Efficient auto-complete with a ternary search tree [...]

]]>