| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| speakers (0) - 223 freq speakers' (1) - 1 freq speaker's (1) - 1 freq speaker (1) - 64 freq speakes (1) - 1 freq spakers (1) - 4 freq speikers (1) - 46 freq speakis (2) - 1 freq steamers (2) - 1 freq spickers (2) - 15 freq speeders (2) - 7 freq spikkers (2) - 75 freq speaketh (2) - 1 freq spencers (2) - 3 freq shearers (2) - 1 freq breakers (2) - 2 freq spears (2) - 27 freq speers (2) - 7 freq spaekers (2) - 39 freq spankers (2) - 2 freq spikers (2) - 3 freq seekers (2) - 9 freq speikars (2) - 2 freq spaker (2) - 3 freq speiker (2) - 15 freq |
speakers (0) - 223 freq spakers (1) - 4 freq speikers (1) - 46 freq spaekers (2) - 39 freq spikers (2) - 3 freq speikars (2) - 2 freq speaker (2) - 64 freq speakers' (2) - 1 freq speakes (2) - 1 freq speaker's (2) - 1 freq spankers (3) - 2 freq seekers (3) - 9 freq spaker (3) - 3 freq spacers (3) - 2 freq shakers (3) - 2 freq speaks (3) - 87 freq spakes (3) - 6 freq speiker (3) - 15 freq spaekirs (3) - 1 freq speeders (3) - 7 freq speers (3) - 7 freq spikkers (3) - 75 freq spickers (3) - 15 freq spears (3) - 27 freq speakis (3) - 1 freq |
SoundEx code - S126 speaker - 64 freq speiker - 15 freq spikkers - 75 freq savagery - 4 freq spikker - 14 freq speakers - 223 freq spcired - 1 freq spikers - 3 freq subscribe - 6 freq subscription - 4 freq subservience - 1 freq subscribers - 2 freq speikars - 2 freq subscribed - 1 freq spaeker - 20 freq safegairdit - 3 freq speakers' - 1 freq speaker's - 1 freq safeguarded - 1 freq subscrievin - 1 freq spacer - 2 freq spacers - 2 freq spaekers - 39 freq sub-curns - 1 freq saifeguards - 1 freq spakers - 4 freq sub-zero - 1 freq spickers - 15 freq spykarie - 3 freq speikar - 1 freq speikers - 46 freq subscreivins - 34 freq spaekkirs - 1 freq safeguaird - 1 freq safeguard - 1 freq spaeker'll - 1 freq sub-group - 2 freq savagerie - 1 freq spikkars - 1 freq spiker - 1 freq subservient - 1 freq subscreive - 1 freq spicker - 4 freq saufgairds - 1 freq subscreivers - 1 freq speakerphone - 1 freq spaekir - 2 freq spaekirs - 1 freq spaker - 3 freq savage-armstrong - 1 freq safejourney - 1 freq soupcruncher - 2 freq sfqxsxrmoa - 1 freq szvqrelcbo - 1 freq |
MetaPhone code - SPKRS spikkers - 75 freq speakers - 223 freq spikers - 3 freq speikars - 2 freq speakers' - 1 freq speaker's - 1 freq spaekers - 39 freq spakers - 4 freq spickers - 15 freq speikers - 46 freq spaekkirs - 1 freq spikkars - 1 freq spaekirs - 1 freq |
SPEAKERS speak - 551 freq spik - 308 freq speakers - 223 freq speakin - 235 freq speaks - 87 freq speaker - 64 freq speaking - 29 freq speakin' - 2 freq spoke - 267 freq spoken - 214 freq spokken - 47 freq spok - 5 freq spokin - 5 freq spokan - 3 freq unspoken - 4 freq spokesman - 2 freq |
| Time to execute Levenshtein function - 0.508230 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.894550 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.086249 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.096234 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.000916 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. |