The Persian Dependency Treebank Made Universal

2020/09/21 by Mohammad Sadegh Rasooli, Rasooli, Mohammad Sadegh, Pegah Safari +5
Computer Science · #Algorithms and Data Compression #Computation and Language (cs.CL) #FOS: Computer and information sciences #Natural Language Processing Techniques #Semantic Web and Ontologies

paper · pdf · doi:10.48550/arxiv.2009.10205

openalex publication_date 2020/09/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We describe an automatic method for converting the Persian Dependency Treebank (Rasooli et al, 2013) to Universal Dependencies. This treebank contains 29107 sentences. Our experiments along with manual linguistic analysis show that our data is more compatible with Universal Dependencies than the Uppsala Persian Universal Dependency Treebank (Seraji et al., 2016), and is larger in size and more diverse in vocabulary. Our data brings in a labeled attachment F-score of 85.2 in supervised parsing. Our delexicalized Persian-to-English parser transfer experiments show that a parsing model trained on our data is ~2% absolutely more accurate than that of Seraji et al. (2016) in terms of labeled attachment score.

Citations

• Yara Parser: A Fast and Accurate Dependency Parser
• Beheshti-NER: Persian Named Entity Recognition Using BERT

Related

• Informal Persian Universal Dependency Treebank
• Urdu Dependency Parsing and Treebank Development: A Syntactic and Morphological Perspective
• 82 Treebanks, 34 Models: Universal Dependency Parsing with\n Multi-Treebank Models
• Thai Universal Dependency Treebank
• Cross-Lingual Adaptation Using Universal Dependencies