Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
batallions (0) - 1 freq batallon (2) - 1 freq battalions (2) - 4 freq stallions (2) - 1 freq scallions (3) - 1 freq hallions (3) - 51 freq stallion (3) - 11 freq battalion (3) - 1 freq balloons (3) - 16 freq billions (3) - 7 freq gazillions (3) - 1 freq millions (4) - 66 freq nations (4) - 65 freq ballin (4) - 3 freq bullion (4) - 1 freq catalonians (4) - 2 freq italiens (4) - 2 freq rations (4) - 8 freq battling (4) - 1 freq bailliol (4) - 1 freq gallons (4) - 13 freq baillies (4) - 3 freq baklins (4) - 7 freq 'millions (4) - 2 freq hallion (4) - 16 freq |
batallions (0) - 1 freq battalions (3) - 4 freq stallions (3) - 1 freq batallon (3) - 1 freq billions (4) - 7 freq balloons (4) - 16 freq butlins (5) - 1 freq tellins (5) - 3 freq gazillions (5) - 1 freq battalion (5) - 1 freq stallion (5) - 11 freq scallions (5) - 1 freq hallions (5) - 51 freq b'tellin (6) - 1 freq satellites (6) - 7 freq barelins (6) - 1 freq batons (6) - 1 freq catalans (6) - 3 freq starlins (6) - 1 freq backlins (6) - 18 freq dwallins (6) - 3 freq baloons (6) - 1 freq battlin (6) - 4 freq talons (6) - 5 freq balloon (6) - 37 freq |
SoundEx code - B345 b'tellin - 1 freq battalions - 4 freq bottlin - 2 freq battlin - 4 freq bedlinen - 1 freq bethlehem - 27 freq battlen - 2 freq battlements - 4 freq bedlam - 6 freq butlin - 2 freq butlins - 1 freq batallions - 1 freq batallon - 1 freq battling - 1 freq battalioun - 1 freq bottlemen - 1 freq battalion - 1 freq beettlin - 1 freq bottling - 2 freq |
MetaPhone code - BTLNS battalions - 4 freq butlins - 1 freq batallions - 1 freq |
BATALLIONS |
Time to execute Levenshtein function - 0.215991 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.371945 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.027279 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.038423 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.000778 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. |