| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jacobite (0) - 24 freq jacobites (1) - 15 freq jaucobite (1) - 1 freq jacob' (3) - 1 freq jobie (3) - 1 freq lacoste (3) - 6 freq jacksie (3) - 3 freq scobie (3) - 16 freq jacobitejen (3) - 1 freq jacquie (3) - 1 freq jacob's (3) - 9 freq jabbit (3) - 3 freq 'scobie (3) - 2 freq jacobean (3) - 2 freq jackie (3) - 38 freq jacob (3) - 41 freq jacobs (3) - 1 freq favorite (3) - 2 freq jackpot (4) - 5 freq favourite (4) - 230 freq mobile (4) - 57 freq atomie (4) - 3 freq macbeth (4) - 11 freq coble (4) - 5 freq javvie (4) - 1 freq |
jacobite (0) - 24 freq jaucobite (1) - 1 freq jacobites (2) - 15 freq jacobs (4) - 1 freq jabbit (4) - 3 freq jacobean (4) - 2 freq jacob (4) - 41 freq jacob' (4) - 1 freq joecobbe (5) - 2 freq jeckit (5) - 3 freq jibbit (5) - 1 freq jackboot (5) - 1 freq jobbit (5) - 5 freq jacket (5) - 29 freq ejaculate (5) - 1 freq jaickit (5) - 16 freq jabot (5) - 1 freq jobie (5) - 1 freq lacoste (5) - 6 freq jacob's (5) - 9 freq jacquie (5) - 1 freq jacobitejen (5) - 1 freq scobie (5) - 16 freq jackie (5) - 38 freq jacksie (5) - 3 freq |
SoundEx code - J213 jackpot - 5 freq jacobite - 24 freq jacobites - 15 freq jehoshaphat - 4 freq jaucobite - 1 freq jackboot - 1 freq jackiepatie - 38 freq jacobitejen - 1 freq |
MetaPhone code - JKBT jacobite - 24 freq jaucobite - 1 freq jackboot - 1 freq |
JACOBITE |
| Time to execute Levenshtein function - 0.190192 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.388972 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.036459 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.045410 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.000840 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. |