From Constituency to UD-Style Dependency: Building the First Conversion Tool of Turkish
By Aslı Kuzgun, Oğuz Yıldız, Neslihan Cesur, Büsra Marsan, A. B. Yenice, Ezgi Sanıyar, O. Kuyrukçu, Bilge Nas Arıcan, Olcay Taner Yildiz. Recent Advances in Natural Language Processing, 2021
3 citations recorded by the source corpus.
This paper deliberates on the process of building the first constituency-to-dependency conversion tool of Turkish. The starting point of this work is a previous study in which 10,000 phrase structure trees were manually transformed into Turkish from the original PennTreebank corpus. Within the scope of this project, these Turkish phrase structure trees were automatically converted into UD-style dependency structures, using both a rule-based algorithm and a machine learning algorithm specific to the requirements of the Turkish language. The results of both algorithms were compared and the machine learning approach proved to be more accurate than the rule-based algorithm. The output was revised by a team of linguists. The refined versions were taken as gold standard annotations for the evaluation of the algorithms. In addition to its contribution to the UD Project with a large dataset of 10,000 Turkish dependency trees, this project also fulfills the important gap of a Turkish conversion tool, enabling the quick compilation of dependency corpora which can be used for the training of better dependency parsers.
Subfields: Language and Linguistics, Natural Language Processing, Computational Linguistics & Semantics
View Paper: https://doi.org/10.26615/978-954-452-072-4_087
Citations in the corpus
- Parallel Trees: a novel resource with aligned dependency and constituency syntactic representations (2025, unknown): “3 https:// www. ling. upenn. edu/ ppche/ ppche-relea se-2016/ annot ation Turkish For Turkish, we started from the Turkish Penn Constituency Treebank, consisting of a collection of 10,000 sentences, each with a maximum length of 15 tokens (Kuzgun et al., 2021).”
- Tokenisation of Turkic Copula Constructions in Universal Dependencies (2026, unknown): “…lemma=y Turkish-GB Çöltekin (2015) subtoken, lemma=i subtoken, lemma=i Turkish-Kenet Kuzgun et al. (2021b) not tokenised not tokenised Turkish-Penn Kuzgun et al. (2021a) not tokenised not tokenised Turkish-PUD Zeman et al. (2017) subtoken, lemma=i,_ subtoken, lemma=i Turkish-TueCL Akhundjanova et…”
- Expanding the Universal Dependencies Ancient Hebrew Treebank with Constituency Data (unknown): “This step is substantially simpler than what often appears in other conversion projects, since it only requires a tree traversal to collect all the relations without needing a set of heuristics to identify the heads at each level (Arnardóttir et al., 2020; Chun et al., 2018; Kuzgun et al., 2021).”