| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lockers (0) - 4 freq lickers (1) - 2 freq locker (1) - 3 freq lockars (1) - 2 freq clockers (1) - 6 freq dockers (1) - 12 freq locke's (1) - 1 freq packers (2) - 1 freq feckers (2) - 7 freq nickers (2) - 1 freq powkers (2) - 1 freq losers (2) - 3 freq boskers (2) - 2 freq hackers (2) - 1 freq licker (2) - 1 freq rockets (2) - 9 freq heckers (2) - 1 freq locke (2) - 1 freq doukers (2) - 1 freq blocker (2) - 2 freq lovers (2) - 20 freq flocers (2) - 1 freq ackers (2) - 16 freq fuckers (2) - 9 freq sookers (2) - 2 freq |
lockers (0) - 4 freq lockars (1) - 2 freq lickers (1) - 2 freq locke's (2) - 1 freq dockers (2) - 12 freq clockers (2) - 6 freq locker (2) - 3 freq wickers (3) - 1 freq lockis (3) - 1 freq lacers (3) - 1 freq yolkers (3) - 1 freq lackeys (3) - 3 freq backers (3) - 2 freq pickers (3) - 1 freq muckers (3) - 4 freq ickers (3) - 1 freq kickers (3) - 1 freq flickers (3) - 4 freq locks (3) - 37 freq fuckers (3) - 9 freq mackers (3) - 1 freq deckers (3) - 2 freq lockups (3) - 1 freq lecters (3) - 1 freq heckers (3) - 1 freq |
SoundEx code - L262 lacers - 1 freq lagers - 2 freq lasers - 2 freq liqueurs - 1 freq lazarus - 20 freq liquorice - 9 freq luxourious - 1 freq losers - 3 freq lager's - 1 freq loggers - 1 freq laikers' - 1 freq lecherous - 2 freq lockers - 4 freq laser-guidit - 1 freq lockars - 2 freq loughriescouse - 2 freq leckerstanes - 1 freq leuchars - 1 freq luxuries - 3 freq luxors - 1 freq lugars - 1 freq laigersay - 2 freq lesser-used - 1 freq lesser-uised - 5 freq lousers - 1 freq lesser-yaised - 2 freq lkkryzgv - 1 freq legiawarszawa - 1 freq lickers - 2 freq lkrwzb - 1 freq |
MetaPhone code - LKRS liqueurs - 1 freq liquorice - 9 freq loggers - 1 freq laikers' - 1 freq lockers - 4 freq lockars - 2 freq lugars - 1 freq lickers - 2 freq |
LOCKERS |
| Time to execute Levenshtein function - 0.372937 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.373691 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.028090 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.037210 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.000777 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. |