The structured weighted violations perceptron algorithm

Rotem Dror; Roi Reichart

doi:10.18653/v1/d16-1045

The structured weighted violations perceptron algorithm

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We present the Structured Weighted Violations Perceptron (SWVP) algorithm, a new structured prediction algorithm that generalizes the Collins Structured Perceptron (CSP, (Collins, 2002)). Unlike CSP, the update rule of SWVP explicitly exploits the internal structure of the predicted labels. We prove the convergence of SWVP for linearly separable training sets, provide mistake and generalization bounds, and show that in the general case these bounds are tighter than those of the CSP special case. In synthetic data experiments with data drawn from an HMM, various variants of SWVP substantially outperform its CSP special case. SWVP also provides encouraging initial dependency parsing results.

Original language	English
Title of host publication	EMNLP 2016 - Conference on Empirical Methods in Natural Language Processing, Proceedings
Publisher	Association for Computational Linguistics (ACL)
Pages	469-478
Number of pages	10
ISBN (Electronic)	9781945626258
DOIs	https://doi.org/10.18653/v1/d16-1045
State	Published - 2016
Externally published	Yes
Event	2016 Conference on Empirical Methods in Natural Language Processing, EMNLP 2016 - Austin, United States Duration: 1 Nov 2016 → 5 Nov 2016

Publication series

Name	EMNLP 2016 - Conference on Empirical Methods in Natural Language Processing, Proceedings

Conference

Conference	2016 Conference on Empirical Methods in Natural Language Processing, EMNLP 2016
Country/Territory	United States
City	Austin
Period	1/11/16 → 5/11/16

Bibliographical note

Publisher Copyright:
© 2016 Association for Computational Linguistics

ASJC Scopus subject areas

Computer Science Applications
Information Systems
Computational Theory and Mathematics

Access to Document

10.18653/v1/d16-1045

Cite this

Dror, R., & Reichart, R. (2016). The structured weighted violations perceptron algorithm. In EMNLP 2016 - Conference on Empirical Methods in Natural Language Processing, Proceedings (pp. 469-478). (EMNLP 2016 - Conference on Empirical Methods in Natural Language Processing, Proceedings). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/d16-1045

@inproceedings{6e4392976dcc4b71a1c3816b39792c00,

title = "The structured weighted violations perceptron algorithm",

abstract = "We present the Structured Weighted Violations Perceptron (SWVP) algorithm, a new structured prediction algorithm that generalizes the Collins Structured Perceptron (CSP, (Collins, 2002)). Unlike CSP, the update rule of SWVP explicitly exploits the internal structure of the predicted labels. We prove the convergence of SWVP for linearly separable training sets, provide mistake and generalization bounds, and show that in the general case these bounds are tighter than those of the CSP special case. In synthetic data experiments with data drawn from an HMM, various variants of SWVP substantially outperform its CSP special case. SWVP also provides encouraging initial dependency parsing results.",

author = "Rotem Dror and Roi Reichart",

note = "Publisher Copyright: {\textcopyright} 2016 Association for Computational Linguistics; 2016 Conference on Empirical Methods in Natural Language Processing, EMNLP 2016 ; Conference date: 01-11-2016 Through 05-11-2016",

year = "2016",

doi = "10.18653/v1/d16-1045",

language = "English",

series = "EMNLP 2016 - Conference on Empirical Methods in Natural Language Processing, Proceedings",

publisher = "Association for Computational Linguistics (ACL)",

pages = "469--478",

booktitle = "EMNLP 2016 - Conference on Empirical Methods in Natural Language Processing, Proceedings",

address = "United States",

}

Dror, R & Reichart, R 2016, The structured weighted violations perceptron algorithm. in EMNLP 2016 - Conference on Empirical Methods in Natural Language Processing, Proceedings. EMNLP 2016 - Conference on Empirical Methods in Natural Language Processing, Proceedings, Association for Computational Linguistics (ACL), pp. 469-478, 2016 Conference on Empirical Methods in Natural Language Processing, EMNLP 2016, Austin, United States, 1/11/16. https://doi.org/10.18653/v1/d16-1045

The structured weighted violations perceptron algorithm. / Dror, Rotem; Reichart, Roi.
EMNLP 2016 - Conference on Empirical Methods in Natural Language Processing, Proceedings. Association for Computational Linguistics (ACL), 2016. p. 469-478 (EMNLP 2016 - Conference on Empirical Methods in Natural Language Processing, Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - The structured weighted violations perceptron algorithm

AU - Dror, Rotem

AU - Reichart, Roi

PY - 2016

Y1 - 2016

N2 - We present the Structured Weighted Violations Perceptron (SWVP) algorithm, a new structured prediction algorithm that generalizes the Collins Structured Perceptron (CSP, (Collins, 2002)). Unlike CSP, the update rule of SWVP explicitly exploits the internal structure of the predicted labels. We prove the convergence of SWVP for linearly separable training sets, provide mistake and generalization bounds, and show that in the general case these bounds are tighter than those of the CSP special case. In synthetic data experiments with data drawn from an HMM, various variants of SWVP substantially outperform its CSP special case. SWVP also provides encouraging initial dependency parsing results.

AB - We present the Structured Weighted Violations Perceptron (SWVP) algorithm, a new structured prediction algorithm that generalizes the Collins Structured Perceptron (CSP, (Collins, 2002)). Unlike CSP, the update rule of SWVP explicitly exploits the internal structure of the predicted labels. We prove the convergence of SWVP for linearly separable training sets, provide mistake and generalization bounds, and show that in the general case these bounds are tighter than those of the CSP special case. In synthetic data experiments with data drawn from an HMM, various variants of SWVP substantially outperform its CSP special case. SWVP also provides encouraging initial dependency parsing results.

UR - http://www.scopus.com/inward/record.url?scp=85072843695&partnerID=8YFLogxK

U2 - 10.18653/v1/d16-1045

DO - 10.18653/v1/d16-1045

M3 - Conference contribution

AN - SCOPUS:85072843695

T3 - EMNLP 2016 - Conference on Empirical Methods in Natural Language Processing, Proceedings

SP - 469

EP - 478

BT - EMNLP 2016 - Conference on Empirical Methods in Natural Language Processing, Proceedings

PB - Association for Computational Linguistics (ACL)

T2 - 2016 Conference on Empirical Methods in Natural Language Processing, EMNLP 2016

Y2 - 1 November 2016 through 5 November 2016

ER -

The structured weighted violations perceptron algorithm

Abstract

Publication series

Conference

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this