| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gpycubou (0) - 1 freq grycefu (4) - 1 freq pacefou (4) - 1 freq gcuo (4) - 1 freq packfou (4) - 1 freq postbox (5) - 3 freq gyatso (5) - 1 freq grytfu (5) - 1 freq cuby (5) - 1 freq gyos (5) - 1 freq peugot (5) - 1 freq yougov (5) - 4 freq gdiou (5) - 1 freq guid-boy (5) - 2 freq gquo (5) - 1 freq paction (5) - 18 freq pseudo (5) - 3 freq gubs (5) - 1 freq playboy (5) - 1 freq grcu (5) - 1 freq pubs (5) - 49 freq gyung (5) - 1 freq gyct (5) - 1 freq taycups (5) - 2 freq fyou (5) - 1 freq |
gpycubou (0) - 1 freq spcb (6) - 2 freq gcuo (6) - 1 freq grycefu (6) - 1 freq pacefou (6) - 1 freq ipyb (7) - 1 freq gazebo (7) - 1 freq apyc (7) - 1 freq giacomo (7) - 2 freq gedboy (7) - 1 freq upcum (7) - 2 freq gpo (7) - 4 freq epicure (7) - 2 freq grubby (7) - 2 freq piczo (7) - 1 freq grub (7) - 39 freq gub (7) - 30 freq gioco (7) - 1 freq paco (7) - 19 freq cub (7) - 3 freq gypos (7) - 1 freq specious (7) - 2 freq gracefu (7) - 5 freq pacefu (7) - 1 freq cube (7) - 5 freq |
SoundEx code - G121 giff-gaff - 3 freq gvzp - 1 freq gbwzzfrhcj - 1 freq gpjvgdhdy - 1 freq gbghvvkyso - 1 freq gavgibbon - 1 freq gjbzf - 1 freq gpycubou - 1 freq gvsvravt - 1 freq geepy-gawpy - 1 freq gibqqpz - 1 freq gvqpppf - 1 freq gpkbxkrh - 1 freq gpczvq - 1 freq gpzwpxqa - 1 freq |
MetaPhone code - KPKB gpycubou - 1 freq |
GPYCUBOU |
| Time to execute Levenshtein function - 0.227324 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.358407 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.028431 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.037452 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.000917 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. |