| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| poleitieal (0) - 1 freq poleitical (1) - 10 freq political (2) - 206 freq politiecal (2) - 5 freq poleetical (2) - 38 freq poleiticall (2) - 1 freq polemical (3) - 1 freq polÃtical (3) - 1 freq poetical (3) - 3 freq 'political (3) - 1 freq politcal (3) - 1 freq potential (3) - 90 freq apolitical (3) - 2 freq poleitically (3) - 2 freq politie (3) - 2 freq polietical (3) - 2 freq politicos (4) - 1 freq politic (4) - 5 freq politeecs (4) - 2 freq politely (4) - 27 freq politicks (4) - 3 freq plentie (4) - 5 freq oreiginal (4) - 27 freq politicans (4) - 6 freq poleetics (4) - 1 freq |
poleitieal (0) - 1 freq poleitical (2) - 10 freq politiecal (3) - 5 freq poleetical (3) - 38 freq political (3) - 206 freq politcal (4) - 1 freq apolitical (4) - 2 freq polietical (4) - 2 freq palatial (4) - 1 freq politely (4) - 27 freq poleiticall (4) - 1 freq politie (4) - 2 freq pleiter (5) - 1 freq leitil (5) - 1 freq plettie (5) - 1 freq palatal (5) - 3 freq politico (5) - 2 freq polatie (5) - 1 freq politik (5) - 1 freq polaties (5) - 1 freq polite (5) - 53 freq poleitically (5) - 2 freq potential (5) - 90 freq poetical (5) - 3 freq 'political (5) - 1 freq |
SoundEx code - P434 politely - 27 freq palatial - 1 freq palatals - 1 freq palatal - 3 freq pletleggit - 1 freq €˜philatelist - 1 freq poleitieal - 1 freq |
MetaPhone code - PLTL politely - 27 freq palatal - 3 freq poleitieal - 1 freq |
POLEITIEAL |
| Time to execute Levenshtein function - 0.210629 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.377239 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.027494 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.040045 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.000870 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. |