2017
DOI: 10.15398/jlm.v5i1.159
|View full text |Cite
|
Sign up to set email alerts
|

Chomsky-Schützenberger parsing for weighted multiple context-free languages

Abstract: 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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
1
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 30 publications
0
1
0
Order By: Relevance
“…The choice to use web technologies was made to take advantage of ready-to-use user interface elements, including the D3 visualization library and its pre-implemented zooming, panning, and dragging features. For the FFT computation, we use a 2014 version of the Project Nayuki Javascript FFT library ( Nayuki ), adapted by Cannam ( Cannam ). The autocorrelation computation does not use any libraries and is done directly in-app.…”
Section: Methodsmentioning
confidence: 99%
“…The choice to use web technologies was made to take advantage of ready-to-use user interface elements, including the D3 visualization library and its pre-implemented zooming, panning, and dragging features. For the FFT computation, we use a 2014 version of the Project Nayuki Javascript FFT library ( Nayuki ), adapted by Cannam ( Cannam ). The autocorrelation computation does not use any libraries and is done directly in-app.…”
Section: Methodsmentioning
confidence: 99%
“…Chomsky-Schützenberger (short: CS) parsing was introduced by Hulden (2011) for CFGs and extended to MCFGs by Denkinger (2017).…”
Section: Introductionmentioning
confidence: 99%