Results 261 to 270 of about 2,104,744 (292)
Some of the next articles are maybe not open access.

Note on occurrences of factors in circular words

RAIRO - Theoretical Informatics and Applications, 2016
By considering paths in the de Bruijn graph for three-letter binary words, the author proves a conjecture of Grandsart, namely, if \(w\) is a finite binary word, then the four differences \(|w|_{0011} - |w|_{1100}\), \(|w|_{1101}-|w|_{1011}\), \(|w|_{1010} - |w|_{0101}\), and \(|w|_{0100} - |w|_{0010}\) are equal.
openaire   +3 more sources

Automatic Detection of Words Associations in Texts Based on Joint Distribution of Words Occurrences

Computational Intelligence, 2015
In this article, we propose a novel approach for measuring word association based on the joint occurrences distribution in a text. Our approach relies on computing a sum of distances between neighboring occurrences of a given word pair and comparing it with a vector of randomly generated occurrences.
Daniele Santoni, Elaheh Pourabbas
openaire   +4 more sources

Performance prediction of word recognition using the probability of word occurrence

Electronics and Communications in Japan (Part III: Fundamental Electronic Science), 1995
AbstractThe words in natural language have different occurrence probabilities. Consequently, the information obtained from the event, i.e., the occurrence of a word, is larger than in the case of the occurrence with uniform probability. In other words, it will be effective to utilize the occurrence probability of the word in the recognition and it is ...
Takashi Otsuki   +3 more
openaire   +1 more source

ANTI-WORDS AND THE REASONS FOR THEIR OCCURRENCE

2021
Anti-words - alterations of traditional paremias - are an interesting phenomenon. These are texts in which structural and semantic units and models of traditional paremias, slogans, advertising, including political ones, are contaminated. They, in particular, reflect and evaluate the recent past and modern realities.
openaire   +1 more source

Word discrimination based on bigram co-occurrences

Proceedings of Sixth International Conference on Document Analysis and Recognition, 2002
Very few pairs of English words share exactly the same letter bigrams. This linguistic property can be exploited to bring lexical context into the classification stage of a word recognition system. The lexical n-gram matches between every word in a lexicon and a subset of reference words can be precomputed.
Adnan El-Nasan   +2 more
openaire   +1 more source

Word co-occurrence features for text classification

Information Systems, 2011
In this article we propose a data treatment strategy to generate new discriminative features, called compound-features (or c-features), for the sake of text classification. These c-features are composed by terms that co-occur in documents without any restrictions on order or distance between terms within a document.
Fábio Figueiredo   +5 more
openaire   +2 more sources

Waiting for ABRACADABRA. Occurrences of Words and Leading Numbers

2012
In this paper we introduce the readers to the concept of “leading number”, as proposed by J. H. Conway in the seventies of the last century. The leading number, associated to a word w, is a binary vector that describes some special aspects of the structure of w.
DE SANTIS, Emilio, SPIZZICHINO, Fabio
openaire   +2 more sources

Choosing Word Occurrences for the Smallest Grammar Problem

2010
The smallest grammar problem - namely, finding a smallest context-free grammar that generates exactly one sequence - is of practical and theoretical importance in fields such as Kolmogorov complexity, data compression and pattern discovery. We propose to focus on the choice of the occurrences to be rewritten by non-terminals.
Carrascosa, Rafael   +3 more
openaire   +3 more sources

Constraining Weighted Word Co-occurrence Frequencies in Word Embeddings

2021 IEEE International Conference on Big Data (Big Data), 2021
openaire   +1 more source

Word Occurrence in Diatomic Series

Journal of the London Mathematical Society, 1975
openaire   +2 more sources

Home - About - Disclaimer - Privacy