3 papers
cs.CL2021
Maximum Spanning Trees Are Invariant to Temperature Scaling in Graph-based Dependency Parsing
Stefan Grünewald
Modern graph-based syntactic dependency parsers operate by predicting, for each token within a sentence, a probability distribution over its possible syntactic heads (i.e., all oth…
cs.CL2020
Applying Occam's Razor to Transformer-Based Dependency Parsing: What Works, What Doesn't, and What is Really Necessary
Stefan Grünewald, Annemarie Friedrich, Jonas Kuhn
The introduction of pre-trained transformer-based contextualized word embeddings has led to considerable improvements in the accuracy of graph-based parsers for frameworks such as…
cs.CL2018
Generalized chart constraints for efficient PCFG and TAG parsing
Stefan Grünewald, Sophie Henning, Alexander Koller
Chart constraints, which specify at which string positions a constituent may begin or end, have been shown to speed up chart parsers for PCFGs. We generalize chart constraints to m…