Domain Distance Calculator

TOOL: LEVENSHTEIN DISTANCE

Calculates the edit distance between a target brand and a suspect domain.

Use case: Filtering newly registered domain (NRD) feeds.

The Levenshtein distance is a string metric for measuring the difference between two sequences. Informally, it is the minimum number of single-character edits (insertions, deletions, or substitutions) required to change one word into the other.

Note: This interactive tool requires JavaScript to function in the browser. However, the underlying logic is standard Levenshtein distance, which you can implement in Python using the `python-Levenshtein` package.

import Levenshtein
distance = Levenshtein.distance("bisria", "bisriaa")
print(distance) # Output: 1

Assumptions & Limitations

This tool compares the raw strings. It does not normalize homoglyphs before comparison.
A distance of 1 or 2 is considered High Risk.
A distance of 3 is Medium Risk, but often yields false positives with short brand names.

Next step: If you find a close match, check its MX Records to see if it's weaponized for email.