Implementation of a Chomsky-Schützenberger n-best parser for weighted multiple context-free grammars
Research output: Contribution to book/conference proceedings/anthology/report › Conference contribution › Contributed › peer-review
Contributors
Abstract
Constituent parsing has been studied extensively in the last decades.
Chomsky-Schützenberger parsing as an approach to constituent parsing has only been investigated theoretically, yet.
It uses the decomposition of a language into a regular language, a homomorphism, and a bracket language to divide the parsing problem into simpler subproblems.
We provide the first implementation of Chomsky-Schützenberger parsing.
It employs multiple context-free grammars and incorporates many refinements to achieve feasibility.
We compare its performance to state-of-the-art grammar-based parsers.
Chomsky-Schützenberger parsing as an approach to constituent parsing has only been investigated theoretically, yet.
It uses the decomposition of a language into a regular language, a homomorphism, and a bracket language to divide the parsing problem into simpler subproblems.
We provide the first implementation of Chomsky-Schützenberger parsing.
It employs multiple context-free grammars and incorporates many refinements to achieve feasibility.
We compare its performance to state-of-the-art grammar-based parsers.
Details
Original language | English |
---|---|
Title of host publication | Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies |
Place of Publication | Minneapolis, Minnesota |
Pages | 178-191 |
Publication status | Published - 2019 |
Peer-reviewed | Yes |
Conference
Title | 2019 Annual Conference of the North American Chapter of the Association for Computational Linguistics |
---|---|
Abbreviated title | NAACL 2019 |
Conference number | |
Duration | 3 - 5 June 2020 |
Website | |
Degree of recognition | International event |
Location | |
City |
Keywords
Keywords
- parsing, discontinuous