Взвешенный разбор зависимостей

We formalize weighted dependency pars- ing as searching for maximum spanning trees (MSTs) in directed graphs. Using this representation, the parsing algorithm of Eisner (1996) is sufficient for search- ing …...