| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| backend (0) - 4 freq wackend (1) - 2 freq back-end (1) - 9 freq blackend (1) - 1 freq backed (1) - 27 freq backing (2) - 3 freq blacked (2) - 4 freq blackens (2) - 1 freq jacked (2) - 2 freq baaken (2) - 1 freq becked (2) - 1 freq blackened (2) - 7 freq beachend (2) - 1 freq hacked (2) - 9 freq baked (2) - 28 freq tacked (2) - 2 freq €˜backend (2) - 2 freq backers (2) - 2 freq barked (2) - 9 freq lacken (2) - 1 freq backins (2) - 2 freq backeth (2) - 1 freq backid (2) - 1 freq sacked (2) - 9 freq backin (2) - 41 freq |
backend (0) - 4 freq backed (2) - 27 freq blackend (2) - 1 freq back-end (2) - 9 freq wackend (2) - 2 freq backins (3) - 2 freq backin' (3) - 1 freq backin (3) - 41 freq beckoned (3) - 4 freq bocken (3) - 1 freq backid (3) - 1 freq beachend (3) - 1 freq blaikend (3) - 1 freq wickend (3) - 3 freq backing (3) - 3 freq wackened (3) - 1 freq becked (3) - 1 freq blackened (3) - 7 freq racked (4) - 5 freq backgmnd (4) - 1 freq bracken (4) - 14 freq packed (4) - 58 freq beckont (4) - 1 freq bockan (4) - 7 freq bickered (4) - 1 freq |
SoundEx code - B253 back-end - 9 freq buckhind - 4 freq beckoned - 4 freq backend - 4 freq boak-inducin - 1 freq bejant - 4 freq bejants - 2 freq bejantine - 2 freq bahookie-end - 1 freq bakemeat - 1 freq basnet - 2 freq byzantium - 2 freq biggent - 1 freq beechnuts - 1 freq backgmnd - 1 freq backhander - 1 freq €˜backend - 2 freq €˜backendish - 1 freq beckont - 1 freq bogintillers - 1 freq bbcnidebate - 1 freq beachend - 1 freq bekindmyarse - 1 freq bbcandrewkerr - 1 freq bbcsounds - 1 freq bigandymccoll - 1 freq bbcnaidheachdan - 1 freq bhsmodlang - 1 freq busandtrainuser - 1 freq |
MetaPhone code - BKNT back-end - 9 freq beckoned - 4 freq backend - 4 freq biggent - 1 freq €˜backend - 2 freq beckont - 1 freq |
BACKEND |
| Time to execute Levenshtein function - 0.288986 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.533136 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.061182 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.036969 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.000827 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. |