有偿找人帮写一个自然语言处理方面的小作业

这是一个自然语言作业的小项目，因为有其他事情要忙所以找一个大神帮着写一下，酬劳我不太清楚行情，可以详谈，只要做的好钱问题不大。具体的要求如下，还有一些参考资料和课程 ppt 我可以都打包给你

We've talked about lexicalized CFG in the class. We know that the dependency grammar can be seen as lexicalized CFG. And CFG can be converted into lexicalized CFG by detecting head word of each phrase. The slides (ps2dg.pdf) illustrate an example of converting phrase structure to dependency structure. The key point is to detect head word of each phrase. This is usually done by some hand-crafted rules, called head rules. For example, in the CFG rule VP -> V + NP, the head word comes from V instead of NP. You should write some head rules as well as a program for converting a Chinese TreeBank (CTB) tree into an unlabeled dependency tree. "unlabeled" means only the tree structures are needed, not the dependency relationships between the head and modifier (such as subject and object).

联系方式：qq 2862581151