Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
scrawled (0) - 4 freq scraaled (1) - 1 freq sprawled (1) - 9 freq crawled (1) - 26 freq scawed (2) - 1 freq scrowed (2) - 2 freq schawed (2) - 4 freq spraaled (2) - 3 freq crawler (2) - 1 freq scrabbed (2) - 3 freq scrolled (2) - 2 freq shawled (2) - 1 freq scrambled (2) - 7 freq crowled (2) - 2 freq scraped (2) - 14 freq scranned (2) - 4 freq cradled (2) - 7 freq screwed (2) - 30 freq scowled (2) - 3 freq crawed (2) - 7 freq craaled (2) - 8 freq scraffled (2) - 1 freq trawled (2) - 3 freq scaled (2) - 7 freq scrammled (2) - 6 freq |
scrawled (0) - 4 freq sprawled (2) - 9 freq crawled (2) - 26 freq scraaled (2) - 1 freq screwed (3) - 30 freq scrolled (3) - 2 freq scrawl (3) - 7 freq scrowed (3) - 2 freq scowled (3) - 3 freq crowled (3) - 2 freq craaled (4) - 8 freq crawed (4) - 7 freq scragged (4) - 1 freq scartled (4) - 1 freq scaled (4) - 7 freq trawled (4) - 3 freq scraffled (4) - 1 freq scrammled (4) - 6 freq crawler (4) - 1 freq spraaled (4) - 3 freq cradled (4) - 7 freq scawed (4) - 1 freq scrabbed (4) - 3 freq schawed (4) - 4 freq scranned (4) - 4 freq |
SoundEx code - S643 scarlet - 22 freq skirled - 101 freq scairlet - 1 freq skirlt - 1 freq swirled - 3 freq scrawled - 4 freq swirlt - 2 freq shareholders - 2 freq skirlit - 1 freq scrolled - 2 freq shareholders' - 1 freq scarlett - 1 freq scarlet-heavy - 1 freq squirrelt - 1 freq scraaled - 1 freq surrealtimescot - 1 freq surrealthing - 1 freq shireldp - 1 freq |
MetaPhone code - SKRLT scarlet - 22 freq skirled - 101 freq scairlet - 1 freq skirlt - 1 freq scrawled - 4 freq skirlit - 1 freq scrolled - 2 freq scarlett - 1 freq squirrelt - 1 freq scraaled - 1 freq |
SCRAWLED |
Time to execute Levenshtein function - 0.230432 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.392265 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.028578 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.037952 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.000911 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. |