"A Richer-but-Smarter Shortest Dependency Path with Attentive Augmentation ..."

Duy-Cat Can et al. (2019)

Details and statistics

DOI: 10.18653/V1/N19-1298

access: open

type: Conference or Workshop Paper

metadata version: 2021-08-06

a service of  Schloss Dagstuhl - Leibniz Center for Informatics