| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| seeck-beds (0) - 1 freq seik-bed (3) - 1 freq seeckened (3) - 1 freq reek-less (4) - 1 freq skecked (4) - 2 freq seeck-time (4) - 2 freq seeck-like (4) - 1 freq week-ens (4) - 1 freq seeched (4) - 1 freq skecklers (4) - 1 freq seckless (4) - 1 freq speckled (4) - 3 freq speckles (4) - 1 freq seekened (4) - 1 freq snecked (4) - 6 freq seekness (4) - 11 freq secked (4) - 2 freq seed-heids (4) - 1 freq weecked (4) - 1 freq seekers (4) - 9 freq seed-baas (4) - 1 freq derk-eed (5) - 4 freq lockheeds (5) - 1 freq sunbeds (5) - 6 freq necked (5) - 2 freq |
seeck-beds (0) - 1 freq seik-bed (5) - 1 freq pickie-beds (6) - 1 freq seeckened (6) - 1 freq suackbuts (7) - 1 freq seed-baas (7) - 1 freq seckless (7) - 1 freq seed-heids (7) - 1 freq secked (7) - 2 freq seeck-like (7) - 1 freq seeck-time (7) - 2 freq s-bends (8) - 1 freq bunk-bed (8) - 1 freq sickies (8) - 2 freq sucked (8) - 6 freq succeeds (8) - 1 freq sickens (8) - 2 freq sackless (8) - 1 freq screeds (8) - 13 freq sockets (8) - 8 freq back-buirds (8) - 1 freq skrieds (8) - 1 freq suckled (8) - 3 freq scuil-bus (8) - 2 freq sun-bed (8) - 4 freq |
SoundEx code - S213 saggy-bawed - 1 freq six-fit - 2 freq sauch-patternt - 1 freq six-fit-four - 3 freq six-foot - 1 freq seeck-beds - 1 freq six-feet - 1 freq shoogie-boats - 1 freq suackbuts - 1 freq seik-bed - 1 freq sax-fit - 1 freq suspetioun - 1 freq suspeitioun - 1 freq susbtrate - 1 freq susceptible - 3 freq sesspit - 1 freq |
MetaPhone code - SKBTS seeck-beds - 1 freq suackbuts - 1 freq |
SEECK-BEDS |
| Time to execute Levenshtein function - 0.233876 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.403785 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.035652 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.038843 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.000954 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. |