forked from GitHub/dbot
Make max winner distance proportional to correction length, so long strings can match.
This commit is contained in:
parent
85bc47c152
commit
68943d6c8f
@ -19,7 +19,7 @@ var spelling = function(dbot) {
|
||||
}
|
||||
}
|
||||
|
||||
if(winnerDistance < 7) {
|
||||
if(winnerDistance < Math.ceil(correction.length * 1.33)) {
|
||||
if(winner !== correction) {
|
||||
var fix = last[data.channel][candidate].replace(winner, correction);
|
||||
if (/^.ACTION/.test(fix)) {
|
||||
|
Loading…
Reference in New Issue
Block a user