| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| seeknin (0) - 2 freq seekin (1) - 100 freq seenin (1) - 1 freq seekenin (1) - 1 freq seekin' (2) - 9 freq seechin (2) - 1 freq peekin (2) - 3 freq stennin (2) - 1 freq seepin (2) - 13 freq keenin (2) - 10 freq leernin (2) - 1 freq meenin (2) - 1 freq sheenin (2) - 26 freq bleknin (2) - 1 freq speanin (2) - 1 freq smeekin (2) - 2 freq deekin (2) - 2 freq sleekin (2) - 5 freq seemin (2) - 14 freq seekit (2) - 1 freq reekin (2) - 45 freq spennin (2) - 21 freq eenin (2) - 5 freq sekein (2) - 3 freq sennin (2) - 12 freq |
seeknin (0) - 2 freq seekenin (1) - 1 freq seenin (2) - 1 freq seekin (2) - 100 freq sheenin (3) - 26 freq speanin (3) - 1 freq sekein (3) - 3 freq seekan (3) - 3 freq sennin (3) - 12 freq keenin (3) - 10 freq seekin' (3) - 9 freq seeking (3) - 6 freq sekin (3) - 2 freq sekan (4) - 2 freq eskin (4) - 2 freq stounin (4) - 7 freq shynin (4) - 1 freq skein (4) - 8 freq souklin (4) - 1 freq skjin (4) - 1 freq sooklin (4) - 1 freq seasonin (4) - 1 freq skinnin (4) - 3 freq kenin (4) - 2 freq skewin (4) - 2 freq |
SoundEx code - S255 signin - 21 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 - SKNN signin - 21 freq scannin - 8 freq seekenin - 1 freq seeknin - 2 freq scannan - 1 freq sickenin - 4 freq skinnin - 3 freq €˜signin - 1 freq |
SEEKNIN |
| Time to execute Levenshtein function - 0.248629 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.609053 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.055065 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.041262 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.000812 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. |