| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fit-tappin (0) - 1 freq oot-tapped (4) - 1 freq strappin (4) - 10 freq fittan (4) - 1 freq hairt-stappin (4) - 1 freq lit-app (4) - 4 freq teep-tappin (4) - 1 freq bed-happin (4) - 1 freq hert-stappin (4) - 2 freq trip-trappin (4) - 1 freq fit-sair (4) - 1 freq tappin (4) - 22 freq trappin (4) - 1 freq kidnappin (4) - 1 freq aa-lappin (4) - 8 freq flappin (4) - 26 freq fittin (4) - 44 freq unstappin (4) - 1 freq owertappin (4) - 1 freq fitstaps (4) - 4 freq stoappin (4) - 11 freq pitalpin (4) - 2 freq fitbapins (4) - 1 freq fitstepps (4) - 1 freq stappin (4) - 45 freq |
fit-tappin (0) - 1 freq teep-tappin (6) - 1 freq fitstepps (6) - 1 freq oot-tapped (6) - 1 freq owertappin (7) - 1 freq unstappin (7) - 1 freq fittin (7) - 44 freq fitstaps (7) - 4 freq flappin (7) - 26 freq stoappin (7) - 11 freq quait-lippin (7) - 1 freq flat-topped (7) - 1 freq fittan (7) - 1 freq aa-lappin (7) - 8 freq stappin (7) - 45 freq hairt-stappin (7) - 1 freq bed-happin (7) - 1 freq lit-app (7) - 4 freq hert-stappin (7) - 2 freq tappin (7) - 22 freq trappin (7) - 1 freq strappin (7) - 10 freq fitstep (8) - 1 freq fittine (8) - 1 freq fitsteps (8) - 18 freq |
SoundEx code - F315 fatty-bannocks - 3 freq foodbank - 5 freq foodbanks - 2 freq fitbans - 1 freq fit-tappin - 1 freq fitbonny - 1 freq fitfine - 1 freq fitban - 1 freq |
MetaPhone code - FTTPN fit-tappin - 1 freq |
FIT-TAPPIN |
| Time to execute Levenshtein function - 0.373994 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.610945 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.033091 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.083931 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.001449 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. |