English
Related papers

Related papers: Grammar rules for the isiZulu complex verb

200 papers

The ability of Large Language Models (LLMs) to precisely follow complex and fine-grained lexical instructions is a cornerstone of their utility and controllability. However, evaluating this capability remains a significant challenge.…

Computation and Language · Computer Science 2026-03-24 Huimin Ren , Yan Liang , Baiqiao Su , Chaobo Sun , Hengtong Lu , Kaike Zhang , Chen Wei

Stemming from the limited availability of datasets and textual resources for low-resource languages such as isiZulu, there is a significant need to be able to harness knowledge from pre-trained models to improve low resource machine…

Computation and Language · Computer Science 2022-05-19 Muhammad Umair Nasir , Innocent Amos Mchechesi

This paper describes the sixteen Duluth entries in the Senseval-2 comparative exercise among word sense disambiguation systems. There were eight pairs of Duluth systems entered in the Spanish and English lexical sample tasks. These are all…

Computation and Language · Computer Science 2007-05-23 Ted Pedersen

We investigate models for learning the class of context-free and context-sensitive languages (CFLs and CSLs). We begin with a brief discussion of some early hardness results which show that unrestricted language learning is impossible, and…

Formal Languages and Automata Theory · Computer Science 2012-07-09 Jacob Andreas

A practical tool for natural language modeling and development of human-machine interaction is developed in the context of formal grammars and languages. A new type of formal grammars, called grammars with prohibition, is introduced.…

Formal Languages and Automata Theory · Computer Science 2013-02-22 Mark Burgin

Context-free S grammars are introduced, for arbitrary (storage) type S, as a uniform framework for recursion-based grammars, automata, and transducers, viewed as programs. To each occurrence of a nonterminal of a context-free S grammar an…

Formal Languages and Automata Theory · Computer Science 2014-08-05 Joost Engelfriet

We investigate learning collections of languages from texts by an inductive inference machine with access to the current datum and a bounded memory in form of states. Such a bounded memory states (BMS) learner is considered successful in…

Formal Languages and Automata Theory · Computer Science 2021-06-18 Timo Kötzing , Karen Seidel

Can recurrent neural nets, inspired by human sequential data processing, learn to understand language? We construct simplified datasets reflecting core properties of natural language as modeled in formal syntax and semantics: recursive…

Computation and Language · Computer Science 2021-12-30 Denis Paperno

Particles fullfill several distinct central roles in the Japanese language. They can mark arguments as well as adjuncts, can be functional or have semantic funtions. There is, however, no straightforward matching from particles to…

Computation and Language · Computer Science 2007-05-23 Melanie Siegel

Are the predictions of humans and language models affected by similar things? Research suggests that while comprehending language, humans make predictions about upcoming words, with more predictable words being processed more easily.…

Computation and Language · Computer Science 2022-11-11 James A. Michaelov , Benjamin K. Bergen

Natural language understanding (NLU) is a task that enables machines to understand human language. Some tasks, such as stance detection and sentiment analysis, are closely related to individual subjective perspectives, thus termed…

Computation and Language · Computer Science 2025-02-20 Yunpeng Xiao , Youpeng Zhao , Kai Shu

This paper concerns $\mu$-limit sets of cellular automata: sets of configurations made of words whose probability to appear does not vanish with time, starting from an initial $\mu$-random configuration. More precisely, we investigate the…

Discrete Mathematics · Computer Science 2015-06-23 Laurent Boyer , Martin Delacourt , Victor Poupet , Mathieu Sablik , Guillaume Theyssier

It is unclear whether, how and where large pre-trained language models capture subtle linguistic traits like ambiguity, grammaticality and sentence complexity. We present results of automatic classification of these traits and compare their…

Computation and Language · Computer Science 2022-10-18 Sunit Bhattacharya , Vilém Zouhar , Ondřej Bojar

Grammar refers to the system of rules that governs the structural organization and the semantic relations among linguistic units such as sentences, phrases, and words within a given language. In natural language processing, there remains a…

Computation and Language · Computer Science 2026-02-24 Lujun Li , Yewei Song , Lama Sleem , Yiqun Wang , Yangjie Xu , Cedric Lothritz , Niccolo Gentile , Radu State , Tegawende F. Bissyande , Jacques Klein

Contemporary deep learning models effectively handle languages with diverse morphology despite not being directly integrated into them. Morphology and word order are closely linked, with the latter incorporated into transformer-based models…

Computation and Language · Computer Science 2024-05-31 Poulami Ghosh , Shikhar Vashishth , Raj Dabre , Pushpak Bhattacharyya

Language has been a dynamic system and word meanings always have been changed over times. Every time a novel concept or sense is introduced, we need to assign it a word to express it. Also, some changes have happened because the result of a…

Computation and Language · Computer Science 2020-03-12 Zahra Shekarchi , Yang Xu

Large pre-trained language models such as BERT have been widely used as a framework for natural language understanding (NLU) tasks. However, recent findings have revealed that pre-trained language models are insensitive to word order. The…

Computation and Language · Computer Science 2023-04-12 Hadeel Al-Negheimish , Pranava Madhyastha , Alessandra Russo

Languages are continuously undergoing changes, and the mechanisms that underlie these changes are still a matter of debate. In this work, we approach language evolution through the lens of causality in order to model not only how various…

Computation and Language · Computer Science 2022-05-10 Daphna Keidar , Andreas Opedal , Zhijing Jin , Mrinmaya Sachan

How can non-classical logic contribute to the analysis of complexity in computer science? In this paper, we give a step towards this question, taking a logical model-theoretic approach to the analysis of complexity in fuzzy constraint…

Logic · Mathematics 2019-11-18 Pilar Dellunde , Amanda Vidal

We developed a type-theoretical framework for natural lan- guage semantics that, in addition to the usual Montagovian treatment of compositional semantics, includes a treatment of some phenomena of lex- ical semantic: coercions, meaning,…

Computation and Language · Computer Science 2014-01-06 Bruno Mery , Richard Moot , Christian Retoré
‹ Prev 1 3 4 5 6 7 10 Next ›