| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lairdies (0) - 16 freq gairdies (1) - 1 freq bairdies (1) - 1 freq lairdie (1) - 3 freq lairdie's (1) - 1 freq lairdies' (1) - 3 freq cairries (2) - 36 freq mairries (2) - 8 freq ladies (2) - 54 freq cairnies (2) - 1 freq cardies (2) - 1 freq dairies (2) - 3 freq lairds (2) - 28 freq airdie (2) - 2 freq cairdie (2) - 1 freq wirdies (2) - 13 freq plaidies (2) - 2 freq gairdins (2) - 2 freq airmies (2) - 16 freq lairnins (2) - 1 freq lairie (2) - 2 freq larkies (2) - 1 freq gardies (2) - 1 freq hairies (2) - 4 freq bairnies (2) - 46 freq |
lairdies (0) - 16 freq lairdies' (2) - 3 freq lairdie's (2) - 1 freq lairds (2) - 28 freq gairdies (2) - 1 freq lairdie (2) - 3 freq bairdies (2) - 1 freq lourdes (3) - 2 freq hardies (3) - 1 freq laddies (3) - 198 freq larkies (3) - 1 freq laudies (3) - 1 freq lauddies (3) - 3 freq gardies (3) - 1 freq larries (3) - 8 freq lordis (3) - 3 freq birdies (3) - 27 freq ladies (3) - 54 freq lairdlie (3) - 1 freq wirdies (3) - 13 freq cardies (3) - 1 freq laird's (3) - 10 freq bardies (3) - 1 freq laired (4) - 8 freq airds (4) - 15 freq |
SoundEx code - L632 lords - 27 freq lyart-gettin - 1 freq laird's - 10 freq lord's - 26 freq lairdship - 4 freq lairds - 28 freq lordis - 3 freq loard's - 21 freq lairdies - 16 freq lairdie's - 1 freq lairdies' - 3 freq laureates - 1 freq lourdes - 2 freq loard''s - 1 freq loards - 1 freq lourdsome - 1 freq lordshipe - 3 freq lordship - 1 freq 'lordsake - 2 freq lerritgo - 1 freq lordashcroftpolls - 1 freq loriwatsonmusic - 1 freq lairdsummerisle - 1 freq |
MetaPhone code - LRTS lords - 27 freq laird's - 10 freq lord's - 26 freq lairds - 28 freq lordis - 3 freq loard's - 21 freq lairdies - 16 freq lairdie's - 1 freq lairdies' - 3 freq laureates - 1 freq lourdes - 2 freq loard''s - 1 freq loards - 1 freq |
LAIRDIES |
| Time to execute Levenshtein function - 0.226218 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.394920 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.029536 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.038503 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.000947 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. |