| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| iceberg (0) - 6 freq icebergs (1) - 5 freq scenery (3) - 16 freq weber (3) - 1 freq neeber (3) - 2 freq cabers (3) - 4 freq berg (3) - 1 freq Ásberg (3) - 2 freq cetera (3) - 1 freq ice-een (3) - 1 freq cyber (3) - 4 freq caber (3) - 4 freq ueber (3) - 1 freq caber' (3) - 2 freq icker (3) - 2 freq bieber (3) - 1 freq cebr (3) - 1 freq eber (3) - 3 freq celery (3) - 5 freq iblrg (3) - 1 freq ickers (3) - 1 freq weerg (3) - 1 freq mclver (4) - 2 freq 'never' (4) - 1 freq 'energy (4) - 1 freq |
iceberg (0) - 6 freq icebergs (2) - 5 freq caber (4) - 4 freq caber' (4) - 2 freq cebr (4) - 1 freq berg (4) - 1 freq cyber (4) - 4 freq cabers (4) - 4 freq i'brig (5) - 1 freq creg (5) - 1 freq cyberdug (5) - 4 freq cobra (5) - 5 freq cyberee (5) - 1 freq creag (5) - 1 freq coburn (5) - 3 freq cbg (5) - 1 freq clergy (5) - 2 freq weerg (5) - 1 freq carg (5) - 1 freq caberay (5) - 1 freq borg (5) - 1 freq cherge (5) - 4 freq ueber (5) - 1 freq celery (5) - 5 freq icker (5) - 2 freq |
SoundEx code - I216 is-'birds - 1 freq icebergs - 5 freq is-'burds - 2 freq iceberg - 6 freq ikspress-træn - 1 freq i'chipper - 1 freq i'spurgie - 1 freq ixpress - 1 freq ickbrae - 11 freq ickbraehaugh - 1 freq icebreakers - 1 freq ixfrbmmdkq - 1 freq |
MetaPhone code - ISBRK iceberg - 6 freq |
ICEBERG |
| Time to execute Levenshtein function - 0.217345 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.331581 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.027796 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.037180 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.000917 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. |