| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fitbans (0) - 1 freq fitbaws (1) - 6 freq fitba's (1) - 2 freq fitbas (1) - 1 freq fitba (2) - 315 freq fitbapins (2) - 1 freq fitman (2) - 22 freq ribbans (2) - 1 freq fitbaw (2) - 217 freq fitnaes (2) - 1 freq fitman's (2) - 2 freq titans (2) - 1 freq fittins (2) - 1 freq tirbans (2) - 1 freq fitbaÂ’ (2) - 10 freq wittans (2) - 2 freq fitbaa (2) - 10 freq fittan (2) - 1 freq fatbaws (2) - 1 freq fitba' (2) - 12 freq fingan (3) - 1 freq eitan (3) - 1 freq fitin (3) - 4 freq raybans (3) - 1 freq €˜bans (3) - 1 freq |
fitbans (0) - 1 freq fitbaws (2) - 6 freq fitbas (2) - 1 freq fitba's (2) - 2 freq fatbaws (3) - 1 freq fitnaes (3) - 1 freq fitbapins (3) - 1 freq fittins (3) - 1 freq fittan (4) - 1 freq wittans (4) - 2 freq fitbaÂ’ (4) - 10 freq fitbonny (4) - 1 freq fitba' (4) - 12 freq fitbaa (4) - 10 freq ribbans (4) - 1 freq fitba (4) - 315 freq tirbans (4) - 1 freq fitbaw (4) - 217 freq fitman (4) - 22 freq titans (4) - 1 freq fitman's (4) - 2 freq fit's (5) - 210 freq fotaes (5) - 1 freq firebaws (5) - 1 freq fota's (5) - 3 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 fitbaÂ’n - 1 freq |
MetaPhone code - FTBNS fitbans - 1 freq |
FITBANS |
| Time to execute Levenshtein function - 0.235510 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.591692 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.028900 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.075225 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.000869 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. |