| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| backward (0) - 12 freq backward- (1) - 1 freq bakward (1) - 2 freq backwards (1) - 36 freq backwart (1) - 7 freq backyard (1) - 1 freq ackward (1) - 3 freq aukward (2) - 1 freq backwirds (2) - 2 freq ackwart (2) - 6 freq ackwird (2) - 2 freq aakward (2) - 7 freq akward (2) - 3 freq 'backwards (2) - 1 freq backhaud (2) - 1 freq bakwards (2) - 2 freq awkward (2) - 36 freq backwarts (2) - 3 freq backweys (3) - 1 freq backswash (3) - 1 freq byward (3) - 2 freq backtaen (3) - 1 freq blackwood (3) - 4 freq tacwards (3) - 1 freq ackwall (3) - 1 freq |
backward (0) - 12 freq backyard (2) - 1 freq backwart (2) - 7 freq ackward (2) - 3 freq backward- (2) - 1 freq bakward (2) - 2 freq backwards (2) - 36 freq ackwird (3) - 2 freq backwirds (3) - 2 freq awkward (4) - 36 freq backwarts (4) - 3 freq bakwards (4) - 2 freq backfired (4) - 3 freq backroad (4) - 1 freq backhaud (4) - 1 freq aukward (4) - 1 freq aakward (4) - 7 freq akward (4) - 3 freq 'backwards (4) - 1 freq ackwart (4) - 6 freq backgarden (5) - 1 freq wackford (5) - 1 freq akwird (5) - 2 freq coward (5) - 12 freq backwise (5) - 1 freq |
SoundEx code - B263 backartywise - 1 freq bigger-that - 1 freq backwarts - 3 freq backward - 12 freq backarties - 3 freq backroad - 1 freq backwards - 36 freq begrudge - 2 freq backarts - 10 freq 'backarts' - 1 freq baukward-luikin - 1 freq buggered - 13 freq backyard - 1 freq bakward - 2 freq bakwards - 2 freq backwart - 7 freq box-cairt - 1 freq 'backwards - 1 freq begrutten - 6 freq bacardi - 8 freq baakwardly - 1 freq buzzard - 3 freq buggert - 3 freq backgairden - 1 freq beckairts - 1 freq buzzards - 5 freq backarty-wise' - 1 freq backarty-wise - 1 freq bogart - 1 freq backerties - 1 freq bickered - 1 freq 'backwards' - 1 freq backwirds - 2 freq bjartalid - 1 freq 'backwarts' - 1 freq bizzard - 1 freq bickert - 3 freq bakwarts - 1 freq bussard - 1 freq €˜begrutten - 1 freq backairts - 1 freq buggeration - 1 freq buchart - 1 freq backward-turnt - 1 freq begrudged - 1 freq begrudgin - 1 freq baegered - 1 freq backgarden - 1 freq bbcradioscot - 27 freq bbcradioulster - 13 freq bbcradiofoyle - 1 freq boxertoye - 1 freq backroadbiking - 1 freq bbcradio - 5 freq bbcradiowales - 1 freq bbcradiodrama - 1 freq backward- - 1 freq biggardenbirdwatch - 1 freq bigredfcassidy - 1 freq bsgcreativesig - 2 freq bbcearth - 1 freq |
MetaPhone code - BKWRT backward - 12 freq bakward - 2 freq backwart - 7 freq backward- - 1 freq |
BACKWARD |
| Time to execute Levenshtein function - 0.220603 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.372315 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.030302 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.037342 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.000893 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. |