| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| sprawl (0) - 3 freq scrawl (1) - 7 freq spiral (2) - 10 freq drawl (2) - 4 freq strahl (2) - 1 freq sprang (2) - 17 freq strawd (2) - 1 freq trawl (2) - 3 freq sparl (2) - 1 freq spail (2) - 2 freq spall (2) - 1 freq strawn (2) - 1 freq speal (2) - 1 freq spreul (2) - 1 freq spraff (2) - 3 freq sprawl't (2) - 2 freq spael (2) - 1 freq crawl (2) - 27 freq spraed (2) - 4 freq spawn (2) - 5 freq sprawlin (2) - 4 freq spratt (2) - 2 freq brawl (2) - 1 freq sprawled (2) - 8 freq shawl (2) - 26 freq |
sprawl (0) - 3 freq scrawl (2) - 7 freq prowl (3) - 8 freq spreul (3) - 1 freq sprawled (3) - 8 freq sprawlin (3) - 4 freq sparl (3) - 1 freq sprawlan (3) - 1 freq sprawlit (3) - 1 freq spiral (3) - 10 freq prawn (4) - 3 freq spray (4) - 41 freq shawl (4) - 26 freq sprewin (4) - 1 freq sprags (4) - 1 freq spirl (4) - 4 freq straws (4) - 5 freq brawl (4) - 1 freq spraik (4) - 1 freq straw (4) - 27 freq rawl (4) - 1 freq 'prawn (4) - 1 freq strawd (4) - 1 freq spail (4) - 2 freq spall (4) - 1 freq |
SoundEx code - S164 severely - 8 freq sprawlin - 4 freq several - 45 freq spirl - 4 freq spirls - 3 freq spiral - 10 freq sprawled - 8 freq skipper'll - 2 freq spirlie - 7 freq sprawl - 3 freq seevral - 1 freq spraalin - 2 freq soberlie - 1 freq saiveral - 6 freq sprawlit - 1 freq spirallin - 3 freq spraaled - 3 freq spraalled - 1 freq spurled - 1 freq spirillum - 1 freq sporulate - 1 freq seeveral - 1 freq sprawlan - 1 freq superlative - 3 freq sparl - 1 freq sea-ferlies - 1 freq spiralled - 1 freq spirals - 2 freq spiralin - 2 freq schapiarelli - 1 freq spirlin - 1 freq saivrel - 12 freq sprawl't - 2 freq superlatives - 1 freq spreul - 1 freq spreul's - 1 freq spiralling - 2 freq superleague - 1 freq |
MetaPhone code - SPRL spirl - 4 freq spiral - 10 freq spirlie - 7 freq sprawl - 3 freq sparl - 1 freq spreul - 1 freq |
SPRAWL |
| Time to execute Levenshtein function - 0.213854 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.375557 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.027765 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.036626 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.000931 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. |