| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unite (0) - 11 freq united (1) - 75 freq unites (1) - 4 freq snite (1) - 2 freq unit (1) - 41 freq unitet (1) - 3 freq inite (1) - 6 freq unity (1) - 45 freq nite (1) - 87 freq units (1) - 21 freq grunite (2) - 6 freq endite (2) - 1 freq unich (2) - 1 freq quite (2) - 475 freq slite (2) - 4 freq wite (2) - 3 freq twite (2) - 2 freq untee (2) - 1 freq bite (2) - 156 freq uni (2) - 51 freq uize (2) - 14 freq aite (2) - 4 freq 'nice (2) - 5 freq inte (2) - 129 freq spite (2) - 72 freq |
unite (0) - 11 freq unity (1) - 45 freq nite (1) - 87 freq unit (1) - 41 freq inite (1) - 6 freq untie (2) - 2 freq uinitie (2) - 1 freq ante (2) - 1 freq unty (2) - 4 freq unyt (2) - 7 freq aunte (2) - 1 freq unto (2) - 8 freq onte (2) - 18 freq nate (2) - 9 freq nyte (2) - 1 freq init (2) - 1 freq unt (2) - 1 freq untae (2) - 13 freq note (2) - 238 freq inte (2) - 129 freq inate (2) - 1 freq nit (2) - 10 freq units (2) - 21 freq snite (2) - 2 freq unites (2) - 4 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 |
UNITE |
| Time to execute Levenshtein function - 0.198437 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.353679 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.027524 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.037016 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.000814 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. |