Skip to content
Jinho D. Choi edited this page Feb 26, 2017 · 2 revisions

Dependency Parsing

Your task is to generate a transition sequence given the gold dependency tree:

Transitions

For the following example:

1	Ms.	ms.	NNP	_	2	NMOD
2	Haag	haag	NNP	_	3	SUB	
3	plays	play	VBZ	_	0	ROOT
4	Elianti	elianti	NNP	_	3	OBJ
5	.	.	.	_	3	P

The expected transitions:

SHIFT
LEFT-ARC-NMOD
SHIFT
LEFT-ARC-SUB
RIGHT-ARC-ROOT
RIGHT-ARC-OBJ
REDUCE
RIGHT-ARC-P

Put a newline between transitions generated from every tree.

Submission

CS571: Natural Language Processing

Instructor


Emory University

Clone this wiki locally