| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unity (0) - 45 freq units (1) - 21 freq unit (1) - 42 freq tunity (1) - 1 freq unty (1) - 4 freq unite (1) - 11 freq amity (2) - 2 freq inty (2) - 21 freq pity (2) - 44 freq snite (2) - 2 freq ceity (2) - 22 freq init (2) - 1 freq hnuty (2) - 1 freq peity (2) - 4 freq unites (2) - 4 freq nits (2) - 21 freq 'city (2) - 1 freq inimy (2) - 1 freq nite (2) - 87 freq knit (2) - 17 freq usty (2) - 1 freq nifty (2) - 3 freq unitit (2) - 29 freq unt (2) - 1 freq unst (2) - 12 freq |
unity (0) - 45 freq unite (1) - 11 freq unty (1) - 4 freq unit (1) - 42 freq unt (2) - 1 freq inite (2) - 6 freq aunty (2) - 42 freq nite (2) - 87 freq onty (2) - 3 freq unto (2) - 8 freq init (2) - 1 freq unyt (2) - 7 freq inty (2) - 21 freq tunity (2) - 1 freq units (2) - 21 freq nit (2) - 10 freq untee (3) - 1 freq nut (3) - 128 freq note (3) - 240 freq oanty (3) - 3 freq nt (3) - 34 freq nato (3) - 5 freq onte (3) - 18 freq net (3) - 87 freq untie (3) - 2 freq |
SoundEx code - U530 unmet - 3 freq unity - 45 freq unto - 8 freq untae - 13 freq unty - 4 freq unite - 11 freq unit - 42 freq unmade - 5 freq undae - 3 freq um-eet - 1 freq untie - 2 freq unwed - 1 freq und - 12 freq unmeet - 1 freq unyt - 7 freq €™und - 1 freq undo - 1 freq uinitie - 1 freq untee - 1 freq unt - 1 freq |
MetaPhone code - UNT unity - 45 freq unto - 8 freq untae - 13 freq unty - 4 freq unite - 11 freq unit - 42 freq undae - 3 freq untie - 2 freq und - 12 freq unyt - 7 freq €™und - 1 freq undo - 1 freq uinitie - 1 freq untee - 1 freq unt - 1 freq |
UNITY |
| Time to execute Levenshtein function - 0.237787 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.437108 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.031012 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.046098 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.001158 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. |