Maximum Spanning Tree Algorithm for Non-projective Labeled Dependency Parsing

Nobuyuki Shimizu


Anthology ID:
W06-2936
Volume:
Proceedings of the Tenth Conference on Computational Natural Language Learning (CoNLL-X)
Month:
June
Year:
2006
Address:
New York City
Venues:
CoNLL | WS
SIG:
SIGNLL
Publisher:
Association for Computational Linguistics
Note:
Pages:
236–240
Language:
URL:
https://aclanthology.org/W06-2936
DOI:
Bibkey:
Cite (ACL):
Nobuyuki Shimizu. 2006. Maximum Spanning Tree Algorithm for Non-projective Labeled Dependency Parsing. In Proceedings of the Tenth Conference on Computational Natural Language Learning (CoNLL-X), pages 236–240, New York City. Association for Computational Linguistics.
Cite (Informal):
Maximum Spanning Tree Algorithm for Non-projective Labeled Dependency Parsing (Shimizu, 2006)
Copy Citation:
PDF:
https://aclanthology.org/W06-2936.pdf