English
Related papers

Related papers: Complexity counts: global and local perspectives o…

200 papers

Handwritten word recognition and spotting of low-resource scripts are difficult as sufficient training data is not available and it is often expensive for collecting data of such scripts. This paper presents a novel cross language platform…

Computer Vision and Pattern Recognition · Computer Science 2018-02-06 Ayan Kumar Bhunia , Partha Pratim Roy , Akash Mohta , Umapada Pal

Recent breakthroughs in large language models (LLMs) have centered around a handful of data-rich languages. What does it take to broaden access to breakthroughs beyond first-class citizen languages? Our work introduces Aya, a massively…

Deep neural networks drive the success of natural language processing. A fundamental property of language is its compositional structure, allowing humans to systematically produce forms for new meanings. For humans, languages with more…

Computation and Language · Computer Science 2025-01-10 Lukas Galke , Yoav Ram , Limor Raviv

Konkani is a highly nasalised language which makes it unique among Indo-Aryan languages. This work investigates the acoustic-phonetic properties of Konkani oral and nasal vowels. For this study, speech samples from six speakers (3 male and…

Computation and Language · Computer Science 2023-05-18 Swapnil Fadte , Edna Vaz , Atul Kr. Ojha , Ramdas Karmali , Jyoti D. Pawar

This paper explores syllable sequence prediction in Abugida languages using Transformer-based models, focusing on six languages: Bengali, Hindi, Khmer, Lao, Myanmar, and Thai, from the Asian Language Treebank (ALT) dataset. We investigate…

Computation and Language · Computer Science 2025-05-19 Ye Kyaw Thu , Thazin Myint Oo

Technology is the making, usage and knowledge of tools, techniques, crafts, systems or methods of organization in order to solve a problem or serve some purpose. This is true for humanitarian issues also. Such as the issue of language and…

Human-Computer Interaction · Computer Science 2012-08-06 Partha Pratim Ray

The $\rho$-calculus (Reflective Higher-Order Calculus) of Meredith and Radestock is a $\pi$-calculus-like language with some unusual features, notably, structured names, runtime generation of free names, and the lack of an operator for…

Logic in Computer Science · Computer Science 2022-09-07 Stian Lybech

Natural numbers can be divided in two non-overlapping infinite sets, primes and composites, with composites factorizing into primes. Despite their apparent simplicity, the elucidation of the architecture of natural numbers with primes as…

Number Theory · Mathematics 2014-10-21 Guillermo Garcia-Perez , M. Angeles Serrano , Marian Boguna

The term "Code Mixed" refers to the use of more than one language in the same text. This phenomenon is predominantly observed on social media platforms, with an increasing amount of adaptation as time goes on. It is critical to detect…

Computation and Language · Computer Science 2023-05-29 Aryan Patil , Varad Patwardhan , Abhishek Phaltankar , Gauri Takawane , Raviraj Joshi

Is there a characteristic of coordination languages that makes them qualitatively different from general programming languages and deserves special academic attention? This report proposes a nuanced answer in three parts. The first part…

Software Engineering · Computer Science 2013-06-17 Raphael 'kena' Poss

We describe a method for classification of handwritten Kannada characters using Hidden Markov Models (HMMs). Kannada script is agglutinative, where simple shapes are concatenated horizontally to form a character. This results in a large…

Machine Learning · Computer Science 2014-10-17 Manasij Venkatesh , Vikas Majjagi , Deepu Vijayasenan

The quotient complexity, also known as state complexity, of a regular language is the number of distinct left quotients of the language. The quotient complexity of an operation is the maximal quotient complexity of the language resulting…

Formal Languages and Automata Theory · Computer Science 2010-12-20 Janusz Brzozowski , Bo Liu

Generalizations of numeration systems in which N is recognizable by a finite automaton are obtained by describing a lexicographically ordered infinite regular language L over a finite alphabet A. For these systems, we obtain a…

Computational Complexity · Computer Science 2007-05-23 Michel Rigo

This study demonstrates how hybrid neural-symbolic methods can yield significant new insights into the evolution of a morphologically rich, low-resource language. We challenge the naive assumption that linguistic change is simplification by…

Computation and Language · Computer Science 2025-12-08 Ananth Hariharan , David Mortensen

Orthographic transparency -- how directly spelling is related to sound -- lacks a unified, script-agnostic metric. Using ideas from algorithmic information theory, we quantify orthographic transparency in terms of the mutual compressibility…

Computation and Language · Computer Science 2025-05-21 Charles J. Torres , Richard Futrell

Handwritten numeral recognition is in general a benchmark problem of Pattern Recognition and Artificial Intelligence. Compared to the problem of printed numeral recognition, the problem of handwritten numeral recognition is compounded due…

Computer Vision and Pattern Recognition · Computer Science 2010-03-10 Nibaran Das , Ayatullah Faruk Mollah , Sudip Saha , Syed Sahidul Haque

Indexed languages are a classical notion in formal language theory. As the language equivalent of second-order pushdown automata, they have received considerable attention in higher-order model checking. Unfortunately, counting properties…

Formal Languages and Automata Theory · Computer Science 2024-05-14 Laura Ciobanu , Georg Zetzsche

The expressiveness of communication primitives has been explored in a common framework based on the pi-calculus by considering four features: synchronism (asynchronous vs synchronous), arity (monadic vs polyadic data), communication medium…

Logic in Computer Science · Computer Science 2015-08-21 Thomas Given-Wilson , Axel Legay

What makes some types of languages more probable than others? For instance, we know that almost all spoken languages contain the vowel phoneme /i/; why should that be? The field of linguistic typology seeks to answer these questions and,…

Computation and Language · Computer Science 2018-07-10 Ryan Cotterell , Jason Eisner

This paper explores the issues around the construction of large-scale complex systems which are built as 'systems of systems' and suggests that there are fundamental reasons, derived from the inherent complexity in these systems, why our…

Software Engineering · Computer Science 2011-09-16 Ian Sommerville , Dave Cliff , Radu Calinescu , Justin Keen , Tim Kelly , Marta Kwiatkowska , John McDermid , Richard Paige
‹ Prev 1 8 9 10 Next ›