I made some changes to graph.py. In combination with the main program it is now
possible to compute the score of an alignment + sentence in which there are no unaligned words on the source side and no multiple aligned words on the target side.
The class SetPermutation I added is a new class that represents alignments, I am
working on a new way of computing allowed spans using the shift-reduce algorithm
as presented in Chang and Gildea. Currently there are a few bugs, so the outputed spans are not completely correct, I will fix that later.
The program get_deprels deals with dependency relations.