| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| laser-guidit (0) - 1 freq sel-guidin (4) - 4 freq lang-wundit (5) - 1 freq hale-heidit (5) - 5 freq ae-leidit (5) - 1 freq fair-heidit (5) - 2 freq lang-heidit (5) - 15 freq dae-guid (5) - 2 freq yae-fuitit (5) - 1 freq sel-guidins (5) - 1 freq het-heidit (6) - 1 freq capernoitit (6) - 1 freq bauld-heidit (6) - 1 freq half-hoidit (6) - 1 freq apen-mindit (6) - 1 freq lufe-gift (6) - 1 freq grey-heidit (6) - 1 freq spreidit (6) - 3 freq tax-fundit (6) - 1 freq laidit (6) - 9 freq black-suitit (6) - 1 freq snake-heidit (6) - 1 freq baa-heidit (6) - 1 freq unnerfundit (6) - 1 freq wee-buikit (6) - 1 freq |
laser-guidit (0) - 1 freq sel-guidin (7) - 4 freq lang-heidit (8) - 15 freq fair-heidit (8) - 2 freq grey-heidit (9) - 1 freq lesser-uised (9) - 5 freq lardit (9) - 1 freq surroundit (9) - 6 freq sea-gust (9) - 1 freq airy-heidit (9) - 1 freq three-leidit (9) - 2 freq lufe-gift (9) - 1 freq ae-leidit (9) - 1 freq dae-guid (9) - 2 freq sel-guidins (9) - 1 freq hale-heidit (9) - 5 freq lang-wundit (9) - 1 freq bee-heidit (10) - 1 freq 'lang-heidit (10) - 1 freq life-giein (10) - 1 freq water-loggit (10) - 1 freq bare-fuit (10) - 1 freq hail-heidit (10) - 2 freq else'-bit (10) - 1 freq law-abidin (10) - 1 freq |
SoundEx code - L262 lacers - 1 freq lagers - 2 freq lasers - 2 freq liqueurs - 1 freq lecherous - 3 freq lazarus - 20 freq liquorice - 9 freq luxourious - 1 freq losers - 3 freq lager's - 1 freq loggers - 1 freq laikers' - 1 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 liquorish - 1 freq lkkryzgv - 1 freq legiawarszawa - 1 freq lickers - 2 freq lkrwzb - 1 freq |
MetaPhone code - LSRKTT laser-guidit - 1 freq |
LASER-GUIDIT |
| Time to execute Levenshtein function - 0.243194 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.399198 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.030332 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.048169 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.001073 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. |