| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gpbxmeom (0) - 1 freq gameon (4) - 1 freq palmer (5) - 3 freq pqmoy (5) - 1 freq poame (5) - 1 freq poames (5) - 2 freq gimme (5) - 4 freq payment (5) - 4 freq gnom (5) - 2 freq games' (5) - 2 freq grame (5) - 3 freq gem (5) - 24 freq brom (5) - 1 freq becom (5) - 1 freq boredom (5) - 17 freq primed (5) - 3 freq gbbo (5) - 1 freq ubmo (5) - 1 freq gpycubou (5) - 1 freq epbbow (5) - 1 freq gizmo (5) - 2 freq patreon (5) - 2 freq pmcm (5) - 1 freq gibson (5) - 21 freq gambol (5) - 1 freq |
gpbxmeom (0) - 1 freq pbahmew (8) - 1 freq loppxme (8) - 1 freq glbtm (8) - 1 freq gemm (8) - 53 freq gzemm (8) - 1 freq pxim (8) - 1 freq grimm (8) - 4 freq premium (8) - 2 freq boaxroom (8) - 1 freq oybxmv (8) - 1 freq gemme (8) - 105 freq boxroom (8) - 4 freq gimme (8) - 4 freq upcumm (8) - 1 freq gameon (8) - 1 freq pxm (8) - 1 freq ugsumm (9) - 1 freq gibblet (9) - 1 freq bottom (9) - 161 freq gabbie (9) - 1 freq gebbies (9) - 1 freq pixie (9) - 4 freq gablos (9) - 1 freq padme (9) - 1 freq |
SoundEx code - G125 gibson - 21 freq gobsmacked - 4 freq gavsan - 1 freq gibknu - 1 freq gpbxmeom - 1 freq gbxanthems - 1 freq gyposwon - 1 freq giuyvcmrfe - 1 freq gbxmqxwbyd - 1 freq |
MetaPhone code - KPBKSMM gpbxmeom - 1 freq |
GPBXMEOM |
| Time to execute Levenshtein function - 0.202582 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.378090 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.028219 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.037052 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.000934 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. |