| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| btsport (0) - 1 freq stvsport (2) - 2 freq pasport (2) - 5 freq sport (2) - 155 freq bbcsport (2) - 5 freq report (3) - 227 freq spot (3) - 251 freq airport (3) - 20 freq 'sort (3) - 3 freq fuspert (3) - 7 freq bespoke (3) - 2 freq bastert (3) - 9 freq spout (3) - 5 freq dispert (3) - 2 freq tapert (3) - 2 freq spoat (3) - 8 freq port (3) - 70 freq despert (3) - 4 freq hotspot (3) - 1 freq escort (3) - 3 freq resort (3) - 8 freq soort (3) - 2 freq snort (3) - 8 freq bedpost (3) - 1 freq bampot (3) - 30 freq |
btsport (0) - 1 freq bit-part (4) - 2 freq bbcsport (4) - 5 freq sport (4) - 155 freq stvsport (4) - 2 freq pasport (4) - 5 freq spoart (5) - 7 freq bastirt (5) - 1 freq passport (5) - 16 freq tayport (5) - 2 freq despirt (5) - 1 freq spurt (5) - 5 freq obtempert (5) - 1 freq bastart (5) - 67 freq hotspot (5) - 1 freq basturt (5) - 17 freq sporty (5) - 3 freq despert (5) - 4 freq dispert (5) - 2 freq fuspert (5) - 7 freq tapert (5) - 2 freq bastert (5) - 9 freq besturt (5) - 1 freq blustert (6) - 2 freq teleport (6) - 1 freq |
SoundEx code - B321 bath-sponge - 1 freq bedspread - 4 freq botox-brent - 1 freq bittikie-but - 1 freq bodsbeck' - 1 freq bodsbeck - 2 freq bedspreads - 1 freq bedspring - 1 freq bedcover - 1 freq btsportfootball - 1 freq bidesafe - 1 freq btsport - 1 freq |
MetaPhone code - BTSPRT bedspread - 4 freq btsport - 1 freq |
BTSPORT |
| Time to execute Levenshtein function - 0.211821 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.401464 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.027681 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.037605 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.000873 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. |