activity
19942026
most citedReadability-based Sentence Ranking for Evaluating Text Simplification

19 citations · 56 across the 9 of their papers we have counts for

collaborators

9 papers

cs.CY2026

The Future of Feedback: How Can AI Help Transform Feedback to Be More Engaging, Effective, and Scalable?

Jennifer Meyer, Olaf Köller, Thorben Jansen +33

With digital learning environments becoming more prevalent, the ease with which generative AI enables the scalable production of real-time, automated feedback holds the potential t…

cs.CL2025

Grammar Control in Dialogue Response Generation for Language Learning Chatbots

Dominik Glandorf, Peng Cui, Detmar Meurers +1

Chatbots based on large language models offer cheap conversation practice opportunities for language learners. However, they are hard to control for linguistic forms that correspon…

cs.CL2020

Employing distributional semantics to organize task-focused vocabulary learning

Haemanth Santhi Ponnusamy, Detmar Meurers

How can a learner systematically prepare for reading a book they are interested in? In this paper,we explore how computational linguistic methods such as distributional semantics,…

cs.CL2016★ 19 cited

Readability-based Sentence Ranking for Evaluating Text Simplification

Sowmya Vajjala, Detmar Meurers

We propose a new method for evaluating the readability of simplified sentences through pair-wise ranking. The validity of the method is established through in-corpus and cross-corp…

cmp-lg1996★ 8 cited

The importance of being lazy -- using lazy evaluation to process queries to HPSG grammars

Thilo Götz, Walt Detmar Meurers

Linguistic theories formulated in the architecture of {\sc hpsg} can be very precise and explicit since {\sc hpsg} provides a formally well-defined setup. However, when querying a…

cmp-lg1996★ 6 cited

Off-line Constraint Propagation for Efficient HPSG Processing

Walt Detmar Meurers, Guido Minnen

We investigate the use of a technique developed in the constraint programming community called constraint propagation to automatically make a HPSG theory more specific at those pla…

cmp-lg1995★ 6 cited

Compiling HPSG type constraints into definite clause programs

Thilo Goetz, Walt Detmar Meurers

We present a new approach to HPSG processing: compiling HPSG grammars expressed as type constraints into definite clause programs. This provides a clear and computationally useful…

cmp-lg1995★ 8 cited

A Computational Treatment of HPSG Lexical Rules as Covariation in Lexical Entries

Walt Detmar Meurers, Guido Minnen

We describe a compiler which translates a set of HPSG lexical rules and their interaction into definite relations used to constrain lexical entries. The compiler ensures automatic…

cmp-lg1994★ 9 cited

On Implementing an HPSG theory -- Aspects of the logical architecture, the formalization, and the implementation of head-driven phrase structure grammars

Walt Detmar Meurers

The paper presents some aspects involved in the formalization and implementation of HPSG theories. As basis, the logical setups of Carpenter (1992) and King (1989, 1994) are briefl…