Trees  Indices  Help 



Data structures for dependency graphs.
Author: Mark GranrothWilding <mark.granrothwilding@ed.ac.uk>


DependencyGraph Data structure to represent dependency graphs. 

MaltTabReadError 











__package__ = None hash(x) 

Reads in data in the MaltTAB format, as used by the Malt Parser, and returns a list of dependency graphs. A error will be raised if the input is in twocolumn format, because you can't build a dependency graph from that.
See Also: http://w3.msi.vxu.se/~nivre/research/MaltXML.html 
Produces the alignment between the nodes of the two dependency graphs that maximizes the shared dependencies. Returns a list of aligned pairs of node indices, using

Given a list of pairs of aligned nodes, as returned by optimal_node_alignment, produces the dependency graph that contains only the shared dependencies. The node indices do not, of course, correspond to those in the input graphs, so we also return a mapping from the node indices in the common graph to those in each of the other graphs. 
Trees  Indices  Help 


Generated by Epydoc 3.0.1 on Mon Nov 26 16:04:55 2012  http://epydoc.sourceforge.net 