Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
aiblins (0) - 278 freq ailins (1) - 1 freq yiblins (1) - 1 freq siblins (1) - 10 freq 'aiblins (1) - 8 freq aiblains (1) - 3 freq eilins (2) - 4 freq railins (2) - 22 freq killins (2) - 1 freq airlines (2) - 1 freq raiblin (2) - 1 freq dailins (2) - 4 freq airline (2) - 1 freq ailin (2) - 2 freq sibling (2) - 1 freq yirlins (2) - 1 freq aistlins (2) - 1 freq millins (2) - 1 freq aalins (2) - 2 freq aisling (2) - 1 freq pailins (2) - 4 freq fillins (2) - 2 freq hidlins (2) - 10 freq failins (2) - 1 freq aisins (2) - 1 freq |
aiblins (0) - 278 freq aiblains (1) - 3 freq yiblins (1) - 1 freq ailins (2) - 1 freq 'aiblins (2) - 8 freq siblins (2) - 10 freq birlins (3) - 1 freq yirlins (3) - 1 freq aalins (3) - 2 freq abins (3) - 1 freq failins (3) - 1 freq blens (3) - 1 freq pailins (3) - 4 freq mailins (3) - 1 freq goblins (3) - 1 freq eilins (3) - 4 freq railins (3) - 22 freq airlines (3) - 1 freq dailins (3) - 4 freq lins (4) - 3 freq pailens (4) - 1 freq dealins (4) - 5 freq barelins (4) - 1 freq bieldins (4) - 2 freq beins (4) - 14 freq |
SoundEx code - A145 aiblins - 278 freq 'aiblins - 8 freq a-plenty - 4 freq aplentie - 2 freq appeelin - 1 freq a-flowin - 1 freq affluence - 1 freq applyin - 5 freq appealin - 6 freq avalanche - 7 freq abilene - 2 freq aflame - 4 freq aplenty - 6 freq abuliments - 1 freq appliances - 2 freq applying - 8 freq aiblains - 3 freq aff-limits - 2 freq affline - 2 freq aff-blawin - 1 freq appliein - 2 freq affluent - 5 freq appealing - 1 freq €œaiblins - 1 freq aplomb - 1 freq applemanyebastard - 1 freq aipplemannie - 1 freq applemak - 2 freq affaloon - 2 freq appalling - 2 freq avalonbunny - 2 freq appallin - 2 freq |
MetaPhone code - ABLNS aiblins - 278 freq 'aiblins - 8 freq aiblains - 3 freq €œaiblins - 1 freq |
AIBLINS |
Time to execute Levenshtein function - 0.372621 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.996335 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.089360 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.116362 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.000975 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. |