| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| karloff (0) - 2 freq far-off (2) - 3 freq aloft (3) - 3 freq kargo (3) - 1 freq parlous (3) - 1 freq far-aff (3) - 6 freq aloof (3) - 2 freq karl (3) - 6 freq kartoon (3) - 1 freq barlow (3) - 1 freq wan-off (3) - 1 freq bailiff (3) - 5 freq anoff (3) - 6 freq carlo's (3) - 2 freq carlos (3) - 3 freq marlowe (3) - 1 freq carlo (3) - 16 freq parlor (3) - 1 freq marlon (3) - 1 freq warlock (3) - 43 freq karoona (3) - 1 freq cardiff (3) - 1 freq harlot (3) - 2 freq karaoke (3) - 6 freq karla (3) - 1 freq |
karloff (0) - 2 freq far-off (4) - 3 freq cardiff (5) - 1 freq karla (5) - 1 freq kroft (5) - 1 freq bailiff (5) - 5 freq karling (5) - 1 freq loff (5) - 2 freq far-aff (5) - 6 freq rlffa (5) - 1 freq karl (5) - 6 freq seacliff (6) - 1 freq gluff (6) - 19 freq liff (6) - 2 freq kailwife (6) - 2 freq graff (6) - 4 freq weelaff (6) - 1 freq spliff (6) - 8 freq tartuffe (6) - 15 freq 'ruff (6) - 1 freq scliff (6) - 7 freq kinneff (6) - 1 freq krzwyf (6) - 1 freq greff (6) - 6 freq forlife (6) - 1 freq |
SoundEx code - K641 karloff - 2 freq karlpjohnson - 2 freq |
MetaPhone code - KRLF karloff - 2 freq |
KARLOFF |
| Time to execute Levenshtein function - 0.174917 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.385442 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.029065 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.037299 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.000898 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. |