Miloš Stanojević's repositories
Fast-MST-Algorithm
Implementation of fast algorithms for Maximum Spanning Tree (MST) parsing that includes fast ArcMax+Reweighting+Tarjan algorithm for single-root dependency parsing.
grammarless-lcfrs
This is the parser from IWPT-2020 paper "Span-Based LCFRS-2 Parsing" by Stanojević and Steedman
MIT000
Language:HTML000