| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uppermaist (0) - 2 freq upper-maist (1) - 1 freq uppermost (2) - 6 freq uppermair (2) - 4 freq ootermaist (3) - 2 freq upmaist (3) - 1 freq innermaist (3) - 4 freq upmerkat (4) - 1 freq seperait (4) - 1 freq persist (4) - 9 freq uppers (4) - 2 freq imperialist (4) - 4 freq €œpermit (4) - 1 freq deepmaist (4) - 1 freq perfait (4) - 2 freq hinemaist (4) - 1 freq utmaist (4) - 6 freq nearmaist (4) - 1 freq hinnermaist (4) - 39 freq foremaist (4) - 53 freq bettermaist (4) - 5 freq upraise (4) - 1 freq uppercut (4) - 1 freq suppermairket (4) - 2 freq permis (4) - 1 freq |
uppermaist (0) - 2 freq uppermost (2) - 6 freq upper-maist (2) - 1 freq uppermair (4) - 4 freq innermaist (5) - 4 freq upmaist (5) - 1 freq ootermaist (5) - 2 freq tapmaist (6) - 21 freq formaist (6) - 1 freq permis (6) - 1 freq foirmaist (6) - 1 freq peppermint (6) - 2 freq permit (6) - 7 freq apprisit (6) - 1 freq opprest (6) - 1 freq uppercut (6) - 1 freq appraise (6) - 1 freq pharmacist (6) - 2 freq apperit (6) - 3 freq yondermaist (6) - 2 freq deepmaist (6) - 1 freq imperialist (6) - 4 freq uppers (6) - 2 freq persist (6) - 9 freq promist (6) - 3 freq |
SoundEx code - U165 upbring - 1 freq up-brandy - 1 freq upfront - 1 freq uppermair - 4 freq uppermost - 6 freq upper-maist - 1 freq uppermaist - 2 freq upbringin - 4 freq upbringing - 4 freq uberhonda - 1 freq |
MetaPhone code - UPRMST uppermost - 6 freq upper-maist - 1 freq uppermaist - 2 freq |
UPPERMAIST |
| Time to execute Levenshtein function - 0.182409 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.348889 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.027253 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.037122 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.000831 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. |