| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ladybank (0) - 1 freq layan (3) - 1 freq payback (3) - 1 freq playback (3) - 1 freq eastbank (3) - 1 freq ladygaga (3) - 1 freq lamban (3) - 2 freq laidback (3) - 1 freq raybans (3) - 1 freq clydebank (3) - 12 freq ladybird (3) - 2 freq garytank (3) - 2 freq widbank (3) - 1 freq faw-back (4) - 2 freq laufan (4) - 1 freq databanks (4) - 1 freq lairnan (4) - 3 freq lashan (4) - 1 freq redshank (4) - 3 freq lachlan (4) - 1 freq maybae (4) - 14 freq meadowbank (4) - 3 freq laughan (4) - 4 freq ladent (4) - 1 freq ladrons (4) - 1 freq |
ladybank (0) - 1 freq clydebank (4) - 12 freq widbank (4) - 1 freq laidback (4) - 1 freq olivebank (5) - 12 freq ladybird (5) - 2 freq ley-baunk (5) - 1 freq elibank (5) - 2 freq foodbank (5) - 5 freq eastbank (5) - 1 freq lamban (5) - 2 freq libyan (6) - 1 freq andback (6) - 1 freq ladny (6) - 1 freq ladyjinty (6) - 2 freq lydians (6) - 1 freq ladin (6) - 1 freq ewbank (6) - 1 freq drank (6) - 59 freq mudbanks (6) - 2 freq alban (6) - 3 freq albans (6) - 1 freq laden (6) - 13 freq dank (6) - 11 freq baank (6) - 1 freq |
SoundEx code - L315 ladybank - 1 freq ludifiein - 1 freq latefund - 1 freq leidbangers - 2 freq |
MetaPhone code - LTBNK ladybank - 1 freq |
LADYBANK |
| Time to execute Levenshtein function - 0.315965 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.575338 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.027330 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.078957 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.000927 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. |