| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| sortir (0) - 1 freq sortin (1) - 24 freq sortie (1) - 2 freq sorti (1) - 2 freq sortit (1) - 51 freq orti (2) - 1 freq snortit (2) - 16 freq soartit (2) - 1 freq mortar (2) - 9 freq sorten (2) - 2 freq shorter (2) - 24 freq sorrit (2) - 4 freq tortur (2) - 3 freq snortin (2) - 13 freq fortig (2) - 1 freq sportin (2) - 18 freq sortet (2) - 4 freq stir (2) - 19 freq sort (2) - 310 freq stoatir (2) - 3 freq soir (2) - 1 freq dortie (2) - 3 freq sorner (2) - 3 freq dotir (2) - 1 freq sortae (2) - 19 freq |
sortir (0) - 1 freq sorti (2) - 2 freq sortit (2) - 51 freq sortie (2) - 2 freq sortin (2) - 24 freq soartin (3) - 5 freq sartin (3) - 6 freq sorr (3) - 1 freq torter (3) - 1 freq sertit (3) - 1 freq sentir (3) - 1 freq souter (3) - 9 freq sistir (3) - 1 freq sort' (3) - 1 freq sorrie (3) - 2 freq porter (3) - 14 freq softer (3) - 4 freq sorted (3) - 79 freq sorta (3) - 6 freq sorts (3) - 71 freq sortan (3) - 1 freq sortd (3) - 2 freq soutar (3) - 39 freq horter (3) - 1 freq sotter (3) - 34 freq |
SoundEx code - S636 shorter - 24 freq sartre - 1 freq screwdriver - 14 freq sartorial - 2 freq short-term - 2 freq scroodriver - 2 freq sair-thrappled - 1 freq shooer-toarn - 1 freq shorthorns - 1 freq short-haired - 1 freq shoarter - 1 freq screwdriver' - 5 freq sartorially - 1 freq short-arse - 1 freq schreuder - 14 freq sortir - 1 freq srtrcscotland - 1 freq sjurdur - 2 freq |
MetaPhone code - SRTR sartre - 1 freq sortir - 1 freq |
SORTIR |
| Time to execute Levenshtein function - 0.224862 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.421024 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.032857 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.048491 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.001112 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. |