| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| larkies (0) - 1 freq larries (1) - 8 freq markies (1) - 1 freq darkies (1) - 2 freq lavvies (2) - 10 freq lakes (2) - 2 freq laalies (2) - 3 freq marlies (2) - 1 freq larks (2) - 4 freq lairdies (2) - 16 freq sharkies (2) - 1 freq walkies (2) - 8 freq laddies (2) - 196 freq hardies (2) - 1 freq baukies (2) - 2 freq carnies (2) - 2 freq barkie (2) - 1 freq lakis (2) - 1 freq lariks (2) - 1 freq sparkies (2) - 2 freq cakies (2) - 1 freq yakies (2) - 1 freq gardies (2) - 1 freq markis (2) - 1 freq lark's (2) - 1 freq |
larkies (0) - 1 freq lariks (2) - 1 freq darkies (2) - 2 freq larks (2) - 4 freq markies (2) - 1 freq larries (2) - 8 freq alkies (3) - 4 freq derkies (3) - 1 freq parkes (3) - 2 freq markis (3) - 1 freq wirkies (3) - 1 freq lark's (3) - 1 freq luckies (3) - 1 freq larkin (3) - 3 freq lakis (3) - 1 freq lirks (3) - 3 freq workies (3) - 1 freq laikes (3) - 1 freq yorkies (3) - 1 freq lakes (3) - 2 freq lorries (3) - 5 freq birkies (3) - 1 freq porkies (3) - 2 freq forkies (3) - 1 freq lurks (3) - 6 freq |
SoundEx code - L622 larkies - 1 freq largest - 4 freq large-scale - 1 freq lairgest - 9 freq larachs - 3 freq lurches - 1 freq lyricism - 1 freq lairge-scale - 1 freq lwrzcuj - 1 freq larkyaccie - 1 freq lurgys - 1 freq |
MetaPhone code - LRKS larkies - 1 freq lurks - 6 freq lyrics - 24 freq lairgs - 2 freq lark's - 1 freq larks - 4 freq lirks - 3 freq largs - 4 freq lariks - 1 freq laricks - 1 freq |
LARKIES |
| Time to execute Levenshtein function - 0.201599 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.398968 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.030736 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.044631 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.001006 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. |