| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| sign-oan (0) - 1 freq ignoran (3) - 2 freq side-on (3) - 1 freq signboard (3) - 3 freq sign-ups (3) - 1 freq inn-man (3) - 1 freq six-man (3) - 1 freq sighan (3) - 5 freq sinkan (3) - 2 freq signin (3) - 22 freq singan (3) - 12 freq rig-on (3) - 1 freq sun-tan (3) - 2 freq sign-aff (3) - 1 freq tin-an (3) - 1 freq ignorn (3) - 1 freq signal (3) - 30 freq yin-man (3) - 2 freq signalman (3) - 7 freq ringan (4) - 3 freq yit-an (4) - 2 freq undoan (4) - 2 freq kickoan (4) - 1 freq sendan (4) - 3 freq incoman (4) - 1 freq |
sign-oan (0) - 1 freq signin (4) - 22 freq tin-an (5) - 1 freq sign-aff (5) - 1 freq sun-tan (5) - 2 freq signal (5) - 30 freq sein-na (5) - 1 freq seen-nae (5) - 1 freq syne-an (5) - 1 freq signalman (5) - 7 freq rig-on (5) - 1 freq ignorn (5) - 1 freq side-on (5) - 1 freq sign-ups (5) - 1 freq ignoran (5) - 2 freq singan (5) - 12 freq sinkan (5) - 2 freq sighan (5) - 5 freq shannon (6) - 2 freq shin-o- (6) - 1 freq some-ean (6) - 28 freq sundoon (6) - 2 freq shin-bane (6) - 1 freq sgian (6) - 2 freq signallin (6) - 4 freq |
SoundEx code - S255 signin - 22 freq seasonin - 1 freq six-man - 1 freq sagamen - 1 freq segment - 1 freq seekenin - 1 freq sign-oan - 1 freq sizzonin - 1 freq seeknin - 2 freq sickenin - 4 freq signin-up - 1 freq saisoneen - 1 freq segments - 2 freq sickening - 2 freq €˜sickening - 1 freq €˜signin - 1 freq swackenin - 1 freq signing - 12 freq signings - 8 freq signins - 2 freq susaninlangside - 1 freq suzannemagowan - 1 freq susannahmacneil - 1 freq |
MetaPhone code - SNN snaain - 2 freq syne-an - 1 freq sennin - 12 freq sunnin - 5 freq seenin - 1 freq senin' - 1 freq sounin - 8 freq sign-oan - 1 freq seen-nae - 1 freq soonin - 1 freq sainin - 4 freq sinnin - 2 freq sinnonie - 1 freq sein-na - 1 freq seoinÃnà - 1 freq 'sinin - 1 freq |
SIGN-OAN |
| Time to execute Levenshtein function - 0.193734 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.349248 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.027225 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.037059 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. |