I've written a kart-trie in php. You can easily extend yourself the payload to count the word frequency.
> http://sourceforge.net/projects/kart-trie After you build your dictionary from your large file, you can easily find the highest frequency be recursively search the trie. It should be faster then a hash-Table, because the kart-trie is like an unbalance binary trie. The only difference between a kart-trie and a radix-trie, or a crip-bit-trie, is that it uses a hash-key to identify the payload. That makes is suitable for other data as well. On Oct 21, 3:35 pm, "Vinay..." <vinumars...@gmail.com> wrote: > how do u find 10 most repeating words on a large file containing words > in most efficient way...if it can also be done using heapsort plz post > ur answers.. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
