This will be the last pure-Ruby version.

rmmseg version 0.1.3
by pluskid
http://rmmseg.rubyforge.org

== DESCRIPTION

RMMSeg is an implementation of MMSEG Chinese word segmentation
algorithm. It is based on two variants of maximum matching
algorithms. Two algorithms are available for using:

* simple algorithm that uses only forward maximum matching.
* complex algorithm that uses three-word chunk maximum matching and 3
aditonal rules to solve ambiguities.

For more information about the algorithm, please refer to the
following essays:

* http://technology.chtsai.org/mmseg/
* http://pluskid.lifegoo.com/?p=261

== CHANGES

* Make RMMSeg Token campatible to Ferret Token.
* Use while instead of loop for performance improvement.
* Avoid many costly String#jlength call for performance improvement (use only 70% time and 40% memory as before).