The problem of constituency parsing is similar to the problem of completely parenthesizing n+1 factors in all possible ways.
the total possible ways of parsing a compound with n + 1 constituents is equal to a Catalan number, C n (Huet, 2009).