Hybrid tree automata and the yield theorem for constituent tree automata
Article in Theoretical Computer Science (November 2023)
The most recent citing publications are shown below. View all 58 publications that cite this research output on Dimensions.
Constituency Parsing as an Instance of the M-monoid Parsing Problem
Preprint in arXiv (September 2023)
Constituency Parsing as an Instance of the M-monoid Parsing Problem
Article in Electronic Proceedings in Theoretical Computer Science (September 2023)