Related papers: Application of Generalised sequential crossover of…
Recent work to enhance data partitioning strategies for more realistic model evaluation face challenges in providing a clear optimal choice. This study addresses these challenges, focusing on morphological segmentation and synthesizing…
Segmentation remains an important preprocessing step both in languages where "words" or other important syntactic/semantic units (like morphemes) are not clearly delineated by white space, as well as when dealing with continuous speech…
Implicit Neural Representations (INR) have been successfully employed for Arbitrary-scale Super-Resolution (ASR). However, INR-based models need to query the multi-layer perceptron module numerous times and render a pixel in each query,…
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but we do have an efficient $\eps$-approximation.
We prove the existence of infinite classes of cyclic G-decompositions of the complete multipartite graph, G being a caterpillar, a hairy cycle or a cycle. All the results are obtained by the construction of d-divisible $\alpha$-labelings of…
Language identification for code-switching (CS), the phenomenon of alternating between two or more languages in conversations, has traditionally been approached under the assumption of a single language per token. However, if at least one…
Generalized sine and cosine functions, $\sin_{n}$ and $\cos_{n}$, that parametrize the generalized unit circle $x^n+y^n=1$ are, much like their classical circular counterparts, extendable as complex analytic functions. In this article, we…
We propose that small pretrained foundational generative language models with millions of parameters can be utilized as a general learning framework for sequence-based tasks. Our proposal overcomes the computational resource, skill set, and…
We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying graph topology, which have recently found numerous applications. Such…
Continuous spline functions are defined as piecewise polynomials on the faces of a polyhedral complex that agree on the intersections of two faces. Splines are used in approximation theory and numerical analysis, with applications in data…
A natural generalization of a crossing change is a rational subtangle replacement (RSR). We characterize the fundamental situation of the rational tangles obtained from a given rational tangle via RSR, building on work of Berge and Gabai,…
Code-switching (CSW) is a common phenomenon among multilingual speakers where multiple languages are used in a single discourse or utterance. Mixed language utterances may still contain grammatical errors however, yet most existing Grammar…
In this paper, we investigate the generalized Pell sequence, the generalized complex Pell sequence and the generalized dual Pell sequence using the Pell numbers. We obtain special cases of these sequences. Furthermore, we give recurrence…
We introduce Trans-gram, a simple and computationally-efficient method to simultaneously learn and align wordembeddings for a variety of languages, using only monolingual data and a smaller set of sentence-aligned data. We use our new…
The patterns in which the syntax of different languages converges and diverges are often used to inform work on cross-lingual transfer. Nevertheless, little empirical work has been done on quantifying the prevalence of different syntactic…
Let G be a connected reductive group and X an equivariant compactifiction of G. In X, we study generalised and opposite generalised Schubert varieties, their intersections called generalised Richardson varieties and projected generalised…
We generalize the notion of a root system by relaxing the conditions that ensure that it is invariant under reflections and study the resulting structures, which we call generalized root systems (GRSs for short). Since both Kostant root…
Iterated hairpin completion is an operation on formal languages that is inspired by the hairpin formation in DNA biochemistry. Iterated hairpin completion of a word (or more precisely a singleton language) is always a context-sensitive…
Many domains, from deep learning to finance, require compounding real numbers over long sequences, often leading to catastrophic numerical underflow or overflow. We introduce generalized orders of magnitude (GOOMs), a principled extension…
Generalization to new domains not seen during training is one of the long-standing challenges in deploying neural networks in real-world applications. Existing generalization techniques either necessitate external images for augmentation,…