Optimizing for Measure of Performance in Max-Margin Parsing

09/05/2017
by   Alexander Bauer, et al.
0

Many statistical learning problems in the area of natural language processing including sequence tagging, sequence segmentation and syntactic parsing has been successfully approached by means of structured prediction methods. An appealing property of the corresponding discriminative learning algorithms is their ability to integrate the loss function of interest directly into the optimization process, which potentially can increase the resulting performance accuracy. Here, we demonstrate on the example of constituency parsing how to optimize for F1-score in the max-margin framework of structural SVM. In particular, the optimization is with respect to the original (not binarized) trees.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/22/2022

Evaluating Persian Tokenizers

Tokenization plays a significant role in the process of lexical analysis...
research
07/06/2021

Shell Language Processing: Unix command parsing for Machine Learning

In this article, we present a Shell Language Preprocessing (SLP) library...
research
04/28/2021

Learning Syntax from Naturally-Occurring Bracketings

Naturally-occurring bracketings, such as answer fragments to natural lan...
research
07/02/2020

Consistent Structured Prediction with Max-Min Margin Markov Networks

Max-margin methods for binary classification such as the support vector ...
research
05/31/2021

Max-Margin is Dead, Long Live Max-Margin!

The foundational concept of Max-Margin in machine learning is ill-posed ...
research
06/02/1999

Learning Efficient Disambiguation

This dissertation analyses the computational properties of current perfo...
research
04/22/2019

Tetra-Tagging: Word-Synchronous Parsing with Linear-Time Inference

We present a constituency parsing algorithm that maps from word-aligned ...

Please sign up or login with your details

Forgot password? Click here to reset