An Efficient Algorithm for Easy-First Non-Directional Dependency Parsing

Explore this paper's citation graph

Summary

A novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner, which is significantly more accurate than best-first transition based parsers, and nears the performance of globally optimized parsing models.

Type
article
Published
2010-06-02
Cited by
219
References
24

Keywords

Parsing, Computer science, Dependency grammar, Traverse, Dependency (UML)

References

Cited by

Related papers