How to search for misspelled anagrams?

Question

JavaScript

Let's say there are anagram words:
AABB = ABAB, ABBA, BBAA
Now some of them are misspelled:
AABB ~= ABAB, ABBB, BDAC Misprint
percentages (relative to AABB): 0%, 25%, 50%.
According to the error threshold exceeding 25%, we filter out only the last word: BDAC.
That is, it will be so.
Acceptable error threshold is 25% (1 error per 4 characters):
AABB ~= ABAB, ABBB
(this is the final result)
Question:
How to detect anagrams as quickly as possible if the words contain one or more typos with the desired error threshold?
The length of words - can be any, the percentage of typos - can be set arbitrarily.
UPD: Examples of typos (comparison of anagrams and number of typos):
AABB and AAB => 1 (missing character)
AABB and AABBA => 1 (extra "own" character)
AABB and AABBC => 2 (extra "foreign" character)

Answer 1

https://jsfiddle.net/twobomb/eLnpcu9x/