| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| batallon (0) - 1 freq batallions (2) - 1 freq tantallon (2) - 2 freq battalion (2) - 2 freq battalions (3) - 4 freq babylon (3) - 10 freq catall (3) - 1 freq baallgoon (3) - 1 freq macaloon (3) - 1 freq patullo (3) - 2 freq stallion (3) - 11 freq fatally (3) - 2 freq atall (3) - 2 freq hallon (3) - 1 freq battlen (3) - 2 freq brallin (3) - 1 freq ballot (3) - 10 freq fitaloon (3) - 1 freq catalan (3) - 24 freq ballin (3) - 3 freq tallow (3) - 2 freq caallin (3) - 1 freq battlin (3) - 5 freq waallop (3) - 1 freq gallon (3) - 13 freq |
batallon (0) - 1 freq batallions (3) - 1 freq battalion (3) - 2 freq brallin (4) - 1 freq battlen (4) - 2 freq ballin (4) - 3 freq battalioun (4) - 1 freq balloon (4) - 37 freq stallion (4) - 11 freq battlin (4) - 5 freq b'tellin (4) - 1 freq tantallon (4) - 2 freq bellin (5) - 3 freq bottlin (5) - 2 freq tillin (5) - 3 freq fatally (5) - 2 freq macallan (5) - 3 freq bataillyie (5) - 1 freq bullion (5) - 1 freq billion (5) - 34 freq stollin (5) - 1 freq extollin (5) - 1 freq retellin (5) - 4 freq tellen (5) - 3 freq stellin (5) - 14 freq |
SoundEx code - B345 b'tellin - 1 freq battalions - 4 freq bottlin - 2 freq battlin - 5 freq bedlinen - 1 freq bethlehem - 27 freq battlen - 2 freq battalion - 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 beettlin - 1 freq bottling - 2 freq |
MetaPhone code - BTLN b'tellin - 1 freq bottlin - 2 freq battlin - 5 freq battlen - 2 freq battalion - 2 freq butlin - 2 freq batallon - 1 freq battalioun - 1 freq beettlin - 1 freq |
BATALLON |
| Time to execute Levenshtein function - 0.189505 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.394940 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.035125 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.040548 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.000949 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. |