| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| soartet (0) - 1 freq soartit (1) - 1 freq soarted (1) - 1 freq startet (1) - 150 freq sortet (1) - 4 freq scartit (2) - 23 freq starteth (2) - 1 freq startt (2) - 1 freq startit (2) - 157 freq scarted (2) - 1 freq coatet (2) - 3 freq sorten (2) - 2 freq starter (2) - 7 freq quartet (2) - 1 freq startelt (2) - 1 freq soartin (2) - 5 freq smarten (2) - 1 freq starten (2) - 3 freq smartest (2) - 4 freq skartit (2) - 8 freq soart (2) - 47 freq soarts (2) - 12 freq sorbet (2) - 2 freq soarey (2) - 1 freq soared (2) - 6 freq |
soartet (0) - 1 freq soartit (1) - 1 freq sortet (1) - 4 freq sortit (2) - 51 freq startet (2) - 150 freq soarted (2) - 1 freq soartae (3) - 14 freq stertet (3) - 2 freq soarts (3) - 12 freq soart (3) - 47 freq sorbet (3) - 2 freq stairtet (3) - 92 freq snortet (3) - 1 freq stoatet (3) - 1 freq fartet (3) - 2 freq skartit (3) - 8 freq spartit (3) - 2 freq sorted (3) - 75 freq saltet (3) - 1 freq scartit (3) - 23 freq quartet (3) - 1 freq sorten (3) - 2 freq startt (3) - 1 freq sertit (3) - 1 freq soartin (3) - 5 freq |
SoundEx code - S633 sortit - 51 freq soartit - 1 freq sorted - 75 freq surtout - 1 freq scartit - 23 freq skirtit - 3 freq serrated - 1 freq shrouded - 2 freq sortet - 4 freq shrood-white - 1 freq soarted - 1 freq skartit - 8 freq scrattit - 16 freq squirtit - 1 freq soartet - 1 freq shreddit - 2 freq squirted - 3 freq shrooded - 1 freq scarted - 1 freq shoarded - 1 freq scordet - 1 freq skirted - 2 freq short-o-time - 1 freq €˜sorted - 1 freq sertit - 1 freq shredded - 3 freq sjrthtuqlg - 1 freq |
MetaPhone code - SRTT sortit - 51 freq soartit - 1 freq sorted - 75 freq surtout - 1 freq serrated - 1 freq sortet - 4 freq soarted - 1 freq soartet - 1 freq €˜sorted - 1 freq sertit - 1 freq sortd - 2 freq |
SOARTET |
| Time to execute Levenshtein function - 0.251902 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.403185 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.029328 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.040193 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.000842 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. |