LRLM - Revision history

Unhammer at 08:20, 24 February 2023

2023-02-24T08:20:14Z

Unhammer at 07:11, 24 February 2023

2023-02-24T07:11:59Z

Unhammer at 11:07, 12 September 2014

2014-09-12T11:07:31Z

Unhammer at 10:53, 12 September 2014

2014-09-12T10:53:07Z

Bech: Category:Documentation in English

2012-03-24T11:36:37Z

Category:Documentation in English

Unhammer: Created page with ''''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 fr…'

2010-06-10T09:46:07Z

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…'

New page

'''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).

[[Category:Development]]
[[Category:Lttoolbox]]

← Older revision		Revision as of 08:20, 24 February 2023
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 and bilingual modes. 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 and bilingual modes, as well as [[hfst]]-proc. 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 also used for structural transfer, so if input is a determiner followed by a noun, and there are rules for "det", "n", and "det n", the "det n" rule will match.		LRLM is also used for structural transfer, so if input is a determiner followed by a noun, and there are rules for "det", "n", and "det n", the "det n" rule will match.

@@ Line 8: / Line 8: @@
 [[Category:Lttoolbox]]
 [[Category:Documentation in English]]
+[[Category:Tokenisation]]

@@ 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 and bilingual modes. 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 also used for structural transfer, so if input is a determiner followed by a noun, and there are rules for "det", "n", and "det n", the "det n" rule will match.
 Another term for ''longest-match'' is ''[https://en.wikipedia.org/wiki/Maximal_munch Maximal Munch]''.