Closed barzerman closed 11 years ago
@0xd34df00d feel free to take this ticket - just make sure you update it as soon a s you start working
In fact, finished working :)
"contains" logic isn't implemented due to its huge computational cost. I couldn't think of an approach that is faster than at least linear search among all added exceptions.
must be a way to specify soemthing like IF word begins with X then its stem should be Y as well as IF word contains X then its stem should be Y
the pairs as well as well as the logic to be applied should be in a pipe separated file (or XML)
e.g. B|дени|дени С|варить|варит