fixed bug for concurrent replament pairs

morfologik / morfologik-stemming

Tools for finite state automata construction and dictionary-based morphological dictionaries. Includes Polish stemming dictionary.

BSD 3-Clause "New" or "Revised" License

187 stars 44 forks source link

fixed bug for concurrent replament pairs #21

Closed jaumeortola closed 10 years ago

jaumeortola commented 10 years ago

This fixes the bug for teached/taught. We choose the longest key, and ignore the rest (tgheached). I think it is very improbable that we need ever to check all concurrent keys.

milekpl commented 10 years ago

Could you also create a test dictionary with this? I want to make sure we don't have a regression soon.

milekpl commented 10 years ago

Perfect :)