Re-thinking Supertags in Linear Context-free Rewriting Systems for Constituency Parsing
Recently, a supertagging-based approach for parsing discontinuous constituent trees with linear context-free rewriting systems (LCFRS) was introduced. We reformulate their algorithm for the extraction of supertags from treebanks to be more concise. Moreover, we add some extensions that give us control over the extraction process in terms of supertag granularity and which terminal symbols are associated with supertags. Our additions lead to an increase in parsing quality with LCFRS supertagging in all three compared treebanks. The scores are among the state of the art in discontinuous constituent parsing.
Code (0)
등록된 구현이 없습니다.
Tasks
Constituency ParsingSimilar Papers 제목 키워드 기반
Efficient parsing with Linear Context-Free Rewriting Systems
On the Parameterized Complexity of Linear Context-Free Rewriting Systems
Synchronous Linear Context-Free Rewriting Systems for Machine Translation
Data-Driven Parsing using Probabilistic Linear Context-Free Rewriting Systems
Parsing Linear Context-Free Rewriting Systems with Fast Matrix Multiplication
We describe a matrix multiplication recognition algorithm for a subset of binary linear context-free rewriting systems (LCFRS) with running time $O(n^{\omega d})$ where $M(m) = O(m^{\omega})$ is the running time for $m \…