Papers by Juneki Hong
Linear-time Constituency Parsing with RNNs and Dynamic Programming (P18-2)
Copied to clipboard
| Challenge: | Existing span-based constituency parsers are too slow for longer sentences and for applications beyond sentence boundaries. |
| Approach: | They propose a linear-time constituency parser with RNNs and dynamic programming using graph-structured stack and beam search. |
| Outcome: | The proposed parser is faster for long sentences and faster for discourse parsing. |