| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ‘union (0) - 1 freq union (2) - 192 freq reunion (2) - 6 freq bunion (2) - 1 freq prunin (3) - 2 freq inion (3) - 1 freq unions (3) - 8 freq union' (3) - 1 freq tunin (3) - 12 freq sounin (3) - 8 freq ‘kin (3) - 1 freq launin (3) - 1 freq ‘brian (3) - 1 freq 'union' (3) - 1 freq eisunion (3) - 1 freq onion (3) - 14 freq haunin (3) - 7 freq mayunion (3) - 1 freq bounin (3) - 1 freq lundon (3) - 2 freq brunton (3) - 24 freq apinion (3) - 1 freq daunton (3) - 2 freq caution (3) - 10 freq undon (3) - 1 freq |
‘union (0) - 1 freq ‘mon (4) - 1 freq ‘kin (4) - 1 freq union (4) - 192 freq ‘no (4) - 1 freq bunion (4) - 1 freq reunion (4) - 6 freq re-union (5) - 1 freq ‘thon (5) - 1 freq opinion (5) - 70 freq minion (5) - 3 freq ‘done (5) - 1 freq ‘en (5) - 3 freq ‘queen (5) - 1 freq ‘n (5) - 1 freq apinion (5) - 1 freq lunnon (5) - 33 freq uinion (5) - 1 freq ‘new (5) - 2 freq eisunion (5) - 1 freq onion (5) - 14 freq prunin (5) - 2 freq ‘brian (5) - 1 freq launin (5) - 1 freq inion (5) - 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.230294 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.371239 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.035730 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.036882 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.000899 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. |