In graph-based parsing finding the max spanning tree given sentence (S) and graph (G) a spanning tree over a G is a subset of G that is a tree covering all the vertices in G, thus a spanning tree over G that starts from the root is a valid parse of S. Resultingly, the highest score is the maximum spanning tree.

Max spanning tree

Graph based parsers score entire trees, and can produce non-projective trees. The graph based algorithm focuses on two problems, assigning a score to each edge, and finding the best parse tree given the scores of all potential edges.

University of Texas at San Antonio

Dependency Parsing is fundamentally based on the dependency grammars in terms of grammar formalisms. In these formalisms, phrasal constituents and phrase-structure rules do not play a direct role as Constituent Parsing. Instead, the syntactic structure of a sentence is describe solely in terms of the words in a sentence and an associated set of directed binary grammatical relations that hold among the words.

Dependency Parsing

An on-going but a helpful book resource about NLP
https://web.stanford.edu/~jurafsky/slp3/

Speech and Language Processing (3rd ed. draft) 

illustrated with directed, labeled arcs from heads to dependents.
It is called typed dependency structure because the labels are drawn from a fixed inventory of grammatical relations.
Note that it includes a root node that explicitly marks the root of the tree, the head of the entire structure.

Example of typed dependency structure

A major advantage is that It can deal with languages that are morphologically rich and have a relatively free word order.
Moreover, dependency-based approach enables the head-dependent relations to provide an approximation to the semantic relationship between predicates and their arguments which makes them directly useful for many applications such as coreference resolution, question answering and information extraction. 

Advantage of Dependency Parsing

Selected dependency relations from the Universal Dependency set

Examples of core Universal Dependency relations

Simple application of UD scheme on the sentence

In transition-Based Dependency Parsing, the oracle can tell which transition is appropriate to make. It can be trained by supervised machine learning.
The oracle takes the configuration of the stack and the word list of one sentence as its input and predicts appropriate transition. 


Oracle


Dependency treebanks have been created using such approaches —having human annotators directly generate dependency structures for a given corpus, or using automatic parsers to provide an initial parse and then having annotators hand correct the parses. We can also use a deterministic process to translate existing constituent-based treebanks into dependency trees through the use of head rules.

Treebanks

A dependency structure can be represented as a directed graph G=(V,A), consisting of a set of vertices V, and a set of ordered pairs of vertices A, which we’ll call arcs. There are also further constraints placed on dependency structures.

Dependency Formalisms

As with phrase structure-based parsing, the evaluation of dependency parsers proceeds by measuring how well they work on a test set. An obvious metric would be exact match (EM) — how many sentences are parsed correctly; however, most of the times this metric is too pessimistic. Alternative methods are:
- Labelled attachment score (LAS), which looks at the proper assignment of a word to its head along with the correct dependency relation.
- Unlabelled attachment score (UAS), which looks at the correctness of the assigned head, ignoring the dependency relation.
- Label accuracy score (LS), which looks at tokens with correct labels, ignoring where the relations are coming from.

Learn Before

Related

Learn After

Learn After

Related