Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
olivebank (0) - 12 freq riverbank (3) - 4 freq elibank (3) - 2 freq clydebank (3) - 12 freq oliver's (4) - 1 freq widbank (4) - 1 freq bolivians (4) - 1 freq deliveran (4) - 2 freq cleveland (4) - 1 freq oliver (4) - 10 freq holiebags (4) - 1 freq slicean (4) - 1 freq collieback (4) - 1 freq climban (4) - 2 freq oliviaj (4) - 1 freq alice-band (4) - 1 freq five-ack (4) - 1 freq lifelang (4) - 2 freq policeman (4) - 3 freq shiveran (4) - 1 freq oliphant (4) - 4 freq livan (4) - 6 freq bliban (4) - 1 freq river-bank (4) - 1 freq liveen (4) - 5 freq |
olivebank (0) - 12 freq elibank (4) - 2 freq clydebank (5) - 12 freq ladybank (5) - 1 freq riverbank (5) - 4 freq liveen (6) - 5 freq livan (6) - 6 freq bloobank (6) - 2 freq ley-baunk (6) - 1 freq widbank (6) - 1 freq laevan (7) - 15 freq lebanon (7) - 7 freq albans (7) - 1 freq livveen (7) - 1 freq lamban (7) - 2 freq laidback (7) - 1 freq link (7) - 70 freq livveens (7) - 1 freq livener (7) - 1 freq foodbank (7) - 5 freq laverock (7) - 14 freq eleevan (7) - 1 freq elyven (7) - 2 freq elieven (7) - 3 freq laverick (7) - 1 freq |
SoundEx code - O411 olivebank - 12 freq |
MetaPhone code - OLFBNK olivebank - 12 freq |
OLIVEBANK |
Time to execute Levenshtein function - 0.214836 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.370973 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.027374 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.036940 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.000839 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. |