| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| frapp (0) - 1 freq rapp (1) - 1 freq krapp (1) - 1 freq trapp (1) - 1 freq fradi (2) - 1 freq frank (2) - 66 freq flap (2) - 32 freq drape (2) - 1 freq fraed (2) - 1 freq drappr (2) - 1 freq fran (2) - 1 freq grupp (2) - 2 freq crappy (2) - 6 freq raip (2) - 32 freq rappt (2) - 1 freq frac (2) - 3 freq raps (2) - 1 freq clapp (2) - 1 freq frae (2) - 4566 freq knapp (2) - 2 freq grasp (2) - 28 freq drapt (2) - 35 freq traps (2) - 12 freq graph (2) - 4 freq fra (2) - 11 freq |
frapp (0) - 1 freq trapp (2) - 1 freq krapp (2) - 1 freq rapp (2) - 1 freq rpp (3) - 1 freq grupp (3) - 2 freq frump (3) - 1 freq grappa (3) - 3 freq crappy (3) - 6 freq ropp (3) - 7 freq fycpp (3) - 1 freq frappid (3) - 1 freq fimapp (3) - 1 freq frau (4) - 1 freq frame (4) - 63 freq tramp (4) - 27 freq franc (4) - 6 freq grape (4) - 8 freq drappd (4) - 2 freq rapt (4) - 1 freq wrap (4) - 49 freq fraes (4) - 1 freq rap' (4) - 1 freq wrappt (4) - 2 freq fraud (4) - 5 freq |
SoundEx code - F610 far-off - 3 freq forbye - 429 freq forby - 497 freq faur-aff - 10 freq furbye - 6 freq 'forby - 1 freq fearfu - 15 freq firbye - 29 freq furby - 29 freq 'forbye - 3 freq forbye' - 1 freq firbaw - 1 freq fearfa - 1 freq forebye - 59 freq fearfou - 1 freq foreby - 2 freq frapp - 1 freq firby - 1 freq far-aff - 6 freq fearfae - 1 freq fairfaw - 1 freq freebee - 1 freq forbye- - 1 freq freebie - 2 freq €œforby - 1 freq €œforbye - 1 freq for-bye - 2 freq €˜forby - 1 freq forbae - 1 freq furv - 1 freq fairfaaye - 11 freq freeview - 1 freq |
MetaPhone code - FRP frapp - 1 freq phrp - 1 freq |
FRAPP |
| Time to execute Levenshtein function - 0.314519 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.567228 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.027842 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.073719 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.001012 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. |