Abstract
In most of the dependency parsing studies, dependency relations within a sentence are often presented as a tree structure. Whilst the tree structure is sufficient to represent the surface relations, deep dependencies which may result to multi-headed relations require more general dependency structures, namely Directed Acyclic Graphs (DAGs). This study proposes a new dependency DAG parsing approach which uses a dynamic oracle within a shift-reduce transitionbased parsing framework. Although there is still room for improvement on performance with more feature engineering, we already obtain competitive performances compared to static oracles as a result of our initial experiments conducted on the ITU-METU-Sabanci Turkish Treebank (IMST).
| Original language | English |
|---|---|
| Title of host publication | ACL-IJCNLP 2015 - 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing, Proceedings of the Student Research Workshop |
| Publisher | Association for Computational Linguistics (ACL) |
| Pages | 22-27 |
| Number of pages | 6 |
| ISBN (Electronic) | 9781941643747 |
| DOIs | |
| Publication status | Published - 2015 |
| Event | 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing: Student Research Workshop, ACL-IJCNLP 2015 - Beijing, China Duration: 28 Jul 2015 → 28 Jul 2015 |
Publication series
| Name | ACL-IJCNLP 2015 - 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing, Proceedings of the Student Research Workshop |
|---|
Conference
| Conference | 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing: Student Research Workshop, ACL-IJCNLP 2015 |
|---|---|
| Country/Territory | China |
| City | Beijing |
| Period | 28/07/15 → 28/07/15 |
Bibliographical note
Publisher Copyright:© 2015 Association for Computational Linguistics.