| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| guests (0) - 46 freq guess (1) - 144 freq guests' (1) - 1 freq gusts (1) - 5 freq gests (1) - 2 freq guest's (1) - 3 freq guest (1) - 42 freq guelt (2) - 1 freq quest (2) - 18 freq kests (2) - 2 freq tests (2) - 27 freq goest (2) - 1 freq gress (2) - 199 freq greets (2) - 25 freq biests (2) - 1 freq nests (2) - 27 freq baests (2) - 13 freq guises (2) - 1 freq queets (2) - 6 freq heests (2) - 2 freq lests (2) - 3 freq gets (2) - 424 freq giess (2) - 4 freq gusto (2) - 6 freq pests (2) - 2 freq |
guests (0) - 46 freq gests (1) - 2 freq gusts (1) - 5 freq gasts (2) - 1 freq guess (2) - 144 freq guest (2) - 42 freq gaists (2) - 1 freq guest's (2) - 3 freq guests' (2) - 1 freq jests (3) - 2 freq guiss (3) - 1 freq gest (3) - 1 freq ruists (3) - 1 freq buists (3) - 1 freq rusts (3) - 1 freq rests (3) - 11 freq guts (3) - 73 freq dusts (3) - 2 freq gussets (3) - 1 freq geets (3) - 23 freq busts (3) - 2 freq jeests (3) - 7 freq geats (3) - 1 freq vests (3) - 4 freq bests (3) - 2 freq |
SoundEx code - G232 ghaists - 46 freq guests - 46 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 - KSTS casts - 17 freq guests - 46 freq kist's - 1 freq kists - 31 freq costs - 45 freq gusts - 5 freq guest's - 3 freq coasts - 3 freq 'costs - 1 freq gaists - 1 freq kisties - 8 freq kïsts - 1 freq guests' - 1 freq costies - 8 freq gowstie's - 1 freq kests - 2 freq gasts - 1 freq gussets - 1 freq |
GUESTS |
| Time to execute Levenshtein function - 0.204666 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.428220 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.029697 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.039725 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.000825 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. |