首页/论文/2002.10416

arXiv 2002.104162020-02cs.CL

Resources for Turkish Dependency Parsing: Introducing the BOUN Treebank and the BoAT Annotation Tool

Boğaziçi University（海峡大学）；Bogazici University（海峡大学）

Utku Türk, Furkan Atmaca, Şaziye Betül Özateş, Gözde Berk, Seyyit Talha Bedir, Abdullatif Köksal, Balkız Öztürk Başaran, Tunga Güngör, Arzucan Özgür

备注：: Language Resource and Evaluation

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

英文摘要相关论文

英文摘要：

In this paper, we introduce the resources that we developed for Turkish dependency parsing, which include a novel manually annotated treebank (BOUN Treebank), along with the guidelines we adopted, and a new annotation tool (BoAT). The manual annotation process we employed was shaped and implemented by a team of four linguists and five Natural Language Processing (NLP) specialists. Decisions regarding the annotation of the BOUN Treebank were made in line with the Universal Dependencies (UD) framework as well as our recent efforts for unifying the Turkish UD treebanks through manual re-annotation. To the best of our knowledge, BOUN Treebank is the largest Turkish treebank. It contains a total of 9,761 sentences from various topics including biographical texts, national newspapers, instructional texts, popular culture articles, and essays. In addition, we report the parsing results of a state-of-the-art dependency parser obtained over the BOUN Treebank as well as two other treebanks in Turkish. Our results demonstrate that the unification of the Turkish annotation scheme and the introduction of a more comprehensive treebank lead to improved performance with regard to dependency parsing.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

BoAT v2 -- 一个面向黏着语系的基于Web的依存标注工具

BoAT v2 -- A Web-Based Dependency Annotation Tool with Focus on Agglutinative Languages

Boğaziçi University（博阿齐奇大学）

针对黏着语依存标注工具不足，BoAT v2作为多用户Web工具，以提升标注速度、用户体验和协作，并提供开源API，助力树库构建。

2024-02-03cs.CL

Enhancements to the BOUN Treebank Reflecting the Agglutinative Nature of Turkish

Boğaziçi University（海峡大学）

In this study, we aim to offer linguistically motivated solutions to resolve the issues of the lack of representation of null morphemes, highly productive derivational processes, and syncretic morphemes of Turkish in the BOUN Treebank without diverging from the Universal Dependencies framework. In order to tackle these issues, new annotation conventions were introduced by splitting certain lemmas and employing the MISC (miscellaneous) tab in the UD framework to denote derivation. Representational capabilities of the re-annotated treebank were tested on a LSTM-based dependency parser and an upd…

2022-07-24cs.CL

Linear-Time Constituency Parsing with RNNs and Dynamic Programming

Recently, span-based constituency parsing has achieved competitive accuracies with extremely simple models by using bidirectional RNNs to model "spans". However, the minimal span parser of Stern et al (2017a) which holds the current state of the art accuracy is a chart parser running in cubic time, $O(n^3)$, which is too slow for longer sentences and for applications beyond sentence boundaries such as end-to-end discourse parsing and joint sentence boundary detection and parsing. We propose a linear-time constituency parser with RNNs and dynamic programming using graph-structured stack and bea…

2018-05-21cs.CL

解析中文分词中的边界问题

Parsing Through Boundaries in Chinese Word Segmentation

The Chinese University of Hong Kong, Hong Kong（香港中文大学）；University College London, United Kingdom（伦敦大学学院）；The University of British Columbia, Canada（不列颠哥伦比亚大学）

本文以中文GSD树库为对象，研究不同分词边界方案对依存句法结构的影响，并开发交互式可视化工具以支持对比分析。

2025-07-04cs.CL

Contextual Semantic Parsing using Crowdsourced Spatial Descriptions

Institute for Artificial Intelligence, University of Leeds（利兹大学人工智能研究所）

We describe a contextual parser for the Robot Commands Treebank, a new crowdsourced resource. In contrast to previous semantic parsers that select the most-probable parse, we consider the different problem of parsing using additional situational context to disambiguate between different readings of a sentence. We show that multiple semantic analyses can be searched using dynamic programming via interaction with a spatial planner, to guide the parsing process. We are able to parse sentences in near linear-time by ruling out analyses early on that are incompatible with spatial context. We report…

2014-05-01cs.CL

通过建模隐式词内结构的中文字符级依存句法分析

Character-Level Chinese Dependency Parsing via Modeling Latent Intra-Word Structure

School of Computer Science and Technology（计算机科学与技术学院）；Soochow University（苏州大学）

本文提出通过建模词内隐式结构实现中文字符级依存句法分析，并用受约束的Eisner算法保证字符级树兼容性，在中文树库上优于流水线框架和已有联合模型。

2024-06-06cs.CL

更多相关论文收起更多论文

For the Purpose of Curry: A UD Treebank for Ashokan Prakrit

San Mateo High School（圣马特奥高中）；Georgetown University（乔治城大学）

We present the first linguistically annotated treebank of Ashokan Prakrit, an early Middle Indo-Aryan dialect continuum attested through Emperor Ashoka Maurya's 3rd century BCE rock and pillar edicts. For annotation, we used the multilingual Universal Dependencies (UD) formalism, following recent UD work on Sanskrit and other Indo-Aryan languages. We touch on some interesting linguistic features that posed issues in annotation: regnal names and other nominal compounds, "proto-ergative" participial constructions, and possible grammaticalizations evidenced by sandhi (phonological assimilation ac…

2021-12-11cs.CL

Efficient Constituency Parsing by Pointing

Nanyang Technological University（南洋理工大学）；Salesforce Research Asia（Salesforce亚洲研究院）；Institute for Infocomm Research, A-STAR（A*STAR资讯通信研究院）

We propose a novel constituency parsing model that casts the parsing problem into a series of pointing tasks. Specifically, our model estimates the likelihood of a span being a legitimate tree constituent via the pointing score corresponding to the boundary words of the span. Our parsing model supports efficient top-down decoding and our learning objective is able to enforce structural consistency without resorting to the expensive CKY inference. The experiments on the standard English Penn Treebank parsing task show that our method achieves 92.78 F1 without using pre-trained models, which is …

2020-06-24cs.CLcs.LG

认识 UD_Czech-PDTC：一个大规模且体裁丰富的通用依存树库

Meet UD_Czech-PDTC: A Large and Genre-Rich Treebank in Universal Dependencies

Charles University, Faculty of Mathematics and Physics（查理大学数学与物理系）；Institute of Formal and Applied Linguistics（形式与应用语言学研究所）

本文介绍将捷克语PDT-C树库转换为通用依存格式，解决两种标注方案在依存结构拓扑、词性和关系类型粒度上的差异，并展示转换方法。

2026-06-24cs.CL

The Impact of Edge Displacement Vaserstein Distance on UD Parsing Performance

Universidade da Coruña（拉科鲁尼亚大学）

We contribute to the discussion on parsing performance in NLP by introducing a measurement that evaluates the differences between the distributions of edge displacement (the directed distance of edges) seen in training and test data. We hypothesize that this measurement will be related to differences observed in parsing performance across treebanks. We motivate this by building upon previous work and then attempt to falsify this hypothesis by using a number of statistical methods. We establish that there is a statistical correlation between this measurement and parsing performance even when co…

2022-09-15cs.CL

Transition-based Bubble Parsing: Improvements on Coordination Structure Prediction

Cornell University（康奈尔大学）

We propose a transition-based bubble parser to perform coordination structure identification and dependency-based syntactic analysis simultaneously. Bubble representations were proposed in the formal linguistics literature decades ago; they enhance dependency trees by encoding coordination boundaries and internal relationships within coordination structures explicitly. In this paper, we introduce a transition system and neural models for parsing these bubble-enhanced structures. Experimental results on the English Penn Treebank and the English GENIA corpus show that our parsers beat previous s…

2021-07-14cs.CL

构建历史土耳其语自然语言处理的基础：资源与模型

Building Foundations for Natural Language Processing of Historical Turkish: Resources and Models

Saarland University（萨尔兰大学）；Medeniyet University（文明大学）

本文提出历史土耳其语NLP的基础资源和模型，包括首个命名实体识别数据集HisTR和首个通用依赖树库OTA-BOUN，以及基于Transformer的模型，提升了历史土耳其语的计算分析能力。

2026-03-27cs.CL