Papers by Longtu Zhang
Neural Combinatory Constituency Parsing (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to constituency parsing are based on symbolic engineering, but they are simplified by their adaptive distributed representation. |
| Approach: | They propose two fast combinatory models for constituency parsing: binary and multibranching. |
| Outcome: | The proposed models achieve an F1 score of 92.54 on Penn Treebank, speeding at 1327.2 sents/sec. |