| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unique (0) - 52 freq undique (1) - 1 freq unite (2) - 11 freq clique (2) - 3 freq untrue (2) - 2 freq antique (2) - 9 freq untiques (2) - 3 freq uniquely (2) - 4 freq nidge (3) - 2 freq unsafe (3) - 2 freq unease (3) - 6 freq resque (3) - 1 freq unit (3) - 42 freq braque (3) - 1 freq unce (3) - 7 freq unites (3) - 4 freq uncut (3) - 1 freq unul (3) - 1 freq intue (3) - 1 freq unwise (3) - 1 freq risque (3) - 1 freq untae (3) - 13 freq unwyve (3) - 2 freq snipe (3) - 10 freq union (3) - 192 freq |
unique (0) - 52 freq undique (2) - 1 freq uniquely (3) - 4 freq unite (3) - 11 freq antique (3) - 9 freq untie (4) - 2 freq niece (4) - 11 freq onie (4) - 778 freq niu (4) - 1 freq niuc (4) - 1 freq uinitie (4) - 1 freq nice (4) - 426 freq nise (4) - 1 freq unity (4) - 45 freq inimie (4) - 2 freq nieve (4) - 29 freq unum (4) - 1 freq opaque (4) - 6 freq uni (4) - 53 freq unsee (4) - 1 freq inite (4) - 6 freq nike (4) - 6 freq nite (4) - 87 freq une (4) - 4 freq uinioun (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 - UNK unco - 328 freq unca - 12 freq unique - 52 freq 'unco - 2 freq unk - 1 freq -ung - 1 freq uneco - 2 freq €œunco - 1 freq €™uang - 2 freq ung - 1 freq |
UNIQUE |
| Time to execute Levenshtein function - 0.241967 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.389769 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.028234 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.039272 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.000973 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. |