1. On the regularity and learnability of ordered DAG languages;Björklund,2017
2. Between a rock and a hard place – uniform parsing for hyperedge replacement DAG grammars;Björklund,2016
3. The impact of state merging on predictive accuracy in probabilistic tree automata: Dietze's conjecture revisited;Björklund,2023
4. Regular tree and regular hedge languages over unranked alphabets;Bruggemann-Klein,2001
5. Head-driven statistical models for natural language parsing;Collins;Comput. Linguist.,2003