| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| und (0) - 12 freq fund (1) - 565 freq uid (1) - 1 freq ‘nd (1) - 1 freq fnd (1) - 1 freq wund (1) - 104 freq qnd (1) - 1 freq hnd (1) - 3 freq un (1) - 31 freq mnd (1) - 1 freq and (1) - 25387 freq pnd (1) - 1 freq upd (1) - 1 freq sund (1) - 2 freq bund (1) - 12 freq undo (1) - 1 freq gnd (1) - 1 freq uni (1) - 53 freq aund (1) - 2 freq snd (1) - 33 freq ud (1) - 4 freq nd (1) - 88 freq usd (1) - 1 freq unt (1) - 1 freq unk (1) - 1 freq |
und (0) - 12 freq aund (1) - 2 freq nd (1) - 88 freq ond (1) - 1 freq end (1) - 1221 freq and (1) - 25387 freq undo (1) - 1 freq undae (2) - 3 freq ned (2) - 43 freq andy (2) - 151 freq aand (2) - 1 freq indy (2) - 57 freq ando (2) - 1 freq rund (2) - 2 freq yond (2) - 1 freq pund (2) - 37 freq inda (2) - 1 freq hund (2) - 1 freq inde (2) - 4 freq aind (2) - 1 freq eynd (2) - 1 freq nud (2) - 1 freq anyd (2) - 2 freq nad (2) - 1 freq nuid (2) - 1 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 |
UND |
| Time to execute Levenshtein function - 0.183147 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.361180 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.027357 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.036970 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.000871 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. |