Faster shift-reduce constituent parsing with a non-binary, bottom-up strategy

DOI10.1016/J.ARTINT.2019.07.006zbMath1478.68415arXiv1804.07961OpenAlexW2799211465WikidataQ127480147 ScholiaQ127480147MaRDI QIDQ2321341

Daniel Fernández-González, C. Gómez-Rodríguez

Publication date: 28 August 2019

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.07961

zbMATH Keywords

automatanatural language processingcomputational linguisticsparsingconstituent parsing

Mathematics Subject Classification ID

Natural language processing (68T50)

Uses Software

• LSTM
• Stanford Tagger
• Penn Treebank
• SQuAD

Cites Work

• Finding the smallest binarization of a CFG is NP-hard
• Three models for the description of language
• Unnamed Item

This page was built for publication: Faster shift-reduce constituent parsing with a non-binary, bottom-up strategy