Dependency Parsing目前有两种做法:
(1) Transition-Based
(2) Graph-Based
构建树的过程中有三种解码算法:
(1) dynamic programming {Three new probabilistic models for dependency parsing: An exploration}
(2) maximum spanning tree {Online large-margin training of dependency parsers}
(3) greedy algorithm {Dependency parsing as head selection}
以后 PaperNotes 更新换到知乎啦:
https://zhuanlan.zhihu.com/p/98764503
比较好的解析:
https://blog.csdn.net/a609640147/article/details/93333374