Pair Annotation: adaption of pair programming to corpus

Download

law2012.pdf

Date

2012-7-12-13

Author

Demirşahin, Işın
Yalçınkaya, İhsan
Zeyrek Bozşahin, Deniz

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

84
views

20
downloads

This paper will introduce a procedure that we call pair annotation after pair programming. We describe initial annotation procedure of the TDB, followed by the inception of the pair annotation idea and how it came to be used in the Turkish Discourse Bank. We discuss the observed benefits and issues encountered during the process, and conclude by discussing the major benefit of pair annotation, namely higher inter-annotator agreement values.

URI

https://hdl.handle.net/11511/35967

Collections

Graduate School of Informatics, Conference / Seminar

Suggestions

OpenMETU
Core

Functional Mesh Model with Temporal Measurements for Brain Decoding Onal, Itir; Ozay, Mete; Yarman Vural, Fatoş Tunay (2015-08-29) We propose a method called Functional Mesh Model with Temporal Measurements (FMM-TM) to estimate a functional relationship among voxels using temporal data, and employ these relationships for brain decoding. For each sample, we measure Blood Oxygenation Level Dependent (BOLD) responses from each voxel, and construct a functional mesh around each voxel (called seed voxel) with its nearest neighbors selected using distance metrics namely Pearson correlation, cosine similarity and Euclidean distance. Then, we ...
VERTEX PARTITIONING BASED MULTIPLE DESCRIPTION CODING OF 3D DYNAMIC MESHES Bici, M. Oguz; Stefanoski, Nikolce; Akar, Gözde (2009-05-06) In this paper, we propose a Multiple Description Coding (MDC) method for reliable transmission of compressed time consistent 3D dynamic meshes. It trades off reconstruction quality for error resilience to provide the best expected reconstruction of 3D mesh sequence at the decoder side. The method is based on partitioning the mesh vertices into two sets and encoding each set independently by a 3D dynamic mesh coder. The encoded independent bitstreams or so-called descriptions are transmitted independently. T...
Remote estimation of the Wiener process over a channel with random delay Sun, Yin; Polyanskiy, Yury; Uysal, Elif (2017-06-25) In this paper, we consider a problem of sampling a Wiener process, with samples forwarded to a remote estimator via a channel that consists of a queue with random delay. The estimator reconstructs a real-time estimate of the signal from causally received samples. Motivated by recent research on age of-information, we study the optimal sampling strategy that minimizes the mean square estimation error subject to a sampling frequency constraint. We prove that the optimal sampling strategy is a threshold policy...
BenchMetrics: a systematic benchmarking method for binary classification performance metrics Canbek, Gurol; Taşkaya Temizel, Tuğba; SAĞIROĞLU, ŞEREF (2021-08-01) This paper proposes a systematic benchmarking method called BenchMetrics to analyze and compare the robustness of binary classification performance metrics based on the confusion matrix for a crisp classifier. BenchMetrics, introducing new concepts such as meta-metrics (metrics about metrics) and metric space, has been tested on fifteen well-known metrics including balanced accuracy, normalized mutual information, Cohen's Kappa, and Matthews correlation coefficient (MCC), along with two recently proposed me...
Similarity matrix framework for data from union of subspaces Aldroubi, Akram; Sekmen, Ali; Koku, Ahmet Buğra; Cakmak, Ahmet Faruk (2018-09-01) This paper presents a framework for finding similarity matrices for the segmentation of data W = [w(1)...w(N)] subset of R-D drawn from a union U = boolean OR(M)(i=1) S-i, of independent subspaces {S-i}(i=1)(M), of dimensions {d(i)}(i=1)(M). It is shown that any factorization of W = BP, where columns of B form a basis for data W and they also come from U, can be used to produce a similarity matrix Xi w. In other words, Xi w(i, j) not equal 0, when the columns w(i) and w(j) of W come from the same subspace, ...

Citation Formats

I. Demirşahin, İ. Yalçınkaya, and D. Zeyrek Bozşahin, “Pair Annotation: adaption of pair programming to corpus,” 2012, p. 31, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/35967.