{Kilian Evang}

Abstract
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.
Benchmarks
| Benchmark | Methodology | Metrics |
|---|---|---|
| drs-parsing-on-pmb-2-2-0 | Transition-based Stack-LSTM | F1: 74.4 |
Build AI with AI
From idea to launch — accelerate your AI development with free AI co-coding, out-of-the-box environment and best price of GPUs.