Search Results for author: Martin Riedl

Found 26 papers, 2 papers with code

Clustering-Based Article Identification in Historical Newspapers

1 code implementation WS 2019 Martin Riedl, Daniela Betz, Sebastian Pad{\'o}

This article focuses on the problem of identifying articles and recovering their text from within and across newspaper pages when OCR just delivers one text file per page.

Frame Optical Character Recognition +1

A Named Entity Recognition Shootout for German

no code implementations ACL 2018 Martin Riedl, Sebastian Pad{\'o}

We ask how to practically build a model for German named entity recognition (NER) that performs at the state of the art for both contemporary and historical texts, i. e., a big-data and a small-data scenario.

Entity Linking Named Entity Recognition +5

Document-based Recommender System for Job Postings using Dense Representations

no code implementations NAACL 2018 Ahmed Elsafty, Martin Riedl, Chris Biemann

Detecting the similarity between job advertisements is important for job recommendation systems as it allows, for example, the application of item-to-item based recommendations.

Document Embedding Recommendation Systems

That's sick dude!: Automatic identification of word sense change across different timescales

no code implementations ACL 2014 Sunny Mitra, Ritwik Mitra, Martin Riedl, Chris Biemann, Animesh Mukherjee, Pawan Goyal

In this paper, we propose an unsupervised method to identify noun sense changes based on rigorous analysis of time-varying text data available in the form of millions of digitized books.

Word Sense Disambiguation

Distributed Distributional Similarities of Google Books Over the Centuries

no code implementations LREC 2014 Martin Riedl, Richard Steuer, Chris Biemann

This paper introduces a distributional thesaurus and sense clusters computed on the complete Google Syntactic N-grams, which is extracted from Google Books, a very large corpus of digitized books published between 1520 and 2008.

Graph Clustering

Cannot find the paper you are looking for? You can Submit a new open access paper.