Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
union (0) - 192 freq bunion (1) - 1 freq unison (1) - 8 freq uinion (1) - 1 freq undon (1) - 1 freq onion (1) - 14 freq inion (1) - 1 freq unions (1) - 8 freq union' (1) - 1 freq reunion (2) - 6 freq tion (2) - 1 freq nixon (2) - 8 freq undoan (2) - 2 freq undo (2) - 1 freq onions (2) - 17 freq lion (2) - 147 freq llion (2) - 57 freq unkan (2) - 22 freq unco (2) - 328 freq uncan (2) - 57 freq unean (2) - 1 freq nin (2) - 1 freq unis (2) - 2 freq uinioun (2) - 1 freq unich (2) - 1 freq |
union (0) - 192 freq onion (1) - 14 freq uinion (1) - 1 freq inion (1) - 1 freq nien (2) - 5 freq uinioun (2) - 1 freq nin (2) - 1 freq anon (2) - 6 freq noon (2) - 29 freq enin (2) - 4 freq unean (2) - 1 freq neon (2) - 7 freq non (2) - 39 freq unn (2) - 5 freq unions (2) - 8 freq undon (2) - 1 freq union' (2) - 1 freq unison (2) - 8 freq bunion (2) - 1 freq unit (3) - 42 freq neyn (3) - 1 freq uneo (3) - 1 freq upon (3) - 255 freq anen (3) - 49 freq nibon (3) - 1 freq |
SoundEx code - U550 union - 192 freq umman - 15 freq unean - 1 freq union' - 1 freq €™umman - 23 freq uinioun - 1 freq un-won - 1 freq unum - 1 freq uinion - 1 freq ‘union - 1 freq 'union' - 1 freq |
MetaPhone code - UNN union - 192 freq unean - 1 freq union' - 1 freq uinioun - 1 freq uinion - 1 freq ‘union - 1 freq 'union' - 1 freq |
UNION |
Time to execute Levenshtein function - 0.194328 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.362354 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.027307 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.036845 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.000920 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. |