English
Related papers

Related papers: A Paradigm Gap in Urdu

200 papers

The {\it defect} (also called {\it ramification deficiency}) of valued field extensions is a major stumbling block in deep open problems of valuation theory in positive characteristic. For a detailed analysis, we define and investigate two…

Commutative Algebra · Mathematics 2013-04-02 Franz-Viktor Kuhlmann , Asim Naseem

We find new "reasons" for a class of models for not having a universal model in a cardinal $\lambda$. This work, though it has consequences in model theory, is really in combinatorial set theory. We concentrate on a prototypical class which…

Logic · Mathematics 2022-03-15 Saharon Shelah

Ontology-based query answering with existential rules is well understood and implemented for positive queries, in particular conjunctive queries. The situation changes drastically for queries with negation, where there is no agreed-upon…

Logic in Computer Science · Computer Science 2021-12-22 Stefan Ellmauthaler , Markus Krötzsch , Stephan Mennicke

The Random Language Model, proposed as a simple model of human languages, is defined by the averaged model of a probabilistic context-free grammar. This grammar expresses the process of sentence generation as a tree graph with nodes having…

Disordered Systems and Neural Networks · Physics 2022-07-07 Kai Nakaishi , Koji Hukushima

Large language models often struggle to recognize their knowledge limits in closed-book question answering, leading to confident hallucinations. While decomposed prompting is typically used to improve accuracy, we investigate its impact on…

Computation and Language · Computer Science 2026-02-05 Dhruv Madhwal , Lyuxin David Zhang , Dan Roth , Tomer Wolfson , Vivek Gupta

Various variants of Parikh automata on infinite words have recently been introduced in the literature. However, with some exceptions only their non-deterministic versions have been considered. In this paper we study the deterministic…

Formal Languages and Automata Theory · Computer Science 2024-05-27 Mario Grobler , Sebastian Siebertz

We compare pushdown automata (PDAs for short) against other representations. First, we show that there is a family of PDAs over a unary alphabet with $n$ states and $p \geq 2n + 4$ stack symbols that accepts one single long word for which…

Formal Languages and Automata Theory · Computer Science 2017-06-27 Pierre Ganty , Elena Gutiérrez

Understanding verbs is crucial to modelling how people and objects interact with each other and the environment through space and time. Recently, state-of-the-art video-language models based on CLIP have been shown to have limited verb…

Computer Vision and Pattern Recognition · Computer Science 2023-04-14 Liliane Momeni , Mathilde Caron , Arsha Nagrani , Andrew Zisserman , Cordelia Schmid

In real dialogue scenarios, the existing slot filling model, which tends to memorize entity patterns, has a significantly reduced generalization facing Out-of-Vocabulary (OOV) problems. To address this issue, we propose an OOV robust slot…

Computation and Language · Computer Science 2023-02-28 Daichi Guo , Guanting Dong , Dayuan Fu , Yuxiang Wu , Chen Zeng , Tingfeng Hui , Liwen Wang , Xuefeng Li , Zechen Wang , Keqing He , Xinyue Cui , Weiran Xu

This paper presents the first benchmark for the task of automatic part-of-speech (POS) tagging for the Tajik language. Despite the existence of multilingual language models demonstrating high effectiveness for many of the world's languages,…

Computation and Language · Computer Science 2026-05-07 Mullosharaf K. Arabov

The Swadesh approach for determining the temporal separation between two languages relies on the stochastic process of words replacement (when a complete new word emerges to represent a given concept). It is well known that the basic…

Computation and Language · Computer Science 2025-10-28 Maurizio Serva

Complex systems typically have many different parts and facets, with different characteristics. In a multi-paradigm approach to modeling, formalisms with different natures are used in combination to describe complementary parts and aspects…

Logic in Computer Science · Computer Science 2013-08-14 Marcello M. Bersani , Carlo A. Furia , Matteo Pradella , Matteo Rossi

We present a metagrammatical formalism, {\em generic rules}, to give a default interpretation to grammar rules. Our formalism introduces a process of {\em dynamic binding} interfacing the level of pure grammatical knowledge representation…

cmp-lg · Computer Science 2008-02-03 Julio Gonzalo , Teresa Solias

Determining the correct form of a verb in context requires an understanding of the syntactic structure of the sentence. Recurrent neural networks have been shown to perform this task with an error rate comparable to humans, despite the fact…

Computation and Language · Computer Science 2018-07-19 Tal Linzen , Brian Leonard

This paper compares the consistency-based account of agreement phenomena in `unification-based' grammars with an implication-based account based on a simple feature extension to Lambek Categorial Grammar (LCG). We show that the LCG…

cmp-lg · Computer Science 2008-02-03 Sam Bayer , Mark Johnson

Computer-Assisted Pronunciation Training (CAPT) has been extensively studied for English. However, there remains a critical gap in its application to Indian languages with a base of 1.5 billion speakers. Pronunciation tools tailored to…

Audio and Speech Processing · Electrical Eng. & Systems 2025-06-04 Arnav Rustagi , Satvik Bajpai , Nimrat Kaur , Siddharth Siddharth

AI integration in automotive perception systems shifts requirements from static specifications to continuously evolving entities shaped by data, models, and operating contexts. When such changes are not consistently documented, validated,…

Software Engineering · Computer Science 2026-05-01 Hina Saeeda , Soniya Abraham

Unlike English, which uses distinct forms (e.g., had, has, will have) to mark the perfect aspect across tenses, Chinese and Japanese lack separate grammatical forms for tense within the perfect aspect, which complicates Natural Language…

Computation and Language · Computer Science 2025-08-19 Jie Lu , Du Jin , Hitomi Yanaka

The heterogeneity of tools that support temporal logic formulae poses several challenges in terms of interoperability. In particular, a standard syntax for temporal logic on finite traces, despite similar to the one for infinite traces, is…

Logic in Computer Science · Computer Science 2021-06-09 Marco Favorito

German and French football language display tense-aspect-mood (TAM) forms which differ from the TAM use in other genres. In German football talk, the present indicative may replace the pluperfect subjunctive. In French reports of football…

Computation and Language · Computer Science 2021-09-20 Jakob Egetenmeyer
‹ Prev 1 8 9 10 Next ›