Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
millions (0) - 66 freq million (1) - 156 freq 'millions (1) - 2 freq billions (1) - 7 freq millins (1) - 1 freq 'million' (2) - 1 freq killins (2) - 1 freq missions (2) - 3 freq milling (2) - 1 freq millin (2) - 6 freq fillins (2) - 2 freq meillion (2) - 1 freq pillion (2) - 1 freq gillians (2) - 1 freq millpond (2) - 1 freq millans (2) - 1 freq minions (2) - 5 freq dillion (2) - 3 freq mellins (2) - 1 freq billion (2) - 34 freq millies (2) - 1 freq hallions (2) - 51 freq mullion (2) - 1 freq trillions (2) - 1 freq zillion (2) - 1 freq |
millions (0) - 66 freq millins (1) - 1 freq millans (2) - 1 freq billions (2) - 7 freq million (2) - 156 freq 'millions (2) - 2 freq mellins (2) - 1 freq mullion (3) - 1 freq gillians (3) - 1 freq hallions (3) - 51 freq millies (3) - 1 freq meillion (3) - 1 freq milling (3) - 1 freq killins (3) - 1 freq fillins (3) - 2 freq millin (3) - 6 freq tellins (4) - 5 freq millionaros (4) - 2 freq gallons (4) - 14 freq meillioun (4) - 1 freq balloons (4) - 16 freq mailins (4) - 1 freq millhoose (4) - 3 freq mellin (4) - 64 freq millan (4) - 1 freq |
SoundEx code - M452 millions - 66 freq melancholy - 15 freq 'millions - 2 freq malink - 2 freq mealmaker - 5 freq malunch - 1 freq melancholic - 2 freq milngavie - 1 freq mellins - 1 freq milne's - 1 freq mallimaks - 1 freq millins - 1 freq malinconia - 1 freq malinky - 1 freq malinkies - 1 freq mailins - 1 freq mailing - 3 freq melons - 2 freq millans - 1 freq milns - 1 freq malinger - 1 freq maleness - 1 freq milling - 1 freq mwilliamsht - 9 freq |
MetaPhone code - MLNS millions - 66 freq 'millions - 2 freq mellins - 1 freq milne's - 1 freq millins - 1 freq mailins - 1 freq melons - 2 freq millans - 1 freq milns - 1 freq maleness - 1 freq |
MILLIONS |
Time to execute Levenshtein function - 0.205238 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.400903 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.029782 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.038831 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.000900 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. |