Results 71 to 80 of about 8,270 (198)
EL-Labelings and Canonical Spanning Trees for Subword Complexes [PDF]
We describe edge labelings of the increasing flip graph of a subword complex on a finite Coxeter group, and study applications thereof. On the one hand, we show that they provide canonical spanning trees of the facet-ridge graph of the subword complex, describe inductively these trees, and present their close relations to greedy facets. Searching these
Pilaud, Vincent, Stump, Christian
openaire +7 more sources
A Hopf algebra of subword complexes (Extended abstract) [PDF]
We introduce a Hopf algebra structure of subword complexes, including both finite and infinite types. We present an explicit cancellation free formula for the antipode using acyclic orientations of certain graphs, and show that this Hopf algebra induces a natural non-trivial sub-Hopf algebra on c-clusters in the theory of cluster algebras.
Nantel Bergeron, Cesar Ceballos
openaire +2 more sources
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
Subword complexity and projection bodies
The Hartman sequence \((h(P, \alpha)_k)_{k\in\mathbb{Z}}\) induced by a polytope \(P \subseteq [0, 1)^d\) and an \(\alpha \in [0, 1)^d\) is defined by \(h(P, \alpha)_k = 1\) if \(k \alpha \in P + \mathbb{Z}^d\) and \(h(P, \alpha)_k = 0\) else. The factor complexity (or subword complexity) \(p_{P,\alpha}(N)\) of this sequence is the number of different ...
openaire +2 more sources
Language machines: Toward a linguistic anthropology of large language models
Abstract Large language models (LLMs) challenge long‐standing assumptions in linguistics and linguistic anthropology by generating human‐like language without relying on rule‐based structures. This introduction to the special issue Language Machines calls for renewed engagement with LLMs as socially embedded language technologies.
Siri Lamoureaux +2 more
wiley +1 more source
Alternating complexity of counting first-order logic for the subword order [PDF]
Dietrich Kuske, Christian Schwarz
openalex +1 more source
This study presents a dual‐layered anonymization model combining BioClinicalBERT and polyalphabetic cipher to accurately identify and protect sensitive healthcare data. It achieves strong F1 scores while maintaining data utility, enabling privacy‐preserving clinical research compliant with GDPR and HIPAA regulations.
Deblina Mazumder Setu +3 more
wiley +1 more source
Large language models for bioinformatics
Abstract With the rapid advancements in large language model technology and the emergence of bioinformatics‐specific language models (BioLMs), there is a growing need for a comprehensive analysis of the current landscape, computational characteristics, and diverse applications.
Wei Ruan +54 more
wiley +1 more source
Abstract Semantic transparency is a key construct for understanding how complex words are represented and processed, yet it has been conceptualized and operationalized in diverse ways across studies. In this study, we validate whether semantic transparency exhibits multidimensional properties across different measures in Mandarin Chinese.
Jing Chen +3 more
wiley +1 more source
Named entity recognition pipeline for knowledge extraction from scientific literature. Machine learning interatomic potential (MLIP) is an emerging technique that has helped achieve molecular dynamics simulations with unprecedented balance between efficiency and accuracy. Recently, the body of MLIP literature has been growing rapidly, which propels the
Bowen Zheng, Grace X. Gu
wiley +1 more source

