Overview

Uppsala University is about to announce a PhD student position in Computational Linguistics. The official announcement will be issued in a few weeks with a deadline for applications some time in June, but interested candidates are encouraged to contact Joakim Nivre as soon as possible to discuss possible thesis projects.

We are looking for a PhD student to work on syntactic parsing within the Universal Dependencies framework. Universal Dependencies is an initiative to create cross-linguistically consistent treebank annotation for many languages, with the goal of facilitating multilingual parser development, cross-lingual learning, and parsing research from a language typology perspective. More information at: http://universaldependencies.github.io/docs/.

The computational linguistics group at Uppsala University is internationally recognized for research on multilingual systems, especially machine translation, and systems for grammatical analysis of text, in particular dependency-based parsing. Another focus area is digital humanities with projects on hand-written text recognition, historical text processing, and historical ciphers. The group has been involved in the development of a number of tools and resources, such as MaltParser (data-driven dependency parser), UPlug (toolbox for parallel corpus alignment), Swedish Treebank (syntactically annotated corpus), and OPUS (multilingual parallel corpus).

Company:

Uppsala University

Qualifications:

N/A

Tagged as: , , , , ,

About Uppsala University

Uppsala University is one of northern Europe's most highly ranked universities. Eight scientists at the university have been awarded the Nobel Prize. Uppsala University pursues research in a wide range of fields that helps us understand our society. Research that creates a better world and makes life easier for many people – research that brings new perspectives to the basic questions of science and at the same time knowledge that contributes to a sustainable environment, human health, and social development.