MATE Deliverable D2.1
Proposed Structure of Coding
Book
Marion Klein (DFKI)
Introduction
The introduction part of the coding book should give overall information
on
-
the purpose the scheme is designed for
-
the kind of information that has to be labelled with regard to the scheme's
purpose
-
the theory the scheme is based on
For examples see chapter 1 of the Maptask
coding book, the DAMSL
coding book, or the Verbmobil
coding book.
Tagging Procedure
This section outlines general tagging restrictions covering
Decision Tree
A decision tree (e.g. the
Verbmobil decision tree) aims to give an overview of all possible tags
and how they are related to each other. Furthermore they ease the decision
task during the annotation process.
In addition to the decision tree regulations have to be provided how
to navigate through the tree (for examples see chapter 2 of the Maptask
and DAMSL
coding book, and chapter 4.2 of the Verbmobil
coding book). For each node there should be a question which states
the condition that has to be fulfilled in order to go to a lower layer
in the tree. If no further conditions holds the current node (or leaf)
in the tree represents the most appropriate tag.
Tag Set Definition
For more sophisticated and detailed information about a tag a tag set definition
is needed. It should be
-
mutual exclusive
-
unambiguous
-
easy to understand
-
easy to keep in mind
Example tag definitions are given in chapters 2.1 to 2.3 in the Maptask
coding book and in chapter 4.3 of the Verbmobil
coding book.
Examples
For each tag state a couple of example annotations. These examples should
present ordinary but also problematic and more difficult cases of annotation.
Explain briefly what the difficulties are - if there occur some (for examples
look at chapters 2.1 ot 2.3 in the Maptask
coding book and in chapter 4.3 of the Verbmobil
coding book).
Example Coding Books:
Last Modification: 17.3.1999 by Marion
Klein