License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2023.67
URN: urn:nbn:de:0030-drops-186016
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/18601/
Mikhelson, Margarita ;
Okhotin, Alexander
Parallel Enumeration of Parse Trees
Abstract
A parallel algorithm for enumerating parse trees of a given string according to a fixed context-free grammar is defined. The algorithm computes the number of parse trees of an input string; more generally, it applies to computing the weight of a string in a weighted grammar. The algorithm is first implemented on an arithmetic circuit of depth O((log n)²) with O(n⁶) elements. Then, it is improved using fast matrix multiplication to use only O(n^5.38) elements, while preserving depth O((log n)²).
BibTeX - Entry
@InProceedings{mikhelson_et_al:LIPIcs.MFCS.2023.67,
author = {Mikhelson, Margarita and Okhotin, Alexander},
title = {{Parallel Enumeration of Parse Trees}},
booktitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)},
pages = {67:1--67:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-292-1},
ISSN = {1868-8969},
year = {2023},
volume = {272},
editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18601},
URN = {urn:nbn:de:0030-drops-186016},
doi = {10.4230/LIPIcs.MFCS.2023.67},
annote = {Keywords: Context-free grammars, weighted grammars, parsing, parallel algorithms, matrix multiplication}
}
|
Keywords: |
|
Context-free grammars, weighted grammars, parsing, parallel algorithms, matrix multiplication |
|
Collection: |
|
48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023) |
|
Issue Date: |
|
2023 |
|
Date of publication: |
|
21.08.2023 |
