Feature Request: Efficient FSM Construction from Word Lists
Feature Request: Efficient FSM Construction from Word Lists: a task in LegoFlow-SWE (Harbor dataset). The library currently builds finite state machines for literal patterns only through the regex interface ( re comp ). When working with large collections of strings (e.g., a list of thousands of…
The task
The library currently builds finite state machines for literal patterns only through the regex interface (`re_comp`). When working with large collections of strings (e.g., a list of thousands of words), compiling each word individually or using `|`-alternation in a regex becomes prohibitively slow and memory‑intensive.
Part of Lego-X/LegoFlow-SWE.