| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| spoof (0) - 2 freq spoon (1) - 55 freq skoof (1) - 2 freq sporf (1) - 1 freq spook (1) - 1 freq spoor (1) - 2 freq spool (1) - 2 freq poof (1) - 10 freq spoot (1) - 17 freq scoof (1) - 1 freq spoff (1) - 4 freq sloop (2) - 3 freq spoont (2) - 1 freq shoon (2) - 14 freq stoop (2) - 16 freq poofs (2) - 5 freq smool (2) - 4 freq toof (2) - 1 freq shoot (2) - 70 freq pool (2) - 110 freq sowf (2) - 3 freq skool (2) - 3 freq skoor (2) - 1 freq stool (2) - 22 freq spron (2) - 1 freq |
spoof (0) - 2 freq poof (2) - 10 freq scoof (2) - 1 freq spf (2) - 1 freq spool (2) - 2 freq spoff (2) - 4 freq spoot (2) - 17 freq spoor (2) - 2 freq spoon (2) - 55 freq skoof (2) - 2 freq sporf (2) - 1 freq spook (2) - 1 freq spoke (3) - 267 freq spoil (3) - 14 freq skouf (3) - 1 freq spoat (3) - 8 freq spow (3) - 1 freq spok (3) - 5 freq spose (3) - 9 freq spo (3) - 1 freq spoak (3) - 1 freq spoty (3) - 1 freq spon (3) - 1 freq spooky (3) - 7 freq soop (3) - 17 freq |
SoundEx code - S110 spaewife - 6 freq spoff - 4 freq spae-wife - 2 freq spae-wyfe - 1 freq spoof - 2 freq sfaf - 1 freq skiphop - 1 freq spae-wife' - 1 freq |
MetaPhone code - SPF spoff - 4 freq spugh - 1 freq spae-wyfe - 1 freq spoof - 2 freq spf - 1 freq |
SPOOF |
| Time to execute Levenshtein function - 0.214493 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.369428 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.027283 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.036518 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.000800 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. |