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

Authors

22

  1. SP
    Solon P. Pissis

    King's College London, United Kingdom

    2 publications · 26 citations

    2

    h-index

  2. PG
    Paweł Gawrychowski

    University of Wrocław, Poland

    2 publications · 26 citations

    2

    h-index

  3. GR
    Giovanna Rosone

    University of Palermo, Italy

    2 publications · 26 citations

    2

    h-index

  4. NP
    Nadia Pisanti

    University of Pisa, Italy

    2 publications · 26 citations

    2

    h-index

  5. GB
    Giulia Bernardini

    University of Milano-Bicocca, Italy

    2 publications · 26 citations

    2

    h-index

1–5 of 22

Venues

  1. Computer Speech & Language

    2 publications · 223 citations

    2

    h-index

  2. arXiv (Cornell University)

    Repository · 1 publications · 14 citations

    1

    h-index

  3. SIAM Journal on Computing

    1 publications · 12 citations

    1

    h-index

  4. Nuclear Physics B - Proceedings Supplements

    1 publications · 26 citations

    1

    h-index

  5. Israel Journal of Mathematics

    1 publications · 21 citations

    1

    h-index

1–5