Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
bodygaird (0) - 1 freq boatyaird (3) - 1 freq costgaird (3) - 1 freq bodywark (3) - 1 freq boayband (4) - 1 freq jonsbaird (4) - 5 freq boygie (4) - 2 freq dockyaird (4) - 1 freq brodgar (4) - 6 freq body-like (4) - 1 freq box-cairt (4) - 1 freq diregaird (4) - 1 freq vinyaird (4) - 3 freq byward (4) - 2 freq vangaird (4) - 1 freq onygaits (4) - 7 freq onymair (4) - 38 freq hodgart (4) - 1 freq bodied (4) - 2 freq modairn (4) - 7 freq songbird (4) - 1 freq blaggard (4) - 3 freq royhair (4) - 3 freq postcaird (4) - 7 freq coastgaird (4) - 1 freq |
bodygaird (0) - 1 freq midgard (5) - 1 freq bodywark (5) - 1 freq boatyaird (5) - 1 freq braird (6) - 3 freq rudyard (6) - 2 freq body'd (6) - 1 freq baird (6) - 34 freq bogart (6) - 1 freq bodywork (6) - 1 freq ecogaird (6) - 1 freq ladybird (6) - 2 freq budgeted (6) - 1 freq badger (6) - 6 freq budged (6) - 1 freq boaregarde (6) - 1 freq bedford (6) - 1 freq gaird (6) - 61 freq bollard (6) - 3 freq reagaird (6) - 1 freq board (6) - 151 freq regaird (6) - 39 freq vangaird (6) - 1 freq byward (6) - 2 freq diregaird (6) - 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 - BTKRT bodygaird - 1 freq |
BODYGAIRD |
Time to execute Levenshtein function - 0.353970 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.764446 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.029161 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.068388 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.000903 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. |