Review error rate definitions etc. about dinglehopper HOT 2 OPEN

I suggest to implement alignment path length as denominator instead of the GT length (which can be >1):

(Ideally, you implement all 3 length options: alignment path, maximum sequence, GT sequence.)

The problem for dinglehopper is that your levenshtein_matrix does not give you the alignment path, you only have the resulting minimum distance.

from dinglehopper.

Update: I recommend using rapidfuzz's normalized_distance instead of just dividing distance by the GT length. Internally (in the CPP backend) the denominator is calculated as the actual path length (=maximum distance).

from dinglehopper.