| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unionig (0) - 1 freq union's (2) - 1 freq unionlib (2) - 1 freq unions (2) - 8 freq union' (2) - 1 freq unionist (2) - 35 freq union (2) - 188 freq unionism (2) - 8 freq undone (3) - 4 freq unifyin (3) - 1 freq bunions (3) - 2 freq unifying (3) - 1 freq onions (3) - 17 freq unison (3) - 7 freq onion (3) - 14 freq undoin (3) - 1 freq unitin (3) - 2 freq antonio (3) - 1 freq unrung (3) - 1 freq 'union' (3) - 1 freq intonit (3) - 1 freq antonia (3) - 8 freq unhovin (3) - 1 freq unsonsie (3) - 1 freq unbonnie (3) - 1 freq |
unionig (0) - 1 freq ning (3) - 1 freq union' (3) - 1 freq union (3) - 188 freq unions (3) - 8 freq uinion (4) - 1 freq inion (4) - 1 freq onion (4) - 14 freq unrung (4) - 1 freq nonin (4) - 1 freq inions (4) - 1 freq unsung (4) - 2 freq using (4) - 35 freq unifying (4) - 1 freq unionist (4) - 35 freq unionlib (4) - 1 freq union's (4) - 1 freq unionism (4) - 8 freq unenin (4) - 1 freq tuning (4) - 3 freq onions (4) - 17 freq ending (5) - 17 freq dinng (5) - 1 freq sing (5) - 344 freq unean (5) - 1 freq |
SoundEx code - U552 unhinged - 3 freq unionist - 35 freq unionists - 20 freq unionism - 8 freq unionig - 1 freq unionists' - 1 freq unimagineable - 1 freq unions - 8 freq unimagined - 1 freq unanswerability - 1 freq unanswered - 3 freq unmankit - 1 freq unanswert - 1 freq unimaginable - 1 freq unhonest - 1 freq un-inglis - 1 freq unmanaged - 1 freq union's - 1 freq unionist-designed - 1 freq unionscenes - 2 freq unions - 1 freq unionised - 1 freq uninspiring - 1 freq |
MetaPhone code - UNNK unionig - 1 freq |
UNIONIG |
| Time to execute Levenshtein function - 0.198927 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.360691 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.028235 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.037015 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.000825 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. |