| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| blatelike (0) - 1 freq blate-like (1) - 16 freq quatelike (2) - 3 freq blythelike (2) - 1 freq blate-lik (2) - 1 freq blithlie (3) - 1 freq belike (3) - 5 freq quatelik (3) - 1 freq blate-wye (3) - 2 freq saelike (3) - 3 freq cavelike (3) - 1 freq lanelie (3) - 1 freq blythelie (3) - 2 freq samelike (3) - 2 freq blately (3) - 2 freq baseline (3) - 2 freq bakelite (3) - 3 freq rat-like (3) - 1 freq deathlike (3) - 1 freq cat-like (3) - 1 freq quate-like (3) - 9 freq slaw-like (3) - 1 freq quaetlike (4) - 1 freq blackie (4) - 21 freq brattlin (4) - 8 freq |
blatelike (0) - 1 freq blate-like (2) - 16 freq blate-lik (3) - 1 freq blythelike (3) - 1 freq quatelike (4) - 3 freq blately (4) - 2 freq blythelie (5) - 2 freq blate-wye (5) - 2 freq blithlie (5) - 1 freq quatelik (5) - 1 freq belike (5) - 5 freq blaik (6) - 80 freq leakylike (6) - 1 freq beltel (6) - 4 freq gentielike (6) - 1 freq blythie (6) - 1 freq slowlike (6) - 1 freq gleyt-like (6) - 1 freq slawlik (6) - 2 freq lately (6) - 57 freq bltime (6) - 1 freq boatels (6) - 1 freq body-like (6) - 1 freq baillie (6) - 17 freq bairnlike (6) - 4 freq |
SoundEx code - B434 boldly - 8 freq blithely - 9 freq blately - 2 freq bluid'll - 1 freq bluidlust - 4 freq blythely - 5 freq bolt-hole - 1 freq bladeless - 1 freq bulletholes - 1 freq bowldly - 1 freq blate-like - 16 freq bauldly - 4 freq bieldless - 1 freq blaet-laek - 1 freq blythelie - 2 freq belittlin - 1 freq blatelike - 1 freq blythelike - 1 freq bluidless - 1 freq blythly - 1 freq blate-lik - 1 freq bauld-lik - 1 freq blithlie - 1 freq belittled - 1 freq beldhill - 2 freq bluid-line - 1 freq bluidlessness - 1 freq bluddylongjourney - 1 freq beltel - 4 freq belittle - 1 freq |
MetaPhone code - BLTLK blate-like - 16 freq blaet-laek - 1 freq blatelike - 1 freq blate-lik - 1 freq bauld-lik - 1 freq |
BLATELIKE |
| Time to execute Levenshtein function - 0.234134 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.432353 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.032653 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.044669 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.001107 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. |