Difference between revisions of "LRLM"
Jump to navigation
Jump to search
(Created page with ''''LRLM''' is short for ''Left-to-Right, Longest-Match'', the parsing strategy used by <code>lt-proc</code> of lttoolbox in analysis mode. Basically, it means: read tokens fr…') |
(Category:Documentation in English) |
||
| Line 3: | Line 3: | ||
[[Category:Development]] |
[[Category:Development]] |
||
[[Category:Lttoolbox]] |
[[Category:Lttoolbox]] |
||
[[Category:Documentation in English]] |
|||
Revision as of 11:36, 24 March 2012
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).
