Tag
This paper argues that the loanword-vs-switch annotation boundary, rather than the choice of model, drives Kazakh-Russian code-switching identification. The authors present a document-level gold LID dataset with an explicit annotation rule and show that naive heuristics and off-the-shelf LID tools fail to distinguish integrated borrowings from genuine code-switches.
Introduces DE-NER, a dialogue elicitation framework for zero-shot named entity recognition that uses self-play between questioner and roleplayer LLMs to clarify entity boundaries, achieving an average 3.75% F1 improvement over baselines.
The paper presents a methodology for building a large-scale Russian dataset from social media texts to detect presuicidal and anti-suicidal signals, including annotation guidelines and baseline classification experiments.
This study applies computational linguistics and supervised machine learning to predict early-stage startup exits from textual descriptors alone, finding that founder narratives carry predictive signal and introducing a quantifiable Hyping Score.
Introduces DataSpace, a benchmark for evaluating data agents on verifiable tabular analytics over heterogeneous workspaces, containing 410 cross-language tasks and 7,439 artifacts. Current frontier models achieve only 66.34% accuracy, indicating headroom.
ChronoLens is a framework using multilingual language models and crosscoders to measure historical language change across linguistic levels in 44.98 million documents from five parliamentary traditions (1803–2026), showing that change magnitude and direction vary across languages and time.
A developer deep dive into an NLP-based grocery categorization tool, covering input lexing, stemming, and a unigram database approach to classify products into categories.
Taranis AI is an open-source OSINT tool that uses AI and NLP to gather, enrich, and structure unstructured news from multiple sources into publishable intelligence reports.
This paper studies cross-lingual transfer for machine translation among five Turkic languages using pairwise transfer matrices with mT5, finding that transfer is strongest between closely related pairs and that Latinization helps in script-mismatched settings.
This paper benchmarks six frontier LLMs on coding crash attributes from police crash narratives against an official fatal-crash database, finding that while GPT-5.5 High leads among LLMs, simple baselines rival or beat LLM performance and attribute-specific differences outweigh model differences.
This paper introduces experiential intertextuality detection, using annotation-free methods including zero-shot LLM scoring to identify shared experiential echoes across French migration narratives from different routes.
M3-DuplexBench is a new multi-turn, multilingual, multidomain benchmark for evaluating full-duplex spoken dialogue systems, supporting English and Japanese across casual conversation and question answering domains.
This paper presents a computational framework for automatically compiling collected commentaries on classical Chinese texts, preserving contextual dependencies of inline notes via prompt chaining and cross-source clustering.
Presents TELLER, a dual-path iterative preference optimization approach for table entity linking, with direct-answer and reasoning paths that improve accuracy on TableInstruct and MammoTab V2 benchmarks.
Introduces FinIndices, a large-scale benchmark evaluating LLM data-processing fidelity on uncropped financial statements, revealing knowledge and structural bottlenecks in financial reasoning.
This paper presents a novel unsupervised data augmentation method combining Gaussian Mixture Models and Large Language Models to improve clustering on imbalanced text datasets by generating synthetic documents for underrepresented clusters.
The paper introduces Hierarchical Copula-Gumbel-Top-K (H-CGA) routing, a method to control joint dependence among token routing choices in frozen Mixture-of-Experts models while keeping each token's routing law exactly fixed. It provides theoretical trade-offs between coherence and load dispersion and validates the mechanism with a small-scale pilot.
This paper introduces SIEVE, a search-inspect-fetch strategy that uses Boolean Query Language to make deep-research agents retrieve only relevant document sections, achieving higher accuracy with 20.7–50.6% fewer tokens across multiple benchmark datasets and agent backbones.
A tweet highlights an arxiv paper by Michel Fabrice Serret that introduces Transformers and attention mechanisms from an applied mathematics perspective, covering vectorization, multi-head attention, and methods to reduce attention costs like KV caching and latent attention.
Stanford NLP Group points to the 2024 CS224N video playlist, reminding viewers to watch the latest lectures on natural language processing with deep learning.