Chomsky-Schützenberger parsing for weighted multiple context-free languages
Keywords:
Chomsky-Schützenberger, parsing, multiple context-free grammars, linear context-free rewriting systemsAbstract
We prove a Chomsky-Schützenberger representation theorem for multiple context-free languages weighted over complete commutative strong bimonoids. Using this representation we devise a parsing algorithm for a restricted form of those devices.
DOI:
https://doi.org/10.15398/jlm.v5i1.159Full article
Published
2017-07-03
How to Cite
Denkinger, T. (2017). Chomsky-Schützenberger parsing for weighted multiple context-free languages. Journal of Language Modelling, 5(1), 3–55. https://doi.org/10.15398/jlm.v5i1.159
Issue
Section
Articles
License
Copyright (c) 2017 Tobias Denkinger
This work is licensed under a Creative Commons Attribution 3.0 Unported License.