SOTAVerified

Text Complexity DE Challenge 2022 Submission Description: Pairwise Regression for Complexity Prediction

2022-09-01GermEval 2022Unverified0· sign in to hype

Leander Girrbach

Unverified — Be the first to reproduce this paper.

Reproduce

Abstract

This paper describes our submission to the Text Complexity DE Challenge 2022 (Mohtaj et al., 2022). We evaluate a pairwise regression model that predicts the relative difference in complexity of two sentences, instead of predicting a complexity score from a single sentence. In consequence, the model returns samples of scores (as many as there are training sentences) instead of a point estimate. Due to an error in the submission, test set results are unavailable. However, we show by cross-validation that pairwise regression does not improve performance over standard regression models using sentence embeddings taken from pretrained language models as input. Furthermore, we do not find the distribution standard deviations to reflect differences in “uncertainty” of the model predictions in an useful way.

Tasks

Reproductions