| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| skeletal (0) - 6 freq skeleton (2) - 8 freq skelet (2) - 3 freq skelets (2) - 2 freq 'skeleton (3) - 1 freq sklentan (3) - 2 freq veleta (3) - 1 freq skelter (3) - 2 freq skeetin (3) - 1 freq sheetae (3) - 1 freq skelpt (3) - 22 freq societal (3) - 4 freq skeet (3) - 1 freq skellat (3) - 1 freq several (3) - 45 freq skeletons (3) - 11 freq skeel (3) - 45 freq skelton (3) - 1 freq celestal (3) - 1 freq seeveral (3) - 1 freq skeetly (3) - 1 freq skelt (3) - 1 freq skellet (3) - 4 freq sklenty (4) - 1 freq stele (4) - 1 freq |
skeletal (0) - 6 freq skelets (3) - 2 freq skelet (3) - 3 freq skeleton (3) - 8 freq skeetly (4) - 1 freq skelter (4) - 2 freq skelton (4) - 1 freq skelt (4) - 1 freq sklite (5) - 1 freq skeill (5) - 10 freq skellet (5) - 4 freq sklate (5) - 1 freq sklater (5) - 1 freq skilful (5) - 4 freq skellie (5) - 4 freq skult (5) - 2 freq skill (5) - 55 freq skiltin (5) - 1 freq skults (5) - 1 freq sklates (5) - 1 freq skelpt (5) - 22 freq societal (5) - 4 freq 'skeleton (5) - 1 freq skeetin (5) - 1 freq skull (5) - 45 freq |
SoundEx code - S434 skeletal - 6 freq shieldhill - 4 freq solidlike - 1 freq shealtiel - 7 freq sheltielisa - 4 freq scallowayhotel - 1 freq saltlangs - 1 freq |
MetaPhone code - SKLTL skeletal - 6 freq |
SKELETAL |
| Time to execute Levenshtein function - 0.191738 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.337289 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.028884 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.036701 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.000824 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. |