Graph explorer

Efficient EUD Parsing

We present the system submission from the FASTPARSE team for the EUD Shared Task at IWPT 2020. We engaged with the task by focusing on efficiency. For this we considered training costs and inference efficiency. Our models are a combination of distilled neural dependency parsers and a rule-based system that projects UD trees into EUD graphs. We obtained an average ELAS of 74.04 for our official submission, ranking 4th overall.

5 nodes5 linksoverview previewEfficient EUD Parsing
5 nodes5 links
Efficient EUD Parsing5 visible / 5 total nodes / 8 links
Co-authorshipCo-authorshipCo-authorshipAuthorshipWorks onAuthorshipAuthorshipTopic signalWEfficient EUD Parsingpreprint / 2020AMathieu DehouckResearcherAMark AndersonResearcherACarlos Gómez-RodríguezResearcherTComputation and Language14115 works
PaperSignal 104 links

Efficient EUD Parsing

preprint / 2020

Open