Longest-match Rule
The Longest-Match Rule is a lexical disambiguation principle in lexical analysis that selects the longest possible lexeme matching a given input string over shorter competing matches, thereby determining the most appropriate token boundary in a scanner.
29
Publications
1.5K
Citations
75
Authors
34
Institutions
Publications per year
2017–2026
3
Parents
29
Wire speed name lookup: a GPU-based approach
Yi Wang, Yuan Zu, Ting Zhang et al. · 2013 · 97 citations
On the use of words and n-grams for Chinese information retrieval
Jian‐Yun Nie, Jiangfeng Gao, Jian Zhang et al. · 2000 · 95 citations
1–5 of 29
75
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 75
34
University of California, Berkeley
Berkeley, United States
2 h-index
4 publications
338 citations
Alcatel Lucent (Germany)
Stuttgart, Germany
2 h-index
2 publications
153 citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
2 h-index
4 publications
369 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
2 publications
204 citations

University of Central Florida
Orlando, United States
1 h-index
3 publications
63 citations
California Southern University
Chandler, United States
1 h-index
3 publications
114 citations
National University of Singapore
Singapore, Singapore
1 h-index
1 publications
56 citations

University of Groningen
Groningen, The Netherlands
1 h-index
1 publications
23 citations
1–8 of 34
2 publications · 117 citations
2
h-index
Repository · 2 publications · 107 citations
2
h-index
1 publications · 33 citations
1
h-index
TON · 1 publications · 46 citations
1
h-index
Repository · 1 publications · 29 citations
1
h-index
1–5