| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| litigants (0) - 1 freq litigant (1) - 1 freq littlans (3) - 2 freq litigator (3) - 1 freq lithgaes (3) - 1 freq mitigate (3) - 1 freq litigious (3) - 1 freq ootgans (4) - 1 freq ingangs (4) - 5 freq lithuania (4) - 1 freq littlins (4) - 25 freq gants (4) - 1 freq deviants (4) - 1 freq variants (4) - 14 freq sitiwat (4) - 1 freq immigrants (4) - 15 freq stigand (4) - 5 freq ceitizans (4) - 1 freq ruminants (4) - 1 freq fitprints (4) - 8 freq citizens (4) - 28 freq listins (4) - 1 freq limits (4) - 15 freq militant (4) - 2 freq tenants (4) - 12 freq |
litigants (0) - 1 freq litigant (2) - 1 freq litigious (5) - 1 freq litigator (5) - 1 freq sairgants (6) - 1 freq agitants (6) - 1 freq lights (6) - 104 freq patients (6) - 29 freq logans (6) - 1 freq litigation (6) - 1 freq tints (6) - 3 freq entrants (6) - 3 freq tights (6) - 15 freq stints (6) - 1 freq lotion's (6) - 1 freq leigends (6) - 1 freq giants (6) - 19 freq tyrants (6) - 3 freq tinints (6) - 2 freq tenants (6) - 12 freq ootgans (6) - 1 freq laggans (6) - 1 freq lotions (6) - 1 freq gants (6) - 1 freq mitigate (6) - 1 freq |
SoundEx code - L325 lodging - 1 freq ludgins - 8 freq laithsome - 8 freq ludginhouses - 1 freq ludgin-hoose - 3 freq ludgin-hooses - 2 freq ludgin-house - 1 freq lithsome-put - 1 freq littcen - 1 freq litigant - 1 freq ludgin - 7 freq litigants - 1 freq lodgin - 5 freq lodgin-hooses - 1 freq lodgins - 1 freq lüdgin - 1 freq lüdgins - 1 freq lithesome - 1 freq loathsome - 2 freq ladies-in-waiting - 1 freq lodesman - 2 freq laddie-general - 4 freq laddie-general's - 1 freq lützen - 1 freq latchin - 2 freq letsmelt - 1 freq ladyjinty - 2 freq letsmake - 1 freq ltsnotsoccer - 1 freq leithjenny - 3 freq litesome - 1 freq |
MetaPhone code - LTKNTS litigants - 1 freq |
LITIGANTS |
| Time to execute Levenshtein function - 0.315757 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.593581 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.066454 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.037635 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.000919 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. |