| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| backwart (0) - 7 freq ackwart (1) - 6 freq backwarts (1) - 3 freq backward (1) - 12 freq backward- (2) - 1 freq backarts (2) - 10 freq backwards (2) - 36 freq ackward (2) - 3 freq bakward (2) - 2 freq backyard (2) - 1 freq bakwarts (2) - 1 freq awkwart (2) - 1 freq backwye (3) - 1 freq backlash (3) - 1 freq burkart (3) - 1 freq backweys (3) - 1 freq akward (3) - 3 freq ackwal (3) - 3 freq aakward (3) - 7 freq tankart (3) - 1 freq backt (3) - 1 freq ackwall (3) - 1 freq backwater (3) - 1 freq aukward (3) - 1 freq bastart (3) - 67 freq |
backwart (0) - 7 freq backwarts (2) - 3 freq backward (2) - 12 freq ackwart (2) - 6 freq backyard (4) - 1 freq bakwarts (4) - 1 freq awkwart (4) - 1 freq bakward (4) - 2 freq bickert (4) - 3 freq ackward (4) - 3 freq backarts (4) - 10 freq backward- (4) - 1 freq backwards (4) - 36 freq backit (5) - 8 freq backdate (5) - 1 freq backwatter (5) - 1 freq ackwird (5) - 2 freq backlit (5) - 1 freq benwart (5) - 1 freq backet (5) - 8 freq brickwark (5) - 1 freq akwirt (5) - 1 freq backwise (5) - 1 freq backfire (5) - 1 freq buchart (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 |
BACKWART |
| Time to execute Levenshtein function - 0.245927 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.572566 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.028539 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.068695 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.000936 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. |