这是一个自然语言作业的小项目,因为有其他事情要忙所以找一个大神帮着写一下,酬劳我不太清楚行情,可以详谈,只要做的好钱问题不大。具体的要求如下,还有一些参考资料和课程 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
这是一个专为移动设备优化的页面(即为了让你能够在 Google 搜索结果里秒开这个页面),如果你希望参与 V2EX 社区的讨论,你可以继续到 V2EX 上打开本讨论主题的完整版本。
V2EX 是创意工作者们的社区,是一个分享自己正在做的有趣事物、交流想法,可以遇见新朋友甚至新机会的地方。
V2EX is a community of developers, designers and creative people.