Search papers, labs, and topics across Lattice.
Julius-Maximilians-Universität Würzburg
1
0
1
A 13-parameter statistical count model with Kneser-Ney smoothing outperforms deep temporal graph networks across multiple standard benchmarks without learning a single node embedding.