| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unit (0) - 42 freq unfit (1) - 1 freq unyt (1) - 7 freq nit (1) - 10 freq unite (1) - 11 freq knit (1) - 17 freq unrit (1) - 1 freq units (1) - 21 freq unity (1) - 45 freq init (1) - 1 freq unt (1) - 1 freq unis (1) - 2 freq uni (1) - 53 freq usit (1) - 4 freq unst (1) - 12 freq knif (2) - 1 freq muntit (2) - 3 freq writ (2) - 51 freq duntit (2) - 26 freq wit (2) - 210 freq seit (2) - 1 freq rnin (2) - 1 freq ani' (2) - 1 freq tunis (2) - 1 freq ont (2) - 5 freq |
unit (0) - 42 freq unity (1) - 45 freq init (1) - 1 freq unt (1) - 1 freq unite (1) - 11 freq unyt (1) - 7 freq nit (1) - 10 freq nait (2) - 1 freq nt (2) - 34 freq nite (2) - 87 freq anet (2) - 1 freq ant (2) - 8 freq int (2) - 31 freq not (2) - 733 freq ent (2) - 3 freq unty (2) - 4 freq unto (2) - 8 freq aunt (2) - 76 freq nut (2) - 128 freq ont (2) - 5 freq inite (2) - 6 freq untie (2) - 2 freq anat (2) - 1 freq nat (2) - 21 freq units (2) - 21 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 |
UNIT |
| Time to execute Levenshtein function - 0.163188 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.303333 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.026888 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.036801 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.000892 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. |