TRAVERSAL at PARSEME Shared Task 2018: Identification of VMWEs Using - - PowerPoint PPT Presentation

traversal at parseme shared task 2018 identification of
SMART_READER_LITE
LIVE PREVIEW

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


slide-1
SLIDE 1

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

slide-2
SLIDE 2

VMWEs, (dis)continuity, and sequential models

This change triggered a veritable ecological cascade in Yellowstone . O O LVC-B O O O LVC-I O O O

det nsubj

  • bj
  • bl

punct det amod amod case

2 / 7

slide-3
SLIDE 3

VMWEs, (dis)continuity, and sequential models

This change triggered a veritable ecological cascade in Yellowstone . O O LVC-B O O O LVC-I O O O

det nsubj

  • bj
  • bl

punct det amod amod case

Sequential models: ⋄ Do not directly capture the relation between LVC-B and LVC-I. ⋄ CRF: labeling triggered with LVC-B is independent from labeling cascade with LVC-I (provided that the material in between is labeled with Os).

2 / 7

slide-4
SLIDE 4

Labeling

Goal: capture the relations between MWE labels of adjacent nodes. ⋄ Variant of the 2-order Eisner’s graph-based dependency parser ⋄ Extension of sequential CRFs to tree structures ⋄ Multiclass logistic regression model with special factorization allowing efficient computation

3 / 7

slide-5
SLIDE 5

Labeling

Goal: capture the relations between MWE labels of adjacent nodes. ⋄ Variant of the 2-order Eisner’s graph-based dependency parser ⋄ Extension of sequential CRFs to tree structures ⋄ Multiclass logistic regression model with special factorization allowing efficient computation

3 / 7

slide-6
SLIDE 6

Labeling

Goal: capture the relations between MWE labels of adjacent nodes. ⋄ Variant of the 2-order Eisner’s graph-based dependency parser ⋄ Extension of sequential CRFs to tree structures ⋄ Multiclass logistic regression model with special factorization allowing efficient computation

3 / 7

slide-7
SLIDE 7

Labeling

Goal: capture the relations between MWE labels of adjacent nodes. ⋄ Variant of the 2-order Eisner’s graph-based dependency parser ⋄ Extension of sequential CRFs to tree structures ⋄ Multiclass logistic regression model with special factorization allowing efficient computation

3 / 7

slide-8
SLIDE 8

Labeling

Goal: capture the relations between MWE labels of adjacent nodes. ⋄ Variant of the 2-order Eisner’s graph-based dependency parser ⋄ Extension of sequential CRFs to tree structures ⋄ Multiclass logistic regression model with special factorization allowing efficient computation

3 / 7

slide-9
SLIDE 9

Segmentation

Problem

◮ It’s not enough to label nodes as MWEs or not-MWEs ◮ The boundaries of VMWEs need to be determined

Solutions

◮ Consider all adjacent nodes marked as MWEs of the same category as a

single MWE occurrence (default heuristic)

◮ If a group of adjacent nodes is marked as MWEs but it contains two (or

more) verbs, the group is divided into two (or more) distinct MWEs

(heuristic applied only to FA)

◮ Variant of IOB encoding adapted to trees (not in the shared task)

4 / 7

slide-10
SLIDE 10

Implementation

◮ Repository: https://github.com/kawu/traversal ◮ Languages: Haskell + Dhall (configuration) ◮ License: 2-clause BSD

Setup

◮ Pre-processing: case lifting

based

  • n

data

  • bl

case

⇒ based

  • n

data

  • bl

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

slide-11
SLIDE 11

Results

MWE-based Token-based P R F1 Rank Delta P R F1 Rank Delta SL 79.41 54 64.29 1/10 21.95 83.61 54.54 66.01 1/10 14.04 HR 68.04 46.59 55.3 1/10 11.03 78.14 50.73 61.52 1/10 11.55 IT 63.09 40.32 49.2 1/12 10.68 74.42 42.11 53.78 1/12 7.27 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . PL 77.02 59.22 66.96 1/11 6.42 81.85 59.03 68.59 1/11 3.67 FR 77.19 44.18 56.19 1/13 5.65 84.72 48.76 61.9 1/13 6.18 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . FA 73.8 58.48 65.26 7/10

  • 12.57

90.19 65.23 75.7 6/10

  • 5.58

LT 29.61 13.8 18.83 3/10

  • 13.34

55.56 16.92 25.94 3/10

  • 8.49

AVG 67.58 44.97 54 1/13 4.26 77.41 48.55 59.67 1/13 5.04

Table: Results for the individual languages ordered by the difference between TRAVERSAL’s F1 and F1 of the other best-performing system (Delta)

6 / 7

slide-12
SLIDE 12

Results

  • Cont. Discont.

Multi-tok. Single-tok. Seen Unseen Variant Identical F1 57.55 44.36 55.83 25.96 72.92 17.35 63.1 81.88 Delta 2.17 6.96 6.45

  • 6.86

0.85

  • 2.36
  • 1.92
  • 1.85

Table: Macro-average MWE-based F1-scores for specialized phenomena

IAV IRV LVC.cause LVC.full MVC VID VPC.full VPC.semi LS.ICV F1 44.31 68.07 23.81 46.03 17.65 34.45 34.84 42.70 30.77 Delta 8.89 8.51

  • 8.34

6.30

  • 11.39

8.01 2.07 2.2 10.77

Table: Macro-average MWE-based F1-scores for MWE categories

7 / 7