Richard Mörbitz (Technische Universität Dresden) |
We consider the constituent parsing problem which states: given a final state normalized constituent tree automaton (CTA) and a string, compute the set of all constituent trees that are inductively recognized by the CTA and yield the string. We show that this problem is an instance of the M-monoid parsing problem. Moreover, we show that we can employ the generic M-monoid parsing algorithm to solve the constituency parsing problem for a meaningful class of CTA. |
ArXived at: https://dx.doi.org/10.4204/EPTCS.388.9 | bibtex | |
Comments and questions to: eptcs@eptcs.org |
For website issues: webmaster@eptcs.org |