| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unity (0) - 45 freq unty (1) - 4 freq units (1) - 21 freq unit (1) - 41 freq unite (1) - 11 freq tunity (1) - 1 freq sunty (2) - 2 freq uppity (2) - 6 freq sanity (2) - 5 freq aunty (2) - 42 freq prity (2) - 2 freq untidy (2) - 1 freq knit (2) - 17 freq anits (2) - 2 freq usty (2) - 1 freq 'city (2) - 1 freq nite (2) - 87 freq peity (2) - 4 freq unitin (2) - 2 freq onty (2) - 3 freq snite (2) - 2 freq runty (2) - 1 freq knits (2) - 3 freq unt (2) - 1 freq inty (2) - 21 freq |
unity (0) - 45 freq unit (1) - 41 freq unite (1) - 11 freq unty (1) - 4 freq unt (2) - 1 freq onty (2) - 3 freq inty (2) - 21 freq unto (2) - 8 freq inite (2) - 6 freq unyt (2) - 7 freq nite (2) - 87 freq aunty (2) - 42 freq nit (2) - 10 freq init (2) - 1 freq tunity (2) - 1 freq units (2) - 21 freq cnuty (3) - 1 freq inta (3) - 109 freq aunte (3) - 1 freq onti (3) - 8 freq ant (3) - 8 freq inte (3) - 129 freq nifty (3) - 3 freq nato (3) - 5 freq soity (3) - 1 freq |
SoundEx code - U530 unmet - 3 freq unity - 45 freq unto - 8 freq untae - 13 freq unty - 4 freq unite - 11 freq unit - 41 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 - 41 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.227394 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.450577 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.027107 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.036667 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.000865 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. |