Results 51 to 60 of about 114 (95)
ABSTRACT The rapid expansion of multilingual digital platforms has made the accurate analysis of user‐generated content across different languages and cultural contexts increasingly essential. However, existing methods struggle to maintain consistent performance due to linguistic diversity, morphological complexity, and structural variations in text ...
Abdulkadir Şeker
wiley +1 more source
In this work, we have performed human‐based evaluation of three post hoc explainability techniques, Local Interpretable Model Agnostic Explanations (LIME), Shapely Additive Explanations (SHAP), and integrated Gradients (IG) for a multilingual Bidirectional Encoder Representations from Transformers (mBERT) based binary and multi‐label misogyny ...
Sargam Yadav +2 more
wiley +1 more source
ABSTRACT Sentiment analysis of movie reviews reflects users' behavioral preferences and emotional responses to films, aiding in understanding audience needs and enhancing user experience. In recent years, deep ensemble learning has significantly improved sentiment polarity prediction by combining multiple deep models.
Hanzhe Cai, Ze Wu, Seena Joseph
wiley +1 more source
On Subword Complexity of Morphic Sequences
We study structure of pure morphic and morphic sequences and prove the following result: the subword complexity of arbitrary morphic sequence is either $Θ(n^{1+1/k})$ for some $k\in\mathbb N$, or is $O(n \log n)$.
openaire +2 more sources
A Hopf algebra of subword complexes
Several color figures, 31 ...
Nantel Bergeron, Cesar Ceballos
openaire +2 more sources
This study presents a comprehensive analysis of Bengali AI resources, including NLP tools, machine translation systems, speech technologies, and benchmarking datasets. The findings highlight fragmented development across tasks and emphasize the need for integrated resources, unified benchmarks, and multimodal datasets to build a scalable and robust ...
Fairooz Maliha +5 more
wiley +1 more source
On scattered subword complexity
Special scattered subwords, in which the gaps are of length from a given set, are defined. The scattered subword complexity, which is the number of such scattered subwords, is computed for rainbow words.
openaire +3 more sources
Flowchart of the proposed process. ABSTRACT This paper explores machine learning‐based discovery of Indian‐origin scientists working overseas with a fused multi‐institution dataset of 4280 records retrieved in seven research institutions: Ames Laboratory, AMNH, Broad Institute, DRI, NIDDK‐NIH, Salk Institute, and Van Andel Institute.
Shivani Gautam +6 more
wiley +1 more source
On Possibilities and Challenges of GPT‐Assisted Learning Environments
ABSTRACT Contemporary education demands a student‐centered and competence‐oriented approach. Learners must tackle and solve problems independently and in line with constructivist learning theories. Accordingly, instructional roles must evolve from mere knowledge transmission to facilitating students' autonomous achievement of learning objectives—a ...
Marius Harnisch, Thorsten Bartel
wiley +1 more source
Subword Complexes and Nil-Hecke Moves
For a finite Coxeter group W, a subword complex is a simplicial complex associated with a pair (Q, ρ), where Q is a word in the alphabet of simple reflections, ρis a group element. We describe the transformations of such a complex induced by nil-moves and inverse operations on Q in the nil-Hecke monoid corresponding to W.
openaire +5 more sources

