| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| spraff (0) - 3 freq straff (1) - 2 freq spray (2) - 41 freq spraik (2) - 1 freq paff (2) - 1 freq spraffin (2) - 6 freq geraff (2) - 1 freq sclaff (2) - 4 freq sprags (2) - 1 freq spoff (2) - 4 freq straffs (2) - 1 freq sprawl (2) - 3 freq scruff (2) - 10 freq staff (2) - 106 freq spliff (2) - 8 freq spraffed (2) - 2 freq sprang (2) - 17 freq strafef (2) - 1 freq spraed (2) - 4 freq scaff (2) - 2 freq spratt (2) - 2 freq graff (2) - 4 freq caff (3) - 13 freq flaff (3) - 5 freq preif (3) - 1 freq |
spraff (0) - 3 freq straff (2) - 2 freq spraffed (3) - 2 freq strafef (3) - 1 freq spoff (3) - 4 freq scruff (3) - 10 freq spraffin (3) - 6 freq spliff (3) - 8 freq sprang (4) - 17 freq spraed (4) - 4 freq graff (4) - 4 freq sporf (4) - 1 freq scruffy (4) - 6 freq sheriff (4) - 13 freq spratt (4) - 2 freq scaff (4) - 2 freq spraik (4) - 1 freq paff (4) - 1 freq staff (4) - 106 freq sclaff (4) - 4 freq geraff (4) - 1 freq straffs (4) - 1 freq sprawl (4) - 3 freq sprags (4) - 1 freq spray (4) - 41 freq |
SoundEx code - S161 spraff - 3 freq soporific - 2 freq suburban - 5 freq spray-painted - 2 freq sperfilt - 3 freq superpooers - 1 freq suburbs - 7 freq supervisor - 3 freq supervise - 3 freq superviser - 1 freq super-bricht - 2 freq supervitamin - 2 freq spray-pintit - 1 freq superfluous - 1 freq superb - 16 freq superficial - 3 freq soporiferissniss - 1 freq sparrabaldy - 1 freq spray-pent - 1 freq supervisin - 1 freq supervises - 1 freq super-bitch - 1 freq superfoam - 1 freq superfeeciality - 1 freq superfeecial - 1 freq spraffin - 6 freq spraffed - 2 freq superbly - 1 freq superabundance - 1 freq superpowers - 1 freq suburb - 4 freq sprp - 1 freq shoveyerbingo - 1 freq supervet - 1 freq superpower - 1 freq supervised - 1 freq sporf - 1 freq superbly-named - 1 freq |
MetaPhone code - SPRF spraff - 3 freq sporf - 1 freq |
SPRAFF |
| Time to execute Levenshtein function - 0.184643 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.325772 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.027760 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.037115 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.000828 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. |