| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| spae-man (0) - 1 freq spaeman (1) - 1 freq spaceman (2) - 1 freq spaellan (2) - 1 freq sae-an (2) - 1 freq spaekan (2) - 32 freq pac-man (2) - 1 freq spaemen (2) - 3 freq he-man (3) - 1 freq shaetlan (3) - 284 freq staemin (3) - 1 freq spaekin (3) - 114 freq paean (3) - 2 freq streaman (3) - 1 freq speakan (3) - 6 freq speiran (3) - 7 freq spreadan (3) - 2 freq spearman (3) - 1 freq spean (3) - 2 freq some-ean (3) - 28 freq six-man (3) - 1 freq snawman (3) - 10 freq spellan (3) - 1 freq sea-maw (3) - 2 freq spearsman (3) - 1 freq |
spae-man (0) - 1 freq spaeman (2) - 1 freq spaemen (3) - 3 freq spaceman (3) - 1 freq six-man (4) - 1 freq spammin (4) - 1 freq spearman (4) - 1 freq spaellan (4) - 1 freq superman (4) - 6 freq sae-an (4) - 1 freq spaekan (4) - 32 freq pac-man (4) - 1 freq specimen (5) - 3 freq spokesman (5) - 2 freq penman (5) - 1 freq syne-an (5) - 1 freq spankan (5) - 1 freq spreidan (5) - 1 freq spennan (5) - 1 freq seaman (5) - 4 freq hype-men (5) - 1 freq scheman (5) - 1 freq soleman (5) - 2 freq salesman (5) - 17 freq saemin (5) - 1 freq |
SoundEx code - S155 spinnin - 55 freq seeven-hunner - 1 freq seeven-an-a-hauf - 1 freq spennin - 21 freq spammin - 1 freq spannin - 4 freq spennen - 1 freq shipment - 1 freq subhuman - 1 freq spaemen - 3 freq spinin' - 1 freq shipman - 3 freq spinnan - 3 freq spawnin - 1 freq sofnan - 1 freq shipmen - 1 freq spae-man - 1 freq spaeman - 1 freq spennan - 1 freq €œspawnin - 1 freq spinning - 9 freq spumantis - 1 freq speanin - 1 freq spinnin' - 2 freq |
MetaPhone code - SPMN spammin - 1 freq spaemen - 3 freq spae-man - 1 freq spaeman - 1 freq |
SPAE-MAN |
| Time to execute Levenshtein function - 0.303158 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.582284 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.066067 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.038026 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.000876 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. |