Word Break Problem
The Word Break Problem is a computational problem in string algorithms that determines whether a given string can be segmented into a sequence of contiguous substrings, each of which belongs to a predefined dictionary of words.
13
Publications
507
Citations
22
Authors
11
Institutions
Publications per year
2017–2026
3
Variants
Word Segmentation Problem
Parents
13
Assigning phrase breaks from part-of-speech sequences
Paul Taylor, Alan W. Black · Computer Speech & Language · 1998 · 200 citations
Assigning phrase breaks from part-of-speech sequences
Alan W. Black, Paul Taylor · 1997 · 48 citations · Full text
Alexander Melnikov · Bulletin of Symbolic Logic · 2014 · 32 citations
A Dichotomy for Regular Expression Membership Testing
Karl Bringmann, Allan Grønlund, Kasper Green Larsen · 2017 · 30 citations
1–5 of 13
22
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 22
11

University of Wrocław
Wroclaw, Poland
2 h-index
2 publications
26 citations
Centrum Wiskunde & Informatica
Amsterdam, The Netherlands
2 h-index
2 publications
26 citations

University of Milano-Bicocca
Milan, Italy
1 h-index
1 publications
14 citations
Hebrew University of Jerusalem
Jerusalem, Israel
1 h-index
1 publications
21 citations

Aarhus University
Aarhus, Denmark
1 h-index
2 publications
60 citations

University of Edinburgh
Edinburgh, United Kingdom
1 h-index
2 publications
400 citations
Grantmakers for Effective Organizations
Washington D.C., United States
1 h-index
1 publications
16 citations
University of California, Berkeley
Berkeley, United States
1 h-index
1 publications
32 citations
1–8 of 11
2 publications · 223 citations
2
h-index
Repository · 1 publications · 14 citations
1
h-index
1 publications · 12 citations
1
h-index
1 publications · 26 citations
1
h-index
1 publications · 21 citations
1
h-index
1–5