| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| foodbank (0) - 5 freq foodbanks (1) - 2 freq widbank (3) - 1 freq footman (3) - 11 freq fooball (3) - 1 freq footba (3) - 2 freq goodbrand (3) - 1 freq hoodwink (3) - 2 freq footbal (3) - 1 freq football (3) - 125 freq footan (3) - 1 freq woodland (3) - 1 freq woodbine (3) - 1 freq bloobank (3) - 2 freq feedback (3) - 20 freq wirdbank (3) - 1 freq moorland (4) - 3 freq fadan (4) - 1 freq folding (4) - 2 freq forsak (4) - 1 freq foody (4) - 2 freq foldin (4) - 8 freq soondan (4) - 2 freq foon (4) - 7 freq flowan (4) - 1 freq |
foodbank (0) - 5 freq foodbanks (2) - 2 freq widbank (4) - 1 freq feedback (4) - 20 freq bloobank (5) - 2 freq feedbeck (5) - 1 freq woodbine (5) - 1 freq wirdbank (5) - 1 freq ladybank (5) - 1 freq hoodwink (5) - 2 freq eastbank (6) - 1 freq fiddian (6) - 1 freq fobbin (6) - 3 freq fank (6) - 25 freq drank (6) - 56 freq mudbanks (6) - 2 freq clydebank (6) - 12 freq dank (6) - 11 freq frank (6) - 65 freq woodbines (6) - 1 freq feedan (6) - 4 freq flank (6) - 12 freq footman (6) - 11 freq ewbank (6) - 1 freq faeddans (6) - 1 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 - FTBNK foodbank - 5 freq |
FOODBANK |
| Time to execute Levenshtein function - 0.196295 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.365727 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.028171 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.038076 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.000777 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. |