3 papers
cs.FL2026
Compiling Rewrite Rules to Finite-State Transducers with the Worsening Trick
Mans Hulden, Michael Ginn
Finite-state transducers (FSTs) are essential for modeling string rewriting in computational linguistics and natural language processing (NLP), particularly for phonological and mo…
cs.CL2025
Is linguistically-motivated data augmentation worth it?
Ray Groshan, Michael Ginn, Alexis Palmer
Data augmentation, a widely-employed technique for addressing data scarcity, involves generating synthetic data examples which are then used to augment available training data. Res…
cs.CL2024
Tree Transformers are an Ineffective Model of Syntactic Constituency
Michael Ginn
Linguists have long held that a key aspect of natural language syntax is the recursive organization of language units into constituent structures, and research has suggested that c…