| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| splurtit (0) - 1 freq spurtit (1) - 1 freq blurtit (2) - 2 freq speertit (2) - 1 freq spleetit (2) - 1 freq splirtin (2) - 1 freq staurtit (2) - 1 freq spartit (2) - 2 freq splintit (2) - 1 freq upluftit (2) - 1 freq pluntit (2) - 3 freq spurtin (2) - 2 freq spurit (2) - 1 freq salutit (2) - 1 freq splut (3) - 2 freq pleatit (3) - 3 freq slottit (3) - 2 freq slurrin (3) - 1 freq spluttert (3) - 4 freq spluttrin (3) - 1 freq spittit (3) - 2 freq pairtit (3) - 21 freq spleetin (3) - 1 freq sautit (3) - 2 freq slurpin (3) - 6 freq |
splurtit (0) - 1 freq spurtit (2) - 1 freq spartit (3) - 2 freq splintit (3) - 1 freq splirtin (3) - 1 freq spleetit (3) - 1 freq speertit (3) - 1 freq splatt (4) - 1 freq sproutit (4) - 1 freq sprootit (4) - 3 freq spiritit (4) - 1 freq supportit (4) - 39 freq speiritit (4) - 1 freq speeritit (4) - 1 freq spurtin (4) - 2 freq upluftit (4) - 1 freq spurit (4) - 1 freq salutit (4) - 1 freq staurtit (4) - 1 freq pluntit (4) - 3 freq blurtit (4) - 2 freq spleit (5) - 1 freq plauntit (5) - 2 freq spartilt (5) - 1 freq spurts (5) - 1 freq |
SoundEx code - S146 splerin - 1 freq splore-seekin - 1 freq splore - 25 freq splairgin - 4 freq splores - 12 freq splairge - 4 freq suppliers - 6 freq spieler - 1 freq splored - 1 freq splairged - 5 freq speller - 2 freq scapular - 1 freq splers - 1 freq splorin - 7 freq splurtit - 1 freq splairges - 1 freq supplearis - 1 freq supplier - 3 freq splyerin - 1 freq splirtin - 1 freq spellers - 1 freq spilers - 1 freq spoilers - 2 freq spilleroftea - 2 freq |
MetaPhone code - SPLRTT splurtit - 1 freq |
SPLURTIT |
| Time to execute Levenshtein function - 0.222951 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.388889 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.027992 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.038576 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.000923 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. |