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.

  • Is the parser stochastic? – Atamiri May 9 '18 at 13:40
  • Yes, it is stochastic. – Tokugava May 9 '18 at 15:21

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.