tree a634cd557ccf951d6858b1583167362aed4308d8
parent 101df31503e7bef59cd6096cd9eb2d708de7471b
author Willy Tarreau <w@1wt.eu> 1615797267 +0100
committer Willy Tarreau <w@1wt.eu> 1615797522 +0100
encoding latin1

MINOR: tools: improve word fingerprinting by counting presence

The distance between two words can be high due to a sub-word being missing
and in this case it happens that other totally unrealted words are proposed
because their average score looks lower thanks to being shorter. Here we're
introducing the notion of presence of each character so that word sequences
that contain existing sub-words are favored against the shorter ones having
nothing in common. In addition we do not distinguish being/end from a
regular delimitor anymore. That made it harder to spot inverted words.