TRAVERSAL at PARSEME Shared Task 2018: Identification of VMWEs Using a Discriminative Tree-Structured Model
Jakub Waszczuk
Heinrich Heine University, Düsseldorf, Germany
August 25, 2018
1 / 7
TRAVERSAL at PARSEME Shared Task 2018: Identification of VMWEs Using - - PowerPoint PPT Presentation
TRAVERSAL at PARSEME Shared Task 2018: Identification of VMWEs Using a Discriminative Tree-Structured Model Jakub Waszczuk Heinrich Heine University, Dsseldorf, Germany August 25, 2018 1 / 7 VMWEs, (dis)continuity, and sequential models
Heinrich Heine University, Düsseldorf, Germany
1 / 7
det nsubj
punct det amod amod case
2 / 7
det nsubj
punct det amod amod case
2 / 7
3 / 7
3 / 7
3 / 7
3 / 7
3 / 7
◮ It’s not enough to label nodes as MWEs or not-MWEs ◮ The boundaries of VMWEs need to be determined
◮ Consider all adjacent nodes marked as MWEs of the same category as a
◮ If a group of adjacent nodes is marked as MWEs but it contains two (or
◮ Variant of IOB encoding adapted to trees (not in the shared task)
4 / 7
◮ Repository: https://github.com/kawu/traversal ◮ Languages: Haskell + Dhall (configuration) ◮ License: 2-clause BSD
◮ Pre-processing: case lifting
case
case ◮ Feature engineering: PL and FR ◮ Backoff model: 2-order sequential CRF (LT) ◮ Training: TRAIN + DEV ◮ Models: one per (language, MWE category) pair
5 / 7
6 / 7
7 / 7