Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
sichts (0) - 51 freq wichts (1) - 3 freq richts (1) - 195 freq sicht (1) - 621 freq eichts (1) - 4 freq hichts (1) - 10 freq slichts (1) - 2 freq tichts (1) - 1 freq fichts (1) - 1 freq sichs (1) - 5 freq nichts (1) - 159 freq sights (1) - 7 freq dichts (1) - 7 freq lichts (1) - 180 freq fechts (2) - 31 freq sikhs (2) - 3 freq sichtin (2) - 4 freq shicht (2) - 2 freq picts (2) - 42 freq vrichts (2) - 1 freq bicht (2) - 2 freq eichty (2) - 7 freq hechts (2) - 3 freq swichis (2) - 5 freq sichted (2) - 4 freq |
sichts (0) - 51 freq sichs (2) - 5 freq fichts (2) - 1 freq nichts (2) - 159 freq dichts (2) - 7 freq lichts (2) - 180 freq tichts (2) - 1 freq sights (2) - 7 freq slichts (2) - 2 freq wichts (2) - 3 freq richts (2) - 195 freq sicht (2) - 621 freq eichts (2) - 4 freq hichts (2) - 10 freq heichts (3) - 11 freq nochts (3) - 1 freq scots (3) - 6843 freq weichts (3) - 4 freq sichtit (3) - 7 freq ochts (3) - 3 freq wechts (3) - 6 freq machts (3) - 2 freq socht (3) - 143 freq pechts (3) - 77 freq sichtie (3) - 1 freq |
SoundEx code - S232 sockets - 8 freq sichts - 51 freq saxties - 4 freq societies - 14 freq sassidges - 1 freq sixties - 15 freq 'sax-days - 1 freq sixty-six - 5 freq sixtie-sein - 1 freq sights - 7 freq sixty-eight - 1 freq saxty-somethin - 2 freq sightsman's - 1 freq sassidge - 6 freq succeeds - 1 freq saxty-sax - 1 freq shghtest - 1 freq saegates - 1 freq sects - 2 freq sichtseers - 1 freq sightseers - 1 freq sightsee - 1 freq siestas - 1 freq skectches - 1 freq saasidges - 1 freq sossidge - 1 freq |
MetaPhone code - SXTS sichts - 51 freq schades - 1 freq |
SICHTS |
Time to execute Levenshtein function - 0.211923 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.337851 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.034534 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.042930 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.000884 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. |