| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| surreywallcreep (0) - 1 freq surreally (7) - 1 freq surreal (8) - 8 freq surrealism (8) - 2 freq surveillance (8) - 5 freq surveyar (8) - 1 freq surrendered (8) - 3 freq surrealist (8) - 1 freq summerhallery (8) - 1 freq brylcreem (8) - 3 freq unroyalle (8) - 1 freq surrealthing (8) - 1 freq baurley-bree (9) - 1 freq barley-bree (9) - 1 freq sugaracre (9) - 1 freq chrysalis-ee (9) - 2 freq beautycreep (9) - 1 freq supermarket (9) - 20 freq surrey (9) - 2 freq surroondeed (9) - 2 freq swallowed (9) - 9 freq audreymarks (9) - 2 freq swallen (9) - 4 freq shirenpolice (9) - 1 freq surgeries (9) - 1 freq |
surreywallcreep (0) - 1 freq surreally (11) - 1 freq summerhallery (13) - 1 freq rorywalker (13) - 11 freq storyteller (13) - 7 freq surrealist (13) - 1 freq surrealthing (13) - 1 freq brylcreem (13) - 3 freq surrendered (13) - 3 freq surreal (13) - 8 freq surveillance (13) - 5 freq surrealism (13) - 2 freq storytellers (13) - 4 freq screwball (14) - 2 freq scurriewhirrie (14) - 1 freq garrydclarke (14) - 2 freq surrenderit (14) - 1 freq lauriewalters (14) - 1 freq corralled (14) - 2 freq sleepwalkers (14) - 1 freq swallyed (14) - 1 freq swallayed (14) - 1 freq swalleyed (14) - 1 freq swallied (14) - 15 freq sugarallie (14) - 3 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 - SRWLKRP surreywallcreep - 1 freq |
SURREYWALLCREEP |
| Time to execute Levenshtein function - 0.230420 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.432289 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.031027 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.038315 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.000920 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. |