Results 61 to 70 of about 16,255,542 (289)

Frequency, Informativity and Word Length: Insights from Typologically Diverse Corpora

open access: yesEntropy, 2022
Zipf’s law of abbreviation, which posits a negative correlation between word frequency and length, is one of the most famous and robust cross-linguistic generalizations. At the same time, it has been shown that contextual informativity (average surprisal
Natalia Levshina
doaj   +1 more source

N-grams Bayesian Differential Privacy

open access: yesCoRR, 2021
Differential privacy has gained popularity in machine learning as a strong privacy guarantee, in contrast to privacy mitigation techniques such as k-anonymity. However, applying differential privacy to n-gram counts significantly degrades the utility of derived language models due to their large vocabularies. We propose a differential privacy mechanism
Osman Ramadan   +2 more
openaire   +2 more sources

The Shewanella oneidensis Fic enzyme SoFic targets the switch‐I region of EF‐Tu for AMPylation

open access: yesFEBS Letters, EarlyView.
Fic enzymes mediate diverse post‐translational modifications across all domains of life, including AMPylation. Prokaryotic EF‐Tu can be AMPylated and deAMPylated by the conserved Fic enzyme SoFic. Structural and biochemical approaches were used to characterize the effect of AMPylation on EF‐Tu, SoFic's enzymatic activities, and the enzyme‐target ...
Svenja Runge   +6 more
wiley   +1 more source

A discriminative method for protein remote homology detection and fold recognition combining Top-n-grams and latent semantic analysis

open access: yesBMC Bioinformatics, 2008
Background Protein remote homology detection and fold recognition are central problems in bioinformatics. Currently, discriminative methods based on support vector machine (SVM) are the most effective and accurate methods for solving these problems.
Lin Lei   +4 more
doaj   +1 more source

N-gram Based Croatian Language Network: Application in a Smart Environment

open access: yesJournal of Communications Software and Systems, 2022
In the field of natural language processing, language networks represent a method for observing linguistic units and their interactions in different linguistic contexts.
Renato Šoić, Marin Vuković
doaj   +1 more source

PANACEA Environment Corpus n-grams IT (Italian)

open access: yes, 2012
This data set contains Italian word n-grams and Italian word/tag/lemma n-grams in the "Environment" (ENV) domain. N-grams are accompanied by their observed frequency counts.
Consiglio Nazionale delle Ricerche. Istituto di Linguistica Computazionale "Antonio Zampolli"   +1 more
core   +1 more source

A context‐dependent modulatory role for eIF6 in acquired resistance to vemurafenib in melanoma

open access: yesFEBS Letters, EarlyView.
Acquired resistance to vemurafenib upregulates the translation factor eIF6 in melanoma cells. Silencing eIF6 in resistant cells reduces proliferation and partially restores drug sensitivity, whereas its overexpression increases sensitivity across melanoma lines regardless of BRAF status, via modulation of mTOR, S6K, and MAPK signaling.
George Kyriakopoulos   +9 more
wiley   +1 more source

Filetype identification using long, summarized n-grams [PDF]

open access: yes, 2011
Past research into file type identification has employed many different techniques in an attempt to accurately classify files and file fragments including N-gram analysis.
Mayer, Ryan C.
core   +2 more sources

Quantiprot - a Python package for quantitative analysis of protein sequences

open access: yesBMC Bioinformatics, 2017
Background The field of protein sequence analysis is dominated by tools rooted in substitution matrices and alignments. A complementary approach is provided by methods of quantitative characterization.
Bogumił M. Konopka   +2 more
doaj   +1 more source

Intermediate N-Gramming: Deterministic and Fast N-Grams for Large N and Large Datasets

open access: yesProceedings of the AAAI Conference on Artificial Intelligence
The number of n-gram features grows exponentially in n, making it computationally demanding to compute the most frequent n-grams even for n as small as 3. Motivated by our production machine learning system built on n-gram features, we ask: is it possible to accurately, deterministically, and quickly recover the top-k most frequent n-grams? We devise
Ryan R. Curtin   +3 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy