Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
fergal (0) - 1 freq ferfal (1) - 8 freq feral (1) - 5 freq aerial (2) - 5 freq ferman (2) - 1 freq forgat (2) - 5 freq bengal (2) - 2 freq serial (2) - 3 freq ferfil (2) - 7 freq formal (2) - 59 freq cereal (2) - 15 freq ergan (2) - 1 freq regal (2) - 2 freq verbal (2) - 28 freq fergus (2) - 8 freq feudal (2) - 5 freq ferful (2) - 2 freq firmal (2) - 1 freq feal (2) - 1 freq fergie (2) - 121 freq fergit (2) - 2 freq fergot (2) - 6 freq ferg (2) - 1 freq frugal (2) - 4 freq furmal (2) - 1 freq |
fergal (0) - 1 freq feral (2) - 5 freq frugal (2) - 4 freq ferfal (2) - 8 freq fergie (3) - 121 freq firmal (3) - 1 freq ferful (3) - 2 freq fergit (3) - 2 freq ferg (3) - 1 freq ferget (3) - 2 freq furmal (3) - 1 freq fergus (3) - 8 freq fergot (3) - 6 freq forgan (3) - 3 freq forgat (3) - 5 freq ferfil (3) - 7 freq formal (3) - 59 freq regal (3) - 2 freq farg (4) - 1 freq fearful (4) - 9 freq fardel (4) - 1 freq ferly (4) - 20 freq forges (4) - 2 freq forge (4) - 14 freq firgit (4) - 13 freq |
SoundEx code - F624 'freshlaid - 1 freq firsled - 1 freq furiously - 6 freq fragile - 15 freq fiercely - 6 freq freckly - 2 freq frecklit - 1 freq frock-like - 1 freq freckled - 5 freq freshly - 8 freq freckles - 17 freq frizzle - 2 freq fair-isle - 1 freq frugal - 4 freq fregley - 2 freq fregley's - 1 freq fragility - 2 freq frazzelt - 1 freq fierce-lukkan - 1 freq faircelins - 1 freq faercly - 1 freq fork-lift - 1 freq friesland - 8 freq fryslan - 1 freq fair-shelled - 1 freq frizzled - 1 freq fierce-like - 1 freq forcie-like - 1 freq frazzled - 1 freq firuswal - 1 freq frizzel - 13 freq frizell - 1 freq fairce-leukin - 1 freq faur-skailed - 1 freq frkzlvmy - 1 freq fergal - 1 freq frxlltgdnh - 1 freq fairisle - 2 freq furseals - 1 freq freegellybhoy - 1 freq fergalmckinney - 1 freq |
MetaPhone code - FRKL freckly - 2 freq frugal - 4 freq fregley - 2 freq faercly - 1 freq fergal - 1 freq |
FERGAL |
Time to execute Levenshtein function - 0.223747 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.385136 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.029915 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.038608 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.000787 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. |