| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unhook (0) - 1 freq unhool (1) - 3 freq unholy (2) - 4 freq unhooked (2) - 1 freq shook (2) - 189 freq nyook (2) - 3 freq uncrook (2) - 1 freq nook (2) - 8 freq hook (2) - 61 freq chook (2) - 4 freq snook (2) - 2 freq unlock (2) - 7 freq 'hoo (3) - 79 freq flook (3) - 1 freq €œsook (3) - 1 freq snowk (3) - 6 freq whoo (3) - 5 freq ahoot (3) - 1 freq union (3) - 192 freq indoor (3) - 6 freq shoop (3) - 1 freq outlook (3) - 3 freq knock (3) - 113 freq unhurt (3) - 1 freq noooo (3) - 1 freq |
unhook (0) - 1 freq unhool (2) - 3 freq nook (3) - 8 freq nyook (3) - 3 freq chook (3) - 4 freq hook (3) - 61 freq unhooked (3) - 1 freq unholy (3) - 4 freq shook (3) - 189 freq anyhoos (4) - 13 freq unlaek (4) - 3 freq unalik (4) - 3 freq onyhoo (4) - 8 freq nock (4) - 14 freq nanook (4) - 1 freq chooky (4) - 6 freq shok (4) - 1 freq chouk (4) - 1 freq anyhoo (4) - 9 freq houk (4) - 1 freq noak (4) - 3 freq shoak (4) - 4 freq unk (4) - 1 freq nok (4) - 4 freq unlik (4) - 1 freq |
SoundEx code - U520 unco - 328 freq unca - 12 freq unique - 52 freq uneasy - 18 freq umes - 1 freq unis - 2 freq unease - 6 freq 'unco - 2 freq unce - 7 freq unhook - 1 freq unesco - 9 freq un's - 1 freq 'unesco - 3 freq unwise - 1 freq unk - 1 freq -ung - 1 freq uneco - 2 freq unich - 1 freq €œunco - 1 freq €™uang - 2 freq umwyys - 1 freq ung - 1 freq unsee - 1 freq |
MetaPhone code - UNHK unhook - 1 freq |
UNHOOK |
| Time to execute Levenshtein function - 0.222327 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.334122 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.027782 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.037339 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.000915 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |