| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| shrood-white (0) - 1 freq rosy-white (4) - 1 freq snaw-white (5) - 13 freq ghaist-white (5) - 1 freq sheepwhite (5) - 1 freq grey-white (5) - 1 freq prood-like (5) - 1 freq saft-white (5) - 1 freq chaak-white (5) - 2 freq pearl-white (6) - 1 freq birdshite (6) - 2 freq proodlie (6) - 2 freq blae-white (6) - 1 freq chance-whit (6) - 1 freq snawwhite (6) - 1 freq hoosewife (6) - 1 freq shoodert (6) - 1 freq aphrodite (6) - 20 freq shore-line (6) - 1 freq shood''ve (6) - 1 freq daith-white (6) - 1 freq scoot-hole (6) - 3 freq soothit (6) - 1 freq shooie (6) - 6 freq hook-line (6) - 1 freq |
shrood-white (0) - 1 freq rosy-white (7) - 1 freq saft-white (8) - 1 freq grey-white (8) - 1 freq chaak-white (8) - 2 freq sheepwhite (8) - 1 freq ghaist-white (8) - 1 freq snaw-white (8) - 13 freq chance-whit (9) - 1 freq near-white (9) - 1 freq spreid-sheet (9) - 1 freq shreddit (9) - 2 freq superwhite (9) - 2 freq pearl-white (9) - 1 freq shore-win (9) - 1 freq shrooded (10) - 1 freq throo-oot (10) - 1 freq spoon-het (10) - 1 freq shoosht (10) - 1 freq shrood (10) - 5 freq blood-shot (10) - 1 freq aff-white (10) - 1 freq throu-pit (10) - 2 freq shroods (10) - 2 freq lily-white (10) - 2 freq |
SoundEx code - S633 sortit - 51 freq soartit - 1 freq sorted - 79 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 - XRTHT shrood-white - 1 freq |
SHROOD-WHITE |
| Time to execute Levenshtein function - 0.419234 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.644739 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.048472 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.093185 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.001014 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. |