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: | Tobias Denkinger |
---|---|
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 |
Similar Items
-
Schützenberger Symmetries in Network Structures
by: Allen D. Parks
Published: (2018-07-01) -
Generation of Syntax Parser on South Indian Language using Bottom-Up Parsing Technique and PCFG
by: M. Rajani Shree, et al.
Published: (2023-01-01) -
Natural language parsing systems /
by: Bolc, Leonard
Published: (1987) -
On Parsing Programming Languages with Turing-Complete Parser
by: Boštjan Slivnik, et al.
Published: (2023-03-01) -
Split-Based Algorithm for Weighted Context-Free Grammar Induction
by: Mateusz Gabor, et al.
Published: (2021-01-01)