| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ghiasts (0) - 1 freq chists (2) - 1 freq whists (2) - 1 freq giants (2) - 19 freq gaists (2) - 1 freq hoasts (2) - 8 freq ghosts (2) - 23 freq gasts (2) - 1 freq ghaists (2) - 48 freq glints (3) - 6 freq firsts (3) - 1 freq shoats (3) - 2 freq phrases (3) - 68 freq glastos (3) - 1 freq gits (3) - 102 freq hirsty (3) - 2 freq gusts (3) - 5 freq thoats (3) - 13 freq 'haste (3) - 1 freq hisses (3) - 4 freq boasts (3) - 3 freq heysts (3) - 1 freq thats (3) - 200 freq thrists (3) - 2 freq biases (3) - 1 freq |
ghiasts (0) - 1 freq ghaists (2) - 48 freq ghosts (2) - 23 freq chists (3) - 1 freq ghoasties (3) - 1 freq whists (3) - 1 freq gasts (3) - 1 freq gaists (3) - 1 freq hoasts (3) - 8 freq hysts (4) - 1 freq ghousty (4) - 1 freq hosts (4) - 13 freq ghosty (4) - 1 freq ghastly (4) - 3 freq heysts (4) - 1 freq gests (4) - 2 freq wheests (4) - 1 freq ghosties (4) - 7 freq aghast (4) - 3 freq ghaist (4) - 60 freq guests (4) - 47 freq ghaisties (4) - 6 freq heests (4) - 2 freq chests (4) - 7 freq glastos (4) - 1 freq |
SoundEx code - G232 ghaists - 48 freq guests - 47 freq ghaist-sea - 1 freq ghosts - 23 freq guests-yince - 1 freq gusts - 5 freq guest's - 3 freq geust's - 1 freq ghosties - 7 freq ghaist-ship - 1 freq gaists - 1 freq ghaist-whisperin - 1 freq guests' - 1 freq gowstie's - 1 freq geocities - 12 freq ghaist-storie - 1 freq ghaisties - 6 freq gasts - 1 freq gests - 2 freq gesticulatin - 2 freq ghoasties - 1 freq gussets - 1 freq gawkds - 1 freq ghiasts - 1 freq |
MetaPhone code - FSTS ghaists - 48 freq ghaist-sea - 1 freq ghosts - 23 freq fists - 21 freq vests - 4 freq visits - 24 freq foosts - 2 freq veesits - 15 freq feasts - 5 freq ficets - 1 freq ghosties - 7 freq vistas - 3 freq vesta's - 1 freq veisits - 8 freq facets - 2 freq visit's - 1 freq ghaisties - 6 freq ghoasties - 1 freq ghiasts - 1 freq wfsds - 1 freq |
GHIASTS |
| Time to execute Levenshtein function - 0.274859 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.431359 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.032175 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.045195 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.000868 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. |