| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| laidback (0) - 1 freq andback (2) - 1 freq hardback (2) - 2 freq cashback (3) - 1 freq haudbacks (3) - 1 freq faw-back (3) - 2 freq widbank (3) - 1 freq a-back (3) - 1 freq landmark (3) - 4 freq ladybank (3) - 1 freq laebrack (3) - 1 freq laidlaw (3) - 3 freq i'back (3) - 2 freq feedback (3) - 20 freq 'laid-back' (3) - 1 freq tailbacks (3) - 1 freq playback (3) - 1 freq castback (3) - 1 freq aback (3) - 41 freq payback (3) - 1 freq intack (4) - 1 freq lambast (4) - 1 freq snapback (4) - 1 freq landward (4) - 6 freq cardiac (4) - 2 freq |
laidback (0) - 1 freq andback (3) - 1 freq feedback (4) - 20 freq hardback (4) - 2 freq ladybank (4) - 1 freq playback (5) - 1 freq feedbeck (5) - 1 freq lubeck (5) - 2 freq i'back (5) - 2 freq payback (5) - 1 freq aback (5) - 41 freq widbank (5) - 1 freq a-back (5) - 1 freq haudbacks (5) - 1 freq laebrack (5) - 1 freq loack (6) - 8 freq lanrick (6) - 1 freq lick (6) - 47 freq laverick (6) - 1 freq elbuck (6) - 13 freq laverock (6) - 14 freq paulbiack (6) - 1 freq biteback (6) - 1 freq back (6) - 6115 freq €œback (6) - 2 freq |
SoundEx code - L312 'laid-back' - 1 freq ludovic - 1 freq laidback - 1 freq loudbasket - 1 freq leithyface - 1 freq ldtfkszcdt - 1 freq |
MetaPhone code - LTBK 'laid-back' - 1 freq laidback - 1 freq |
LAIDBACK |
| Time to execute Levenshtein function - 0.511477 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.884425 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.083164 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.044868 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.000844 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. |