Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
isla (0) - 26 freq isa (1) - 24 freq osla (1) - 1 freq islan (1) - 13 freq isle (1) - 81 freq isna (1) - 390 freq inla (1) - 1 freq islay (1) - 4 freq islam (1) - 5 freq 'isla (1) - 2 freq jpla (2) - 1 freq wisna (2) - 1037 freq i'da (2) - 1 freq jslv (2) - 1 freq ikea (2) - 8 freq idea (2) - 550 freq missa (2) - 1 freq ika (2) - 3 freq disna (2) - 397 freq is- (2) - 6 freq sta (2) - 4 freq iona (2) - 64 freq isaac (2) - 20 freq wisa (2) - 1 freq cola (2) - 10 freq |
isla (0) - 26 freq islay (1) - 4 freq isle (1) - 81 freq osla (1) - 1 freq sl (2) - 7 freq aisle (2) - 26 freq slae (2) - 8 freq isley (2) - 1 freq slay (2) - 5 freq slo (2) - 4 freq asl (2) - 1 freq oslo (2) - 11 freq usli (2) - 1 freq esli (2) - 3 freq inla (2) - 1 freq 'isla (2) - 2 freq isna (2) - 390 freq islam (2) - 5 freq sly (2) - 15 freq islan (2) - 13 freq isa (2) - 24 freq slaa (2) - 3 freq sha (3) - 2 freq eisel (3) - 1 freq sea (3) - 833 freq |
SoundEx code - I240 isle - 81 freq islay - 4 freq isella - 1 freq isla - 26 freq 'isla - 2 freq issel - 1 freq iegil - 1 freq ischial - 1 freq izal - 1 freq i'caul - 3 freq i'jile - 1 freq i'isle - 1 freq igloo - 1 freq isley - 1 freq |
MetaPhone code - ISL isle - 81 freq islay - 4 freq isella - 1 freq isla - 26 freq 'isla - 2 freq issel - 1 freq izal - 1 freq i'isle - 1 freq isley - 1 freq |
ISLA |
Time to execute Levenshtein function - 0.185974 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.338491 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.027154 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.037107 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.000856 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. |