VoiceLessQ b06aece4eb Proofing: a candidate found again at a lower cost ranks at that cost ...

The suggestion rounds don't run in rising cost: a MAP diacritic drop (11)
comes before a REP confusion (10, 9 for Russian). The engine checked each
candidate once, at the first cost it was offered, so the same word found
again more cheaply kept the dearer cost and could rank one place too low.
Czech's engine always did this, and the merged engine took it over.

The candidate set is now a map to the cheapest cost offered so far, and
an offer that is no cheaper is skipped as before.

Found by CodeRabbit on storytold/wordcraft#4191. Tests: a_cheaper_later_offer_wins; skipping
every repeat offer again fails it. Proof: 288 tests.

2026-10-24 20:57:35 -01:00

crates/proof

Proofing: a candidate found again at a lower cost ranks at that cost

2026-10-24 20:57:35 -01:00

S

Description

No description provided

109 MiB

0 Stars 1 Watchers 0 Forks

Languages

Rust 98.5%

Max 1.3%

Python 0.2%