Aug 2026· Applied Sciences· 0 citations· 13 references
TL;DR
A lightweight and interpretable author verification method that relies solely on hand-crafted stylistic features and classical machine learning classifiers, requiring no GPU acceleration, which achieves competitive verification performance with significantly improved training and inference efficiency.
Abstract
Author verification is a fundamental task in natural language processing with potential applications in digital forensics, copyright dispute resolution, and social media account linkage. While existing deep pre-trained models achieve high accuracy, they incur substantial computational costs, high inference latency, and poor interpretability, limiting their deployment in resource-constrained environments. To address this gap, a lightweight and interpretable author verification method is proposed that relies solely on hand-crafted stylistic features and classical machine learning classifiers, requiring no GPU acceleration. Specifically, three complementary feature sets are extracted per text: 37 punctuation features, 22 text-style features, and an 800-dimensional character-level TF-IDF vector. For each text pair, we compute the absolute difference and element-wise product for each feature group separately, and we also concatenate all resulting vectors to form the final classification representation. On a public review dataset under a strict author-level split, the proposed method achieves competitive verification performance with significantly improved training and inference efficiency. Notably, while the lightweight neural architectures evaluated in this study yield marginal accuracy gains, they incur substantially longer inference and training times, validating the efficiency-performance trade-off of our approach. Ablation studies confirm the contribution of each feature group, with text statistics being the most influential. The proposed method offers an efficient, transparent, and easily deployable solution for author verification in resource-limited settings and provides empirical evidence for integrating traditional stylistic features with lightweight models.
A hybrid approach that combines contextual embeddings from RoBERTa with handcrafted stylometric features to capture both high-level semantic patterns and low-level stylistic cues enables robust generalization across heterogeneous text types is adopted.
B. van Leeuwen, S. Bhulai, R. D. van der Mei· 0 citations
LiteLLM is introduced, a lightweight transformer architecture explicitly optimized for short-text scenarios that delivers competitive performance, fast convergence, and competitive cross-domain performance across heterogeneous short-text settings.
Hussein Ala’a Alkaabi, Fuqdan A. Al-Ibraheemi, Ali kadhim Jasim· Neural computing & applicati...· 0 citations
DTRNet is proposed, a dual Text-Radical decoding framework for line-level faked character detection and IDS-Guided Confidence Adjustment (IGCA) is introduced to refine text predictions using structural evidence during inference to preserve character-structural evidence independent of contextual inference.
The findings demonstrate the effectiveness of combining multilingual semantic information with explicit linguistic and contextual characteristics for identifying deceptive reviews in Roman Marathi code-mixed environments and establish an initial benchmark for fake review detection in this low-resource setting.
Swapnil S. Nehar, R. Keole, Pravin P. Karde· International journal of com...· 0 citations
CHiPS, a lightweight character-level authorship attribution method for Romanian texts, requires no tokenization, syntactic analysis, pretrained language model, or transformer fine-tuning, and it avoids character $n$-gram features with $n \geq 2$ in the histogram component.
AuthBench is introduced, a large-scale multilingual benchmark for authorship representation that is designed to make this evaluation broad, standardized, and realistic, and position it not only as a new benchmark, but as a diagnostic resource for studying when and why authorship representations succeed or fail.
Mao-Xun Huang, Zhen-Xing Zhang, C. Cardie· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.