Example: In the About section, each team member has an auto-generated link. The algorithm simply finds the closest match, even if it's not close at all.
Quick solution: Only link if Levenshtain distance is smaller than approx. string length divided by 3, i.e. if there is no more than one letter-modification per every three letters. This function is already implemented. Needs 10min to transfer.
Sustainable solution: Allow manual overrides for auto-generated links (needs a good design still)
Example: In the About section, each team member has an auto-generated link. The algorithm simply finds the closest match, even if it's not close at all.
Quick solution: Only link if Levenshtain distance is smaller than approx. string length divided by 3, i.e. if there is no more than one letter-modification per every three letters. This function is already implemented. Needs 10min to transfer.
Sustainable solution: Allow manual overrides for auto-generated links (needs a good design still)
Severity: medium