| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ghostly (0) - 16 freq ghosty (1) - 1 freq ghastly (1) - 3 freq ghostey (1) - 1 freq ghost (2) - 73 freq grossly (2) - 1 freq ghaistly (2) - 13 freq ghosts (2) - 23 freq hotly (2) - 1 freq mostly (2) - 17 freq shortly (2) - 33 freq ghostie (2) - 1 freq ghousty (2) - 1 freq ghost' (2) - 1 freq gaistly (2) - 1 freq costly (2) - 4 freq huntly (3) - 29 freq bristly (3) - 1 freq whistle (3) - 54 freq wholly (3) - 3 freq thistle (3) - 48 freq grisly (3) - 4 freq gretly (3) - 1 freq golly (3) - 4 freq jostle (3) - 2 freq |
ghostly (0) - 16 freq ghastly (1) - 3 freq ghostey (2) - 1 freq ghaistly (2) - 13 freq ghosty (2) - 1 freq ghost' (3) - 1 freq ghousty (3) - 1 freq ghost (3) - 73 freq ghosts (3) - 23 freq gaistly (3) - 1 freq ghostie (3) - 1 freq hustle (4) - 1 freq thistley (4) - 1 freq hastily (4) - 22 freq hostile (4) - 13 freq whustle (4) - 10 freq gristle (4) - 3 freq thistle (4) - 48 freq ghosties (4) - 7 freq hostel (4) - 14 freq hotly (4) - 1 freq mostly (4) - 17 freq shortly (4) - 33 freq ghaistlie (4) - 1 freq whistle (4) - 54 freq |
SoundEx code - G234 ghaistlike - 1 freq ghaistlie - 1 freq ghaist-lik - 1 freq ghostly - 16 freq ghastly - 3 freq ghaistly - 13 freq gaistly - 1 freq guestlandlord - 1 freq goeastlothian - 1 freq |
MetaPhone code - FSTL ghaistlie - 1 freq fustle - 3 freq vastly - 3 freq ghostly - 16 freq ghastly - 3 freq ghaistly - 13 freq festool - 2 freq |
GHOSTLY |
| Time to execute Levenshtein function - 0.339615 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.789033 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.079820 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.094163 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. |