Constituent parsing has been studied extensively in the last decades.
Chomsky-Schützenberger parsing as an approach to constituent parsing has only been investigated theoretically, yet.
It uses the decomposition of a language into a regular language, a homomorphism, and a bracket language to divide the parsing problem into simpler subproblems.
We provide the first implementation of Chomsky-Schützenberger parsing.
It employs multiple context-free grammars and incorporates many refinements to achieve feasibility.
We compare its performance to state-of-the-art grammar-based parsers.