Graph-Based Dependency Parser

This parser extended a perceptron part-of-speech tagger into dependency parser. It works on any of universal dependency corpus in a conllu format.

The parser first scores each possible edge using perceptron, and figure out a maximum spanning tree.

Click here for the code.