Transition-based DRS Parsing Using Stack-LSTMs
We present our submission to the IWCS 2019 shared task on semantic parsing, a transition-based parser that uses explicit word-meaning pairings, but no explicit representation of syntax. Parsing decisions are made based on vector representations of parser states, encoded via stack-LSTMs (Ballesteros et al., 2017), as well as some heuristic rules. Our system reaches 70.88{\%} f-score in the competition.
PDF AbstractTasks
Datasets
Add Datasets
introduced or used in this paper
| Task | Dataset | Model | Metric Name | Metric Value | Global Rank | Benchmark |
|---|---|---|---|---|---|---|
| DRS Parsing | PMB-2.2.0 | Transition-based Stack-LSTM | F1 | 74.4 | # 6 |
Methods
No methods listed for this paper. Add
relevant methods here
