| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bestford (0) - 1 freq letford (2) - 1 freq westfold (2) - 1 freq bedford (2) - 1 freq thetford (3) - 1 freq wexford (3) - 4 freq basturd (3) - 2 freq benthorn (3) - 1 freq best-loed (3) - 1 freq westward (3) - 1 freq bestows (3) - 1 freq bastard (3) - 102 freq besturt (3) - 1 freq restored (3) - 11 freq montford (3) - 1 freq bested (3) - 2 freq before (3) - 567 freq bestow (3) - 1 freq bestiary (3) - 1 freq hestor (3) - 1 freq bestirs (3) - 2 freq restore (3) - 9 freq bestowe (3) - 1 freq rashford (3) - 2 freq befor (3) - 1 freq |
bestford (0) - 1 freq basturd (4) - 2 freq bedford (4) - 1 freq bastard (4) - 102 freq westfold (4) - 1 freq letford (4) - 1 freq bested (5) - 2 freq montford (5) - 1 freq bestiary (5) - 1 freq bestirs (5) - 2 freq thetford (5) - 1 freq rashford (5) - 2 freq restored (5) - 11 freq best-loed (5) - 1 freq besturt (5) - 1 freq westward (5) - 1 freq watford (5) - 2 freq busters (6) - 1 freq custard (6) - 15 freq bastard' (6) - 1 freq abbotsford (6) - 1 freq bistro (6) - 1 freq bastern (6) - 2 freq basturds (6) - 1 freq besotted (6) - 3 freq |
SoundEx code - B231 back-tae-front - 4 freq bowsied-app - 1 freq bus-stap - 2 freq backed-up - 1 freq bucketfu - 1 freq backstabbins - 1 freq basketball - 4 freq basketbaw - 5 freq bus-stop - 1 freq back-step - 1 freq boozed-up - 2 freq basketbaa - 1 freq boastful - 1 freq bucketfaes - 1 freq bqdv - 1 freq bestbehaviour - 1 freq bestpainterinhawick - 2 freq bctv - 1 freq bestbehavedbat - 1 freq besutiful - 1 freq beachedbirdsurvey - 1 freq bbcoutofdoors - 3 freq bbcdebatenight - 2 freq bpgtbkn - 1 freq bgtbhlub - 1 freq backstabbers - 1 freq bestford - 1 freq |
MetaPhone code - BSTFRT bestford - 1 freq |
BESTFORD |
| Time to execute Levenshtein function - 0.220187 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.387792 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.028769 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.046835 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.000883 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. |