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 additonal 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

Required Ruby Version

None

Authors

pluskid

Versions

  1. 0.1.6

    1. source

      1. 0.1.6 source March 16, 2008 (715 KB)
  2. 0.1.5

    1. source

      1. 0.1.5 source March 04, 2008 (715 KB)
  3. 0.1.4

    1. source

      1. 0.1.4 source March 02, 2008 (715 KB)
  4. 0.1.3

    1. source

      1. 0.1.3 source February 27, 2008 (715 KB)
  5. 0.1.2

    1. source

      1. 0.1.2 source February 25, 2008 (715 KB)
Show all versions (8 total)

SHA 256 checksum

← Previous version