| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lookalike (0) - 2 freq lookalikie (1) - 1 freq look-alikes (2) - 1 freq soorlike (3) - 1 freq doorlike (3) - 1 freq hook-line (3) - 1 freq luik-alike (3) - 1 freq oonlike (3) - 1 freq lookie (3) - 19 freq leakylike (3) - 1 freq alike (4) - 26 freq boolik (4) - 1 freq coolie (4) - 3 freq lookee (4) - 2 freq woolie (4) - 1 freq loanie (4) - 2 freq moralise (4) - 1 freq toalie (4) - 1 freq dowf-like (4) - 2 freq bookie (4) - 25 freq toolie (4) - 1 freq laike (4) - 33 freq rocklie (4) - 1 freq slowlike (4) - 1 freq lourdlie (4) - 1 freq |
lookalike (0) - 2 freq lookalikie (1) - 1 freq leakylike (3) - 1 freq look-alikes (4) - 1 freq luik-alike (4) - 1 freq liklie (5) - 3 freq siklike (5) - 1 freq lykelie (5) - 1 freq waeklike (5) - 1 freq likelie (5) - 11 freq lyklie (5) - 1 freq llike (5) - 1 freq doorlike (5) - 1 freq soorlike (5) - 1 freq lookie (5) - 19 freq oonlike (5) - 1 freq lokals (5) - 1 freq lookan (6) - 30 freq rookle (6) - 3 freq doucelike (6) - 2 freq meek-like (6) - 1 freq lookir (6) - 1 freq lykewake (6) - 1 freq lokk (6) - 16 freq bekalite (6) - 1 freq |
SoundEx code - L242 locals - 39 freq locals' - 1 freq lochalsh - 1 freq laich-liggin - 1 freq lookalike - 2 freq localised - 8 freq localism - 1 freq lookalikie - 1 freq look-alikes - 1 freq lugholes - 1 freq legless - 3 freq locails - 2 freq luckless - 2 freq lauch-lauchin - 1 freq less-weil-kent - 1 freq lassie-like - 1 freq lowe-clok - 1 freq localspace - 1 freq localisation - 4 freq luik-alike - 1 freq lokals - 1 freq lzals - 1 freq lclq - 1 freq lqlg - 1 freq leakylike - 1 freq ljeeulgf - 1 freq |
MetaPhone code - LKLK lookalike - 2 freq lookalikie - 1 freq luik-alike - 1 freq lclq - 1 freq lqlg - 1 freq leakylike - 1 freq |
LOOKALIKE |
| Time to execute Levenshtein function - 0.229481 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.425642 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.027731 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.037394 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.000899 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. |