| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| body-swerve (0) - 1 freq bodyswerve (1) - 1 freq deserve (5) - 65 freq swerve (5) - 8 freq body-like (5) - 1 freq boys're (5) - 1 freq conserve (5) - 2 freq bide-awee (5) - 1 freq byde-ower (5) - 1 freq bodywork (5) - 1 freq observe (5) - 14 freq 'deserve (5) - 1 freq bodywark (5) - 1 freq cod-sweech (5) - 1 freq book-shelves (5) - 3 freq bodee (6) - 2 freq consairve (6) - 2 freq doun-here (6) - 1 freq observes (6) - 3 freq pley-fere (6) - 1 freq bodsbeck (6) - 2 freq boddimer's (6) - 2 freq boddimer (6) - 1 freq bodys (6) - 1 freq bowster (6) - 12 freq |
body-swerve (0) - 1 freq bodyswerve (2) - 1 freq byde-ower (7) - 1 freq swerve (8) - 8 freq 'deserve (8) - 1 freq bodywark (8) - 1 freq cod-sweech (8) - 1 freq bodywork (8) - 1 freq observe (8) - 14 freq deserve (8) - 65 freq bide-awee (8) - 1 freq desairve (9) - 1 freq bodhisattva (9) - 1 freq by-word (9) - 1 freq abodyswullie (9) - 1 freq bed-syde (9) - 1 freq broad-swords (9) - 1 freq desarve (9) - 2 freq budwiser (9) - 2 freq boys're (9) - 1 freq conserve (9) - 2 freq book-shelves (9) - 3 freq body-like (9) - 1 freq foreswore (10) - 1 freq come-ower (10) - 1 freq |
SoundEx code - B326 butcher's - 19 freq budweisers - 3 freq butcher - 36 freq butchert - 1 freq bootcher's - 1 freq butchered - 4 freq body-swerve - 1 freq budwiser - 2 freq butchers - 12 freq badger - 6 freq buttcher's - 1 freq budweiser - 3 freq butchery - 2 freq bodygaird - 1 freq bodyswerve - 1 freq €œbutcher - 1 freq butchering - 1 freq butchermeat - 1 freq butchart - 1 freq beautycreep - 1 freq 'butcher - 1 freq biodegradable - 2 freq butcherj - 3 freq |
MetaPhone code - BTSWRF body-swerve - 1 freq bodyswerve - 1 freq |
BODY-SWERVE |
| Time to execute Levenshtein function - 0.394220 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.832781 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.087737 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.110221 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.001145 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. |