| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| widbank (0) - 1 freq wirdbank (1) - 1 freq widlan (2) - 2 freq widbine (2) - 1 freq widmann (2) - 1 freq widland (2) - 10 freq willans (3) - 1 freq widda (3) - 36 freq riband (3) - 1 freq ribbans (3) - 1 freq widni (3) - 3 freq widda's (3) - 3 freq fidgan (3) - 1 freq wishan (3) - 2 freq midian (3) - 1 freq widna'v (3) - 1 freq bidan (3) - 9 freq ridan (3) - 1 freq drank (3) - 59 freq widdae (3) - 1 freq aidan (3) - 5 freq wingback (3) - 2 freq widdas (3) - 1 freq i'band (3) - 2 freq wuidlans (3) - 1 freq |
widbank (0) - 1 freq wirdbank (2) - 1 freq widbine (3) - 1 freq widbines (4) - 2 freq foodbank (4) - 5 freq ewbank (4) - 1 freq tweedbank (4) - 1 freq ladybank (4) - 1 freq widlan (4) - 2 freq widland (4) - 10 freq widmann (4) - 1 freq wudbins (4) - 1 freq wide-an (5) - 1 freq wident (5) - 2 freq widn (5) - 4 freq andback (5) - 1 freq widno (5) - 1 freq wuidwark (5) - 2 freq widny (5) - 4 freq wuidlans (5) - 1 freq widden (5) - 134 freq widnad (5) - 1 freq widnae (5) - 435 freq wink (5) - 117 freq mudbanks (5) - 2 freq |
SoundEx code - W315 whitehaven - 1 freq woodbines - 1 freq widbank - 1 freq wudbin-broon - 1 freq woodbine - 1 freq widbines - 2 freq widbine - 1 freq wudbins - 1 freq whatthefmemes - 1 freq whitbyandco - 5 freq |
MetaPhone code - WTBNK widbank - 1 freq |
WIDBANK |
| Time to execute Levenshtein function - 0.225062 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.404526 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.027681 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.041300 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.001009 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. |