Dependency parsing based on dynamic local optimization

Authors:
Ting Liu;Jinshan Ma;Huijia Zhu;Sheng Li
Affiliations:
Harbin Institute of Technology, Harbin, China;Harbin Institute of Technology, Harbin, China;Harbin Institute of Technology, Harbin, China;Harbin Institute of Technology, Harbin, China
Venue:
CoNLL-X '06 Proceedings of the Tenth Conference on Computational Natural Language Learning
Year:
2006

Citing 2
Cited 4

Discriminative Reranking for Natural Language Parsing

ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Three new probabilistic models for dependency parsing: an exploration

COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1

Dependency parsing of turkish

Computational Linguistics
Extracting paraphrase patterns from bilingual parallel corpora

Natural Language Engineering
Dependency based Chinese sentence realization

ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - Volume 2
Dependency relation based detection of lexicalized user goals

UIC'10 Proceedings of the 7th international conference on Ubiquitous intelligence and computing

Quantified Score

Hi-index	0.00

Visualization

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 CoNLL-X Shared Task.