Elimination of Spurious Ambiguity in Transition-Based Dependency Parsing

S. B. Cohen; C. Gómez-Rodriguez; G. Satta

Elimination of Spurious Ambiguity in Transition-Based Dependency Parsing

S. B. Cohen, C. Gómez-Rodriguez, G. Satta

Research output: Working paper

Abstract

We present a novel technique to remove spurious ambiguity from transition systems for dependency parsing. Our technique chooses a canonical sequence of transition operations (computation) for a given dependency tree. Our technique can be applied to a large class of bottom-up transition systems, including for instance Nivre (2004) and Attardi (2006).

Original language	Undefined/Unknown
Publisher	ArXiv
Number of pages	12
Publication status	Published - 2012

Access to Document

1206.6735Final published version, 157 KB

http://arxiv.org/pdf/1206.6735v1

Cite this

@techreport{4686e761114b45abbf86fd6f3c521db1,

title = "Elimination of Spurious Ambiguity in Transition-Based Dependency Parsing",

abstract = "We present a novel technique to remove spurious ambiguity from transition systems for dependency parsing. Our technique chooses a canonical sequence of transition operations (computation) for a given dependency tree. Our technique can be applied to a large class of bottom-up transition systems, including for instance Nivre (2004) and Attardi (2006). ",

author = "Cohen, {S. B.} and C. G{\'o}mez-Rodriguez and G. Satta",

year = "2012",

language = "Undefined/Unknown",

publisher = "ArXiv",

type = "WorkingPaper",

institution = "ArXiv",

}

TY - UNPB

T1 - Elimination of Spurious Ambiguity in Transition-Based Dependency Parsing

AU - Cohen, S. B.

AU - Gómez-Rodriguez, C.

AU - Satta, G.

PY - 2012

Y1 - 2012

N2 - We present a novel technique to remove spurious ambiguity from transition systems for dependency parsing. Our technique chooses a canonical sequence of transition operations (computation) for a given dependency tree. Our technique can be applied to a large class of bottom-up transition systems, including for instance Nivre (2004) and Attardi (2006).

AB - We present a novel technique to remove spurious ambiguity from transition systems for dependency parsing. Our technique chooses a canonical sequence of transition operations (computation) for a given dependency tree. Our technique can be applied to a large class of bottom-up transition systems, including for instance Nivre (2004) and Attardi (2006).

M3 - Working paper

BT - Elimination of Spurious Ambiguity in Transition-Based Dependency Parsing

PB - ArXiv

ER -