| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| skylark (0) - 2 freq skylarks (1) - 2 freq skolar (2) - 1 freq sklaik (2) - 2 freq skyward (2) - 4 freq skywart (2) - 1 freq sjclark (2) - 1 freq skylark's (2) - 1 freq sellars (3) - 1 freq skywarts (3) - 1 freq sklave (3) - 2 freq salary (3) - 4 freq sylk (3) - 1 freq skrank (3) - 2 freq solar (3) - 22 freq skyline (3) - 6 freq skeldro (3) - 1 freq skaars (3) - 1 freq shark (3) - 21 freq lark (3) - 23 freq slaak (3) - 5 freq skyled (3) - 1 freq slak (3) - 2 freq spark (3) - 35 freq skyre (3) - 6 freq |
skylark (0) - 2 freq skylarks (2) - 2 freq sklaik (3) - 2 freq skolar (3) - 1 freq skulk (4) - 1 freq skybrek (4) - 6 freq skylark's (4) - 1 freq skraik (4) - 4 freq sjclark (4) - 1 freq skywart (4) - 1 freq skyward (4) - 4 freq slack (5) - 27 freq skare (5) - 4 freq slaik (5) - 1 freq stark (5) - 32 freq skyran (5) - 3 freq skrek (5) - 4 freq i'lark (5) - 1 freq clark (5) - 32 freq sklate (5) - 1 freq sellar (5) - 15 freq skulrie (5) - 1 freq skulerie (5) - 1 freq sillar (5) - 3 freq skara (5) - 4 freq |
SoundEx code - S462 scullery's - 1 freq sculleries - 1 freq scholars - 35 freq siller's - 4 freq schoolwork - 2 freq sel-richtous - 1 freq shoulers - 6 freq sailors - 17 freq slurs - 3 freq seller's - 1 freq slorach - 1 freq sailor's - 2 freq scholarship - 9 freq slrc - 15 freq slrc's - 2 freq schullars - 1 freq siller-secks - 1 freq 'sailor's - 1 freq skylark's - 1 freq sauler's - 1 freq sellars - 1 freq saulers - 1 freq slayers - 2 freq salaries - 3 freq siller-glaurin - 1 freq sillerknowes - 2 freq shell-wark - 1 freq scholarship' - 1 freq sailors' - 2 freq skülwark - 1 freq siller-grey - 1 freq sellers - 2 freq sellers' - 1 freq slairgy - 1 freq sillars - 2 freq skylark - 2 freq sjclark - 1 freq skylarks - 2 freq ssalyers - 11 freq solwayrecycling - 1 freq |
MetaPhone code - SKLRK skylark - 2 freq |
SKYLARK |
| Time to execute Levenshtein function - 0.209541 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.412985 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.027606 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.039476 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.000855 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. |