Results 1 to 10 of about 8,270 (198)

ν-Tamari lattices via subword complexes

Electronic Notes in Discrete Mathematics, 2017
Abstract We show that the ν-Tamari lattices of Preville-Ratelle and Viennot can obtained as the duals of certain subword complexes. This generalizes a known result for the classical Tamari lattice, provides a simple description of the lattice property using certain bracket vectors of ν-trees, and gives (conjectural) insight on the geometry of more ...
Cesar Ceballos, Arnau Padrol, Camilo Sarmiento   +2 more
openaire   +1 more source

Super-d-complexity of finite words [PDF]

, 2010
In this paper we introduce and study a new complexity measure for finite words. For positive integer $d$ special scattered subwords, called super-$d$-subwords, in which the gaps are of length at least $(d-1)$, are defined.
Kása, Zoltán
core  

Investigating linguistic errors in large language model generation of uzbek text

Cogent Arts & Humanities
This study examines how contemporary large language models (LLMs) generate Uzbek, an agglutinative, morphologically rich, and low-resource Turkic language.
Dilyorjon Solidjonov, Muhammadjon Najmiddinov   +1 more
doaj   +1 more source

A Comparative Analysis of Character and Word-Based Tokenization for Kawi-Indonesian Neural Machine Translation

Journal of Applied Informatics and Computing
Preserving regional languages ​​is a strategic step in preserving cultural heritage while expanding access to knowledge across generations. One approach that can support this effort is the application of automatic translation technology to digitize and ...
I Gede Bintang Arya Budaya, I Gede Putra Mas Yusadara   +1 more
doaj   +1 more source

A Hybrid Deep Learning Model Based on Local and Global Features for Amazon Product Reviews: An Optimal ALBERT-Cascade CNN Approach

Applied Sciences
Natural Language Processing (NLP) is a valuable technology and business topic as it helps turn data into useful information with the spread of digital information.
Israa Mustafa Abbas, İsmail Atacak, Sinan Toklu, Necaattin Barışçı, İbrahim Alper Doğru   +4 more
doaj   +1 more source

Monoids of O-type, subword reversing, and ordered groups [PDF]

, 2012
We describe a simple scheme for constructing finitely generated monoids in which left-divisibility is a linear ordering and for practically investigating these monoids.
Dehornoy, Patrick
core   +2 more sources

The Evolution of AI: From Classical Machine Learning to Modern Large Language Models

IEEE Access
This paper provides a comprehensive review of the evolution of artificial intelligence from early symbolic, rule-based systems to modern large language models (LLMs) and retrieval-augmented generation (RAG) architectures.
Rahul Mundlamuri, Ganesh Reddy Gunnam, Nikhil Kumar Mysari, Jayakanth Pujuri   +3 more
doaj   +1 more source

A Pansiot-type subword complexity theorem for automorphisms of free groups [PDF]

, 2022
Arnaud Hilion, Gilbert Levitt
openalex   +1 more source

More Kolakoski Sequences [PDF]

, 2010
Our goal in this article is to review the known properties of the mysterious Kolakoski sequence and at the same time look at generalizations of it over arbitrary two letter alphabets.
Sing, Bernd
core  

Infinite words with linear subword complexity

Theoretical Computer Science, 1989
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources