Timeline for Database fuzzy search concept
Current License: CC BY-SA 2.5
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 9, 2011 at 14:01 | vote | accept | Tom | ||
| Mar 3, 2011 at 19:18 | comment | added | Steven Evers | @Glen: See the unique factorization theorem for uniqueness. | |
| Mar 3, 2011 at 18:51 | answer | added | Rachel | timeline score: 1 | |
| Mar 3, 2011 at 18:37 | answer | added | Tangurena | timeline score: 3 | |
| Mar 3, 2011 at 17:45 | answer | added | Ben DeMott | timeline score: 2 | |
| Mar 3, 2011 at 17:29 | answer | added | Martin Beckett | timeline score: 0 | |
| Mar 3, 2011 at 17:01 | comment | added | Tom | @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. | |
| Mar 3, 2011 at 16:59 | comment | added | glenatron | 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... | |
| Mar 3, 2011 at 16:19 | comment | added | Kit Menke | I'd love to have something like this for wordpress... | |
| Mar 3, 2011 at 16:12 | history | edited | Tom | CC BY-SA 2.5 |
added 195 characters in body
|
| Mar 3, 2011 at 16:05 | comment | added | Rich | Would be interesting to see how this compares with Trigram Search. | |
| Mar 3, 2011 at 15:58 | history | asked | Tom | CC BY-SA 2.5 |