| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gleyt-like (0) - 1 freq gleg-like (2) - 1 freq tent-like (3) - 1 freq smert-like (3) - 3 freq gyte-like (3) - 1 freq awfy-like (4) - 1 freq cat-like (4) - 1 freq leaf-lik (4) - 1 freq cult-like (4) - 1 freq cosy-like (4) - 2 freq ivy-like (4) - 1 freq maist-like (4) - 1 freq saut-like (4) - 1 freq gay-lik (4) - 1 freq roit-like (4) - 1 freq deathlike (4) - 1 freq blatelike (4) - 1 freq solemn-like (4) - 1 freq pey-line (4) - 1 freq body-like (4) - 1 freq taen-like (4) - 3 freq smertlike (4) - 1 freq ideal-like (4) - 1 freq meek-like (4) - 1 freq saft-like (4) - 1 freq |
gleyt-like (0) - 1 freq gleg-like (3) - 1 freq gyte-like (4) - 1 freq glaikit-like (5) - 1 freq cult-like (5) - 1 freq gentie-like (5) - 10 freq blate-like (5) - 16 freq tent-like (5) - 1 freq quict-like (6) - 1 freq ideal-like (6) - 1 freq saft-like (6) - 1 freq gentielike (6) - 1 freq rat-like (6) - 1 freq angert-like (6) - 1 freq quiet-like (6) - 5 freq blate-lik (6) - 1 freq blythelike (6) - 1 freq slaw-like (6) - 1 freq feart-like (6) - 1 freq quait-like (6) - 3 freq whit-like (6) - 1 freq gritty-like (6) - 1 freq maist-like (6) - 1 freq leaf-lik (6) - 1 freq cat-like (6) - 1 freq |
SoundEx code - G434 glottal - 11 freq gledlie - 5 freq gladly - 7 freq glaidly - 2 freq gledly - 5 freq guiltless - 1 freq goldie-leukin - 2 freq glottals - 1 freq gleyt-like - 1 freq €˜goldilocks - 1 freq goldilocks - 1 freq 'glottal - 1 freq |
MetaPhone code - KLTLK cult-like - 1 freq gleyt-like - 1 freq |
GLEYT-LIKE |
| Time to execute Levenshtein function - 0.862298 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.614346 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.100414 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.186627 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.000972 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. |