| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| backwards (0) - 35 freq 'backwards (1) - 1 freq backwarts (1) - 3 freq backward- (1) - 1 freq backwirds (1) - 2 freq backward (1) - 11 freq bakwards (1) - 2 freq backyard (2) - 1 freq bakward (2) - 2 freq backarts (2) - 10 freq backwart (2) - 7 freq backlands (2) - 1 freq ackward (2) - 3 freq 'backwards' (2) - 1 freq bakwarts (2) - 1 freq tacwards (2) - 1 freq backlan's (3) - 1 freq tawards (3) - 7 freq backers (3) - 2 freq backairts (3) - 1 freq awards (3) - 35 freq awkward (3) - 30 freq backwyes (3) - 1 freq bastards (3) - 33 freq ackwird (3) - 2 freq |
backwards (0) - 35 freq backwirds (1) - 2 freq bakwards (2) - 2 freq backward (2) - 11 freq backward- (2) - 1 freq backwarts (2) - 3 freq 'backwards (2) - 1 freq 'backwards' (4) - 1 freq tacwards (4) - 1 freq ackward (4) - 3 freq bakwarts (4) - 1 freq backwart (4) - 7 freq backlands (4) - 1 freq bakward (4) - 2 freq backyard (4) - 1 freq backarts (4) - 10 freq backgarden (5) - 1 freq ackwird (5) - 2 freq backfires (5) - 1 freq cowards (5) - 5 freq baakwardly (5) - 1 freq backweys (5) - 1 freq backwyes (5) - 1 freq backairts (5) - 1 freq backers (5) - 2 freq |
SoundEx code - B263 backartywise - 1 freq bigger-that - 1 freq backwarts - 3 freq backward - 11 freq backarties - 3 freq backroad - 1 freq backwards - 35 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 - BKWRTS backwarts - 3 freq backwards - 35 freq bakwards - 2 freq 'backwards - 1 freq 'backwards' - 1 freq backwirds - 2 freq 'backwarts' - 1 freq bakwarts - 1 freq |
BACKWARDS |
| Time to execute Levenshtein function - 0.452075 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.920831 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.078929 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.037710 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.000793 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. |