Difference between revisions of "LRLM"
Jump to navigation
Jump to search
(Category:Documentation in English) |
|||
| Line 1: | Line 1: | ||
'''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 from left to right, matching the longest sequence that is in the dictionary (like "greedy" matching of regular expressions). |
'''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 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 ''[https://en.wikipedia.org/wiki/Maximal_munch Maximal Munch]''. |
||
[[Category:Development]] |
[[Category:Development]] |
||
Revision as of 10:53, 12 September 2014
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.
