Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
gyrthol (0) - 1 freq barthol (2) - 1 freq borthel (3) - 1 freq girthie (3) - 1 freq gurthie (3) - 2 freq byrth (3) - 1 freq girth (3) - 5 freq menthol (3) - 3 freq gyatso (3) - 1 freq mythos (3) - 1 freq girths (3) - 2 freq porthole (3) - 1 freq python (3) - 1 freq hertholl (3) - 2 freq athol (3) - 1 freq garth (3) - 3 freq cantrol (4) - 1 freq hert-holl (4) - 5 freq tholt (4) - 1 freq altho' (4) - 2 freq gyos (4) - 1 freq byreboy (4) - 1 freq ytzo (4) - 1 freq pothole (4) - 5 freq €˜thon (4) - 2 freq |
gyrthol (0) - 1 freq barthol (3) - 1 freq girths (4) - 2 freq girth (4) - 5 freq porthole (4) - 1 freq garth (4) - 3 freq girthie (4) - 1 freq borthel (4) - 1 freq gurthie (4) - 2 freq garthdee (5) - 7 freq byrth (5) - 1 freq greth (5) - 1 freq earthly (5) - 10 freq brothel (5) - 2 freq gareth (5) - 3 freq gretel (5) - 2 freq airthly (5) - 1 freq brithal (5) - 2 freq athol (5) - 1 freq hertholl (5) - 2 freq menthol (5) - 3 freq grill (6) - 5 freq thul (6) - 1 freq mirth (6) - 12 freq gyratin (6) - 1 freq |
SoundEx code - G634 grytely - 2 freq gradually - 17 freq gradwal - 2 freq gradwally - 1 freq griddle - 11 freq girdle - 15 freq girdles - 1 freq gradual - 6 freq gretel - 2 freq gruttalo's - 3 freq greatly - 10 freq gretly - 1 freq griddles - 1 freq grytlie - 1 freq 'greatly - 1 freq graddol - 2 freq gritty-like - 1 freq gradwal-lik - 2 freq gyrthol - 1 freq gradual-like - 1 freq gardyloo - 1 freq greedily - 1 freq growthe-alive - 1 freq gritlie - 1 freq graetly - 1 freq gritly - 1 freq gardela - 1 freq |
MetaPhone code - JR0L gyrthol - 1 freq |
GYRTHOL |
Time to execute Levenshtein function - 0.681871 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 - 1.404202 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.097239 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.110312 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.001755 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. |