Skip to main content
Software Engineering

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

5
  • Would be interesting to see how this compares with Trigram Search. Commented Mar 3, 2011 at 16:05
  • I'd love to have something like this for wordpress... Commented Mar 3, 2011 at 16:19
  • Does using primes for your hashing function make it impossible to have any word collisions that don't include identical methods? It seems that it should be possible to to have a long word with lots of low-value letters to it that hashed to the same value as a short word with a few high-value letters, but I don't know much number theory so it's probably well proven one way or another... Commented Mar 3, 2011 at 16:59
  • 1
    @Glen Afaik multiplying primes together always generates a unique number. Anagrams will collide though but idk how much of a problem that is, that's basically the point of it to find anagrams quickly. Commented Mar 3, 2011 at 17:01
  • @Glen: See the unique factorization theorem for uniqueness. Commented Mar 3, 2011 at 19:18