| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| soar-lik (0) - 1 freq slaw-lik (2) - 1 freq sae-lik (2) - 2 freq sac-lik (2) - 1 freq siccar-lik (3) - 1 freq gah-lik (3) - 1 freq gay-lik (3) - 1 freq startlin (3) - 2 freq sun-lik (3) - 1 freq slaw-like (3) - 1 freq snaar-like (3) - 1 freq starlit (3) - 1 freq snarlin (3) - 9 freq slawlik (3) - 2 freq sojer-like (3) - 1 freq soartit (3) - 1 freq dour-like (3) - 1 freq sparklin (3) - 12 freq saw-like (3) - 1 freq soartin (3) - 5 freq saelik (3) - 1 freq joco-lik (3) - 3 freq leaf-lik (3) - 1 freq some-like (3) - 1 freq soarely (3) - 1 freq |
soar-lik (0) - 1 freq sae-lik (3) - 2 freq sac-lik (3) - 1 freq sun-lik (4) - 1 freq saw-like (4) - 1 freq snaar-like (4) - 1 freq dour-like (4) - 1 freq soup-like (4) - 1 freq slaw-lik (4) - 1 freq some-like (4) - 1 freq soorlike (4) - 1 freq sojer-like (4) - 1 freq saft-lik (5) - 1 freq soylik (5) - 1 freq shairp-lik (5) - 1 freq soorik (5) - 2 freq soor-dook (5) - 1 freq saut-like (5) - 1 freq sic-like (5) - 11 freq owre-like (5) - 1 freq sik-like (5) - 2 freq soarely (5) - 1 freq sour-dook (5) - 1 freq orra-like (5) - 1 freq sweir-like (5) - 1 freq |
SoundEx code - S642 skirls - 16 freq square-lookin - 1 freq sherlock - 7 freq squirrels - 20 freq scrolls - 6 freq scurrilous - 2 freq sair-leukin - 1 freq soar-lik - 1 freq soorlike - 1 freq 'squirrels - 1 freq swirls - 7 freq surrealism - 2 freq sairless - 1 freq square-lickly - 1 freq scurls - 1 freq soor-lukkan - 1 freq skerls - 3 freq serialise - 1 freq surrealist - 1 freq sweir-like - 1 freq skirls'll - 1 freq skroils - 1 freq surreywallcreep - 1 freq |
MetaPhone code - SRLK cyrillic - 1 freq soar-lik - 1 freq soorlike - 1 freq |
SOAR-LIK |
| Time to execute Levenshtein function - 0.223576 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.393175 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.028083 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.037405 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.000883 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. |