I am trying to implement a graph based dependency parser. Since I come from a computer engineering perspective, I have trouble finding the features.
Assuming that we have a (head,dependent) relation for (x,y), here are some features that I found to be helpful:
POS Tags of x&y
Direction of the relation(right or left)
Distance between words x and y
Word itself information(x&y themselves)
But I should enhance the accuracy of my parser and will appreciate any help.