Dependency parsing based on dynamic local optimization

Ting Liu; Jinshan Ma; Huijia Zhu; Sheng Li

doi:10.3115/1596276.1596316

Dependency parsing based on dynamic local optimization

Ting Liu
, Jinshan Ma^*
, Huijia Zhu
, Sheng Li

^*Corresponding author for this work

Faculty of Computing

Harbin Institute of Technology

Research output: Contribution to conference › Paper › peer-review

9 Scopus citations

Abstract

This paper presents a deterministic parsing algorithm for projective dependency grammar. In a bottom-up way the algorithm finds the local optimum dynamically. A constraint procedure is made to use more structure information. The algorithm parses sentences in linear time and labeling is integrated with the parsing. This parser achieves 63.29% labeled attachment score on the average in CoNLLX Shared Task.

Original language	English
DOIs	https://doi.org/10.3115/1596276.1596316
State	Published - 2006
Event	10th Conference on Computational Natural Language Learning, CoNLL-X - New York, NY, United States Duration: 8 Jun 2006 → 9 Jun 2006

Conference

Conference	10th Conference on Computational Natural Language Learning, CoNLL-X
Country/Territory	United States
City	New York, NY
Period	8/06/06 → 9/06/06

Access to Document

10.3115/1596276.1596316

Cite this

@conference{b42fd24640e34f08823d3fdbe8ce4ae5,

title = "Dependency parsing based on dynamic local optimization",

abstract = "This paper presents a deterministic parsing algorithm for projective dependency grammar. In a bottom-up way the algorithm finds the local optimum dynamically. A constraint procedure is made to use more structure information. The algorithm parses sentences in linear time and labeling is integrated with the parsing. This parser achieves 63.29\% labeled attachment score on the average in CoNLLX Shared Task.",

author = "Ting Liu and Jinshan Ma and Huijia Zhu and Sheng Li",

year = "2006",

doi = "10.3115/1596276.1596316",

language = "英语",

note = "10th Conference on Computational Natural Language Learning, CoNLL-X ; Conference date: 08-06-2006 Through 09-06-2006",

}

TY - CONF

T1 - Dependency parsing based on dynamic local optimization

AU - Liu, Ting

AU - Ma, Jinshan

AU - Zhu, Huijia

AU - Li, Sheng

PY - 2006

Y1 - 2006

N2 - This paper presents a deterministic parsing algorithm for projective dependency grammar. In a bottom-up way the algorithm finds the local optimum dynamically. A constraint procedure is made to use more structure information. The algorithm parses sentences in linear time and labeling is integrated with the parsing. This parser achieves 63.29% labeled attachment score on the average in CoNLLX Shared Task.

AB - This paper presents a deterministic parsing algorithm for projective dependency grammar. In a bottom-up way the algorithm finds the local optimum dynamically. A constraint procedure is made to use more structure information. The algorithm parses sentences in linear time and labeling is integrated with the parsing. This parser achieves 63.29% labeled attachment score on the average in CoNLLX Shared Task.

UR - https://www.scopus.com/pages/publications/85085399946

U2 - 10.3115/1596276.1596316

DO - 10.3115/1596276.1596316

M3 - 论文

AN - SCOPUS:85085399946

T2 - 10th Conference on Computational Natural Language Learning, CoNLL-X

Y2 - 8 June 2006 through 9 June 2006

ER -

Dependency parsing based on dynamic local optimization

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this