News  >  Events

DTS Hackathon

The first DTS hackathon is organised by the DTS community and funded by the dhCenter UNIL-EPFL and the École Nationale des Chartes. The goal of this hackathon is to raise awareness about the DTS specifications, encourage their use and, ultimately, to improve the ecosystem of datasets and tools around DTS.


The hackathon will take place fully online between 27 September – 8 October 2021.

Two types of hacks will be proposed :

  1. data hacks, aimed at exposing new or already existing textual resources via a DTS-compliant API with the goal of enlarging the variety of domains, languages and periods covered by DTS. Participants proposing a data hack may be affiliated with the institution owning the data, but this is not strictly necessary (e.g. in case of open data).
  2. tool hacks, aimed at enlarging the offer of DTS-compatible tools by extending existing software or developing new ones. Ideas for tool hacks include:
  • development of DTS client libraries in any programming language (e.g., Javascript, Python, Go, Java, Ruby, etc.);
  • development of generic viewers for DTS texts collections;
  • extending existing annotation tools (e.g. Recogito, INCEpTION) to support DTS as a way of importing TEI documents to annotate;
  • adding integration with tools/libraries that perform linguistic and/or semantic enrichment of textual data such as NLTK , CLTK or DHTK;
  • integration with digital editing tools such as collation tools (e.g., CollateX) or publication tools (e.g., eXistDB / TEI Publisher, EFES, ediarum)

As far as code licensing is concerned, anything produced by hackathon participants is property of its author(s), yet it must be made available to the community under an open license (including non-commercial licenses) by the end of the hackathon.


The contributions developed during the hackathon will be evaluated by an international jury which will award prizes to winners in the following categories:

  1. best tool I (limited to tools that consume DTS-ready corpora, where consumption means enrichment, annotation, collation, etc.)
  2. best tool II (limited to tools for the publication of DTS-compliant corpora);
  3. largest DTS corpus
  4. most inclusive DTS corpus (i.e. a corpus of texts whose language, time period or genre is currently underrepresented in the DTS offer).

Category winners will be awarded a prize of their choice between the two following options:

  1. One Remarkable2 e-ink reader
  2. One Transkribus ScanTent + one SanDisk portable SSD drive (1TB)

Important dates

  • 24 September (midnight CEST): hackathon registration closes
  • 27 September: hackathon begins
  • 28 September (midnight CEST): deadline to communicate teams and hacks.
  • 8 October: hackathon ends


Participation to the hackathon is free, but participants are required to register using this form. Please note that:

  • Participants don’t need to have a team to register
  • Each team member must be individually registered for the hackathon
  • Hacks and hack ideas must be registered via a GH issue by using the “Hack Idea” template

To reach the organisers: email Matteo Romanello, or Pietro Liuzzo,

Hackathon schedule

The hackathon will run fully online, and mostly asynchronously, between September 27 and October 10, 2021.

  • 27 September, 17:00-18:00 (CET) on Zoom: Hackathon opening & pitch of hack ideas (plenary)
  • 28 September, 23:59 (CET): Team registration closes
  • 4 October, 17:00-18:00 (CET) on Zoom: Mid-hackathon check-in (optional)
  • 8 October, 17:00-18:30 (CET) on Zoom: Hackation closing & presentation of hack results with jury (plenary)

NB: Zoom details for the synchronous online sessions will be communicated to registered participants by email.

From: 27 Sep, 2021
To: 8 Oct, 2021
Organizer: Matteo Romanello (UNIL), Pietro Liuzzo (University of Hamburg)
Languages: English
The UNIL-EPFL dhCenter ceased its activities on December 31, 2022. The contents of this site, with the exception of our members' pages, are no longer updated. Thanks to all of you for having kept this space alive! More information