| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wackford (0) - 1 freq blackford (2) - 6 freq watford (2) - 2 freq packfou (3) - 1 freq wilford (3) - 1 freq wford (3) - 1 freq accord (3) - 8 freq wallyford (3) - 12 freq rockform (3) - 1 freq rashford (3) - 2 freq ackward (3) - 3 freq alford (3) - 4 freq backward (3) - 12 freq backroad (3) - 1 freq walkcork (3) - 1 freq wexford (3) - 4 freq waterford (3) - 1 freq wackend (3) - 2 freq backfire (3) - 1 freq ackwird (3) - 2 freq backfired (3) - 3 freq packload (3) - 1 freq backyard (3) - 1 freq warkforce (3) - 1 freq racord (3) - 2 freq |
wackford (0) - 1 freq blackford (4) - 6 freq backfired (4) - 3 freq watford (4) - 2 freq wackend (5) - 2 freq wexford (5) - 4 freq backfire (5) - 1 freq waterford (5) - 1 freq backyard (5) - 1 freq wackened (5) - 1 freq warkforce (5) - 1 freq backroad (5) - 1 freq ackwird (5) - 2 freq wideford (5) - 4 freq rockform (5) - 1 freq wallyford (5) - 12 freq wilford (5) - 1 freq ackward (5) - 3 freq backward (5) - 12 freq wford (5) - 1 freq wallayford (6) - 1 freq walkcork (6) - 1 freq wickers (6) - 1 freq packfou (6) - 1 freq drakeford (6) - 1 freq |
SoundEx code - W216 whuspered - 43 freq whisper - 56 freq whispers - 45 freq whispert - 22 freq whuspers - 5 freq whuspert - 57 freq whusper-whusperin - 1 freq whisperin - 21 freq whispered - 68 freq whusper - 20 freq whispery - 1 freq whispereen - 1 freq whispering - 5 freq whisperan - 5 freq whichiver - 1 freq whisperen - 1 freq wisfurgive - 1 freq whusperin - 10 freq whisperins - 2 freq wackford - 1 freq whispern - 1 freq whusprin - 4 freq waashboord - 1 freq whisper't - 2 freq whisperer - 1 freq wexford - 4 freq wwhisperan - 1 freq whosever - 1 freq whasaeiver - 1 freq whisperers - 1 freq whusperins - 1 freq washboard - 1 freq wjprogressive - 10 freq whichever - 1 freq wjoiper - 1 freq |
MetaPhone code - WKFRT wackford - 1 freq |
WACKFORD |
| Time to execute Levenshtein function - 0.194062 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.365319 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.027729 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.040652 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.001069 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. |