| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| untae (0) - 13 freq intae (1) - 4690 freq untie (1) - 2 freq undae (1) - 3 freq ontae (1) - 350 freq entae (1) - 43 freq uptae (1) - 22 freq untape (1) - 1 freq untee (1) - 1 freq tntae (1) - 1 freq ustae (1) - 2 freq stae (2) - 1 freq huntan (2) - 4 freq unkan (2) - 22 freq suntan (2) - 2 freq upwae (2) - 1 freq uptap (2) - 1 freq intac (2) - 2 freq intaed (2) - 1 freq intaa (2) - 1 freq ante (2) - 1 freq gauntae (2) - 1 freq unhap (2) - 2 freq unease (2) - 6 freq unrael (2) - 1 freq |
untae (0) - 13 freq untee (1) - 1 freq ontae (1) - 350 freq entae (1) - 43 freq intae (1) - 4690 freq untie (1) - 2 freq auntie (2) - 157 freq onta (2) - 2 freq notae (2) - 1 freq inta (2) - 110 freq aintae (2) - 4 freq intay (2) - 3 freq intiae (2) - 1 freq aunte (2) - 1 freq inte (2) - 129 freq onte (2) - 18 freq unt (2) - 1 freq oantae (2) - 99 freq unto (2) - 8 freq intaea (2) - 1 freq unty (2) - 4 freq ustae (2) - 2 freq tntae (2) - 1 freq intue (2) - 1 freq unite (2) - 11 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 |
UNTAE |
| Time to execute Levenshtein function - 0.204485 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.348037 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.027299 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.037652 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.000928 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. |