The Citation Parser is a system which will be able to correctly identify the various components in a citation or bibliographical reference. To do so, we require a large number of annotated citations as training data for our system.
We have chosen a number of labels to represent fields that are commonly found in references, and we would like you to match these labels to the "chunks of text" in a string of citation. Your input will then be used to expand the existing training data.
The labels and their descriptions are as follows. Please read these carefully in order to avoid any confusion over which label a certain area should be annotated as. You may want to visit http://isbndb.com/ for deciding on the appropriate tag. (See Important notes for help on how to make use of isbndb for your annotation)
| Label | Definition | Examples (in bold) |
| Author | Name of the author/s of the works cited, usually appearing as the first field of a citation | A. Cau, R. Kuiper, and W.-P. de Roever.
Formalising Dijkstra's development strategy within Stark's formalism.
In C. B. Jones, R. C. Shaw, and T. Denvir, editors, Proc. 5th. BCS-FACS
Refinement Workshop, 1992. |
| Title | Title of the citation. Note that there are 2 other labels "Booktitle" & "Journal" which are to be labeled separately. Almost all citations contains the field "Title" |
P. D. Alevizos. A linear time algorithm for labeling planar projections of polyhedra. IEEE/RSJ IROS '91 (Osaka, Japan), 1991. |
| Editor | Name of the editor/s of the works cited, usually appearing with keywords like "eds." or "(editor)" | E. Dantsin and A. Voronkov. Complexity of query answering in logic databases with complex values. In S. Adian and A. Nerode, editors, Logical Foundations of Computer Science. 4th International Symposium, LFCS'97, volume 1234, of Lecture Notes in Computer Science, pages 56-66, Yaroslavl, Russia, July 1997. |
| Booktitle | Title of the book cited, usually appearing in the form <Title> in <Booktitle> | T. Fahringer, R. Blasko, and H. Zima. Automatic performance
prediction to support parallelization of Fortran programs for massively
parallel systems. In Proceedings of the 1992 ACM International
Conference on Supercomputing, Washington, DC, July 1992. |
| Date | Date of the specific citation (the date the article was written), usually appearing within braces and after the author field | Bylander, T. (1992). Complexity results
for serial decomposability. In Proceedings of National Conference on Artificial
Intelligence, pp. 729-734. San Jose, CA. AAAI Press. |
| Journal | Title of the journal cited |
W. H. Enright. Improving the efficiency of matrix operations
in the numerical solution of stiff ordinary differential equations.
ACM Trans. Math. Softw., 4(2), 127-136, June 1978. |
| Volume | Volume number of a journal Usually comes in a single number or in the form _ ( _ ) note: issue number should also be annotated as "Volume" |
W. H. Enright. Improving the efficiency of matrix operations in the numerical solution of stiff ordinary differential equations. ACM Trans. Math. Softw., 4(2), 127-136, June 1978. |
| Tech | Name of the technical report cited. Usually contains the keywords "Technical Report" |
S. Hiranandani, K. Kennedy, C. Koelbel, U. Kremer, and C.
Tseng. An overview of the fortran d programming system. Technical
Report CRPC-TR91121, Dept of computer Science, Rice University,
1991. |
| Institution | Institution from which the article originated note: label Department as "institution" as well |
S. Hiranandani, K. Kennedy, C. Koelbel, U. Kremer, and C. Tseng. An overview of the fortran d programming system. Technical Report CRPC-TR91121, Dept of computer Science, Rice University, 1991. |
| Pages | Pages of the article cited
Contains keywords "pp.", "pages" or hyphens |
W. H. Enright. Improving the efficiency of matrix operations in the numerical solution of stiff ordinary differential equations. ACM Trans. Math. Softw., 4(2), 127-136, June 1978. Bylander, T. (1992). Complexity results for serial decomposability.
In Proceedings of National Conference on Artificial Intelligence,
pp. 729-734. San Jose, CA. AAAI Press. |
| Location | Location of the article cited | Bylander, T. (1992). Complexity results for serial decomposability. In Proceedings of National Conference on Artificial Intelligence, pp. 729-734. San Jose, CA. AAAI Press. |
| Publisher | Publisher Usually appears towards the end of the string of citation, before the location May contain keywords like "Press" |
R. S. Zemel, M. C. Mozer, and G. E. Hinton. TRAFFIC: Recognizing
objects using hierarchical reference frame transformations. In D. S.
Touretzky, editor, Neural Information Processing Systems, Vol. 2, pages
266-273. Morgan Kaufmann, San Mateo, CA, 1990. Serra, J. (1982). Image Analysis and Mathematical Morphology. Academic
Press, London. |
| Note | Additional comments or notes about the citation Could appear within braces |
Angrist, J., Imbens, G., & Rubin, D. (1995). Identification of causal effects using instrumental variables. Journal of the American Statistical Association, in press. J. Demmel, I. Dhillon, and H. Ren. On the correctness of parallel bisection
in floating point. ETNA, 3 116-149, 1995. (See also LAPACK Working
Note No.70). |
Enter your email address at the bottom of this page and click on the "Start" button. You will be shown a string of citation for annotation. Its article ID is stated at the top of the page.
Click on any word token to annotate the starting of a field to be annotated. You will only need to annotate the starting of a field.

Repeat the process by clicking on another word token which you think is
the starting of another field.
note: starting of a field usually comes just after full-stops or
commas

