English
Related papers

Related papers: Operational characterization of scattered MCFLs --…

200 papers

We study the fractal structure of language, aiming to provide a precise formalism for quantifying properties that may have been previously suspected but not formally shown. We establish that language is: (1) self-similar, exhibiting…

Computation and Language · Computer Science 2024-05-24 Ibrahim Alabdulmohsin , Vinh Q. Tran , Mostafa Dehghani

Accurate estimation of aircraft operations, such as takeoffs and landings, is critical for effective airport management, yet remains challenging, especially at non-towered facilities lacking dedicated surveillance infrastructure. This paper…

Sound · Computer Science 2025-09-15 Abdullah All Tanvir , Chenyu Huang , Moe Alahmad , Chuyang Yang , Xin Zhong

We present two methods for unsupervised segmentation of words into morpheme-like units. The model utilized is especially suited for languages with a rich morphology, such as Finnish. The first method is based on the Minimum Description…

Computation and Language · Computer Science 2007-05-23 Mathias Creutz , Krista Lagus

In this work, we employ a machine-learning-assisted high-throughput density functional theory framework to systematically investigate the stability, electronic structure, and magnetic ground states of 234 M$_4$X$_3$T$_x$ MXenes. The machine…

Materials Science · Physics 2026-03-05 Sakshi Goel , Arti Kashyap

Mechanistic Interpretability (MI) seeks to explain how neural networks implement their capabilities, but the scale of Large Language Models (LLMs) has limited prior MI work in Machine Translation (MT) to word-level analyses. We study…

Computation and Language · Computer Science 2026-02-05 Théo Lasnier , Armel Zebaze , Djamé Seddah , Rachel Bawden , Benoît Sagot

Character-level models have become a popular approach specially for their accessibility and ability to handle unseen data. However, little is known on their ability to reveal the underlying morphological structure of a word, which is a…

Computation and Language · Computer Science 2018-05-31 Gözde Gül Şahin , Mark Steedman

This paper presents a new approach to partial parsing of context-free structures. The approach is based on Markov Models. Each layer of the resulting structure is represented by its own Markov Model, and output of a lower layer is passed as…

Computation and Language · Computer Science 2007-05-23 Thorsten Brants

For Pretrained Language Models (PLMs), their susceptibility to noise has recently been linked to subword segmentation. However, it is unclear which aspects of segmentation affect their understanding. This study assesses the robustness of…

Computation and Language · Computer Science 2024-10-15 Xinzhe Li , Ming Liu , Shang Gao

Computation Tree Logic (CTL) and its extensions CTL* and CTL+ are widely used in automated verification as a basis for common model checking tools. But while they can express many properties of interest like reachability, even simple…

Logic in Computer Science · Computer Science 2019-10-28 Jens Oliver Gutsfeld , Markus Müller-Olm , Christian Dielitz

Multi-task semantic communication (SC) can reduce the computational resources in wireless systems since retraining is not required when switching between tasks. However, existing approaches typically rely on task-specific embeddings to…

Signal Processing · Electrical Eng. & Systems 2025-03-24 Sin-Yu Huang , Renjie Liao , Vincent W. S. Wong

Language modeling studies the probability distributions over strings of texts. It is one of the most fundamental tasks in natural language processing (NLP). It has been widely used in text generation, speech recognition, machine…

Computation and Language · Computer Science 2024-07-18 Chengwei Wei , Yun-Cheng Wang , Bin Wang , C. -C. Jay Kuo

Languages based on the theory of timed automata are a well established approach for modelling and analysing real-time systems, with many applications both in industrial and academic context. Model checking for timed automata has been…

Logic in Computer Science · Computer Science 2014-12-04 Hossein Hojjat , Philipp Rümmer , Pavle Subotic , Wang Yi

We prove that the finite condensation rank (FC-rank) of the lexicographic ordering of a context-free language is strictly less than $\omega^\omega$.

Formal Languages and Automata Theory · Computer Science 2015-03-20 Arnaud Carayol , Zoltan Esik

Spoken Language Models (SLMs) aim to learn linguistic competence directly from speech using discrete units, widening access to Natural Language Processing (NLP) technologies for languages with limited written resources. However, progress…

Computation and Language · Computer Science 2026-02-23 Adel Moumen , Guangzhi Sun , Philip C. Woodland

Morphological analysis involves predicting the syntactic traits of a word (e.g. {POS: Noun, Case: Acc, Gender: Fem}). Previous work in morphological tagging improves performance for low-resource languages (LRLs) through cross-lingual…

Computation and Language · Computer Science 2018-07-12 Chaitanya Malaviya , Matthew R. Gormley , Graham Neubig

Ever since the development of GPT-3 in the natural language processing (NLP) field, in-context learning (ICL) has played an essential role in utilizing large language models (LLMs). By presenting the LM utterance-label demonstrations at the…

Audio and Speech Processing · Electrical Eng. & Systems 2024-06-18 Ming-Hao Hsu , Kai-Wei Chang , Shang-Wen Li , Hung-yi Lee

Synchronous Context-Free Grammars (SCFGs), also known as syntax-directed translation schemata, are unlike context-free grammars in that they do not have a binary normal form. In general, parsing with SCFGs takes space and time polynomial in…

Formal Languages and Automata Theory · Computer Science 2013-11-27 Pierluigi Crescenzi , Daniel Gildea , Andrea Marino , Gianluca Rossi , Giorgio Satta

When does a deterministic computational model define a probability distribution? What are its properties? This work formalises and settles this stochasticity problem for weighted automata, and its generalisation cost register automata…

Formal Languages and Automata Theory · Computer Science 2025-10-23 Smayan Agarwal , Aalok Thakkar

The paper gives an explicit description of the Weiss embedding tower in terms of spaces of maps of truncated modules over the framed Fulton-MacPherson operad.

Algebraic Topology · Mathematics 2014-10-01 Victor Tourtchine

The field of spoken language processing is undergoing a shift from training custom-built, task-specific models toward using and optimizing spoken language models (SLMs) which act as universal speech processing systems. This trend is similar…

Computation and Language · Computer Science 2026-04-08 Siddhant Arora , Kai-Wei Chang , Chung-Ming Chien , Yifan Peng , Haibin Wu , Yossi Adi , Emmanuel Dupoux , Hung-Yi Lee , Karen Livescu , Shinji Watanabe
‹ Prev 1 8 9 10 Next ›