| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ubun (0) - 1 freq uun (1) - 1 freq bun (1) - 59 freq upun (1) - 5 freq abun (1) - 3 freq bund (2) - 12 freq bun (2) - 1 freq up'n (2) - 1 freq uku (2) - 1 freq buns (2) - 22 freq hbu (2) - 1 freq baun (2) - 18 freq usan (2) - 4 freq abeun (2) - 5 freq seun (2) - 10 freq unul (2) - 1 freq uon (2) - 1 freq taun (2) - 1 freq ioun (2) - 1 freq deun (2) - 31 freq abut (2) - 1 freq amun (2) - 5 freq ben (2) - 609 freq ubmo (2) - 1 freq aboun (2) - 1 freq |
ubun (0) - 1 freq bun (1) - 59 freq abun (1) - 3 freq abuin (2) - 346 freq aboun (2) - 1 freq bon (2) - 14 freq byn (2) - 2 freq oban (2) - 3 freq bn (2) - 7 freq buin (2) - 12 freq buon (2) - 1 freq abon (2) - 1 freq ban (2) - 48 freq bin (2) - 971 freq ben (2) - 609 freq abune (2) - 178 freq boun (2) - 10 freq abin (2) - 43 freq upun (2) - 5 freq uun (2) - 1 freq baun (2) - 18 freq abeun (2) - 5 freq lun (3) - 1 freq arun (3) - 2 freq bung (3) - 2 freq |
SoundEx code - U150 upon - 255 freq upoan - 7 freq up'n - 1 freq upun - 5 freq upain - 1 freq upo'm - 1 freq ubun - 1 freq uppin - 1 freq upn - 1 freq ubmo - 1 freq uapn - 1 freq |
MetaPhone code - UBN ubun - 1 freq |
UBUN |
| Time to execute Levenshtein function - 0.269456 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.374769 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.029258 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.041359 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.000869 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. |