LRLM

From Apertium

Revision as of 10:53, 12 September 2014 by Unhammer (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

LRLM is short for Left-to-Right, Longest-Match, the parsing strategy used by lt-proc of lttoolbox in analysis mode. Basically, it means: read tokens from left to right, matching the longest sequence that is in the dictionary (like "greedy" matching of regular expressions).

Another term for longest-match is Maximal Munch.

Retrieved from "https://wiki.apertium.org/w/index.php?title=LRLM&oldid=50185"