| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| faik-pats (0) - 1 freq jaikits (4) - 1 freq faats (4) - 7 freq fore-paas (4) - 1 freq fitpath (4) - 4 freq raincoats (4) - 1 freq faints (4) - 1 freq airmpits (4) - 1 freq faiks (4) - 1 freq tap-hats (4) - 1 freq back-sate (4) - 1 freq jaikets (4) - 13 freq fore-paws (4) - 2 freq cairpets (4) - 7 freq wik-days (4) - 1 freq pit-pat (4) - 2 freq fascists (5) - 4 freq sairvants (5) - 4 freq facilitate (5) - 9 freq fish-guts (5) - 1 freq naips (5) - 1 freq ficets (5) - 1 freq falderals (5) - 5 freq footpath (5) - 2 freq harn-pan (5) - 4 freq |
faik-pats (0) - 1 freq fore-paws (6) - 2 freq fore-paas (6) - 1 freq cairpets (7) - 7 freq wik-days (7) - 1 freq pit-pat (7) - 2 freq fake-tan (7) - 1 freq look-outs (7) - 1 freq aff-pit (7) - 6 freq ink-spots (7) - 1 freq buik-leets (7) - 1 freq flee-oots (7) - 1 freq airmpits (7) - 1 freq jaikits (7) - 1 freq fitpath (7) - 4 freq faats (7) - 7 freq faints (7) - 1 freq jaikets (7) - 13 freq tap-hats (7) - 1 freq faiks (7) - 1 freq fairy-tales (8) - 1 freq bakwarts (8) - 1 freq futrats (8) - 1 freq firrits (8) - 3 freq fiypt (8) - 1 freq |
SoundEx code - F213 fish-fitman - 3 freq fish-f'itman - 1 freq fish-footman - 2 freq faik-pats - 1 freq fish-food - 1 freq facefitfirradio - 1 freq fwicfdo - 1 freq fqbwtadh - 1 freq fzxvdqopj - 1 freq |
MetaPhone code - FKPTS faik-pats - 1 freq |
FAIK-PATS |
| Time to execute Levenshtein function - 0.231022 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.615460 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.028608 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.070237 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.000904 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. |