← Back to papers
2017 CONLL CoNLL 2017

The parse is darc and full of errors: Universal dependency parsing with transition-based and graph-based algorithms

🐝 Cross-Pollinator — Artificial Intelligence, Computer Science, Computer Vision, Data Science & Analytics, Deep Learning, Healthcare & Medicine, Interdisciplinary, Knowledge & Reasoning, Machine Learning, Mathematics & Optimization, Natural Language Processing, Reinforcement Learning, Security & Privacy, Speech & Audio

Authors

Kuan Yu , Pavel Sofroniev , Erik Schill , Erhard Hinrichs

Topics

Natural Language Processing > Understanding > Parsing

Keywords

universal dependencies dependency parsing transition-based parsing graph-based parsing
Download PDF

Related papers

Neural Sequence-to-sequence Learning of Internal Word Structure 2017
An Automatic Approach for Document-level Topic Model Evaluation 2017
Robust Coreference Resolution and Entity Linking on Dialogues: Character Identification on TV Show Transcripts 2017
Knowledge Tracing in Sequential Learning of Inflected Vocabulary 2017
A Probabilistic Generative Grammar for Semantic Parsing 2017