Chomsky-Schützenberger parsing for weighted multiple context-free languages
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.
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Computer Science, Polish Academy of Sciences
2017-07-01
|
| Series: | Journal of Language Modelling |
| Subjects: | |
| Online Access: | https://jlm.ipipan.waw.pl/index.php/JLM/article/view/159 |