| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| irthografee (0) - 4 freq orthography (4) - 50 freq orthographie (4) - 3 freq birthrate (5) - 1 freq inthergrate (5) - 1 freq orthographic (5) - 6 freq irthquakes (5) - 1 freq retrograde (5) - 1 freq programme (5) - 101 freq orthographies (5) - 9 freq integrated (5) - 3 freq integrate (5) - 5 freq lithograph (5) - 1 freq thoreu (6) - 1 freq ktthegoalie (6) - 1 freq interfere (6) - 4 freq programme' (6) - 1 freq ithergates (6) - 13 freq cairthorses (6) - 1 freq program (6) - 25 freq progres (6) - 1 freq integratin (6) - 2 freq €œthree (6) - 6 freq authorise (6) - 1 freq thora (6) - 1 freq |
irthografee (0) - 4 freq orthographie (6) - 3 freq orthography (6) - 50 freq retrograde (7) - 1 freq tharefae (8) - 1 freq integrate (8) - 5 freq lithograph (8) - 1 freq birthrate (8) - 1 freq inthergrate (8) - 1 freq orthographies (8) - 9 freq orthographic (8) - 6 freq irthquakes (8) - 1 freq intherain (9) - 1 freq watergrace (9) - 1 freq integral (9) - 10 freq tharf (9) - 1 freq retrograwd (9) - 1 freq archetrave (9) - 1 freq rethered (9) - 1 freq 'three (9) - 10 freq lithgaes (9) - 1 freq bethrayed (9) - 2 freq regrate (9) - 1 freq rinthegates (9) - 1 freq thairof (9) - 4 freq |
SoundEx code - I632 irth's - 1 freq irthquakes - 1 freq iridescent - 1 freq i'words - 2 freq irreducible - 2 freq irthografee - 4 freq |
MetaPhone code - IR0KRF irthografee - 4 freq |
IRTHOGRAFEE |
| Time to execute Levenshtein function - 0.311627 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.446124 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.033321 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.055293 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.000872 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. |