Results 251 to 260 of about 2,104,744 (292)

Symbol Separation in Double Occurrence Words

International Journal of Foundations of Computer Science, 2020
A double occurrence word (DOW) is a word in which every symbol appears exactly twice. We define the symbol separation of a DOW [Formula: see text] to be the number of letters between the two copies of a symbol, and the separation of [Formula: see text] to be the sum of separations over all symbols in [Formula: see text].
Natasa Jonoska, Masahico Saito, Hwee Kim, Brad Mostowski   +3 more
openaire   +3 more sources

Double Occurrence Words: Their Graphs and Matrices

Journal of Mathematical Sciences, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guterman, A. E., Kreines, E. M., Ostroukhova, N. V.   +2 more
openaire   +1 more source

On the occurrence of reversible words

American Documentation, 1963
AbstractWe consider the population of trigrams in printed English of the form consonant1‐vowel‐consonant2. It is shown that, if a trigram C1VC2 is an English word, then its symmetric permutation, C2VC1, is likely to be an English word more often than expected on the basis of the ratio of all words to all trigrams.
William Paul Livant, John Paul Boyd
openaire   +1 more source

An occurrence-based model of word categorization

Annals of Mathematics and Artificial Intelligence, 1995
Small corpora present problems for traditional statistical analysis because of their sparsity of data. We discuss a methodology for classifying words in edited, plain text corpora which has the potential for working on relatively small corpora. This approach, which we calloccurrence-based processing, counts which contexts occur around a given word, but
P. A. Bensch, Walter J. Savitch
openaire   +2 more sources

On searching of all occurrences of a word in a string

ICECS'99. Proceedings of ICECS '99. 6th IEEE International Conference on Electronics, Circuits and Systems (Cat. No.99EX357), 2003
This paper presents a string search algorithm. The method is one of search to find all occurrences of a word p of m characters in a string s of n characters ...
Octavian C. Dogaru, Roxana Dogaru
openaire   +2 more sources

Modeling word occurrences for the compression of concordances

ACM Transactions on Information Systems, 1997
An earlier paper developed a procedure for compressing concordances, assuming that all alements occurred independently. The models introduced in that paper are extended here to take the possiblity of clustering into account. The concordance is conceptualized as a set of bitmaps, in which the bit locations reporesent documents, and the one ...
Abraham Bookstein, Shmuel T. Klein, Timo Raita   +2 more
openaire   +1 more source

Using the Co-occurrence of Words for Retrieval Weighting

Information Retrieval, 2000
Summary: We have applied the well-known Robertson-Sparck Jones weighting to sets of indexing features that are different from word-based features. Our features describe the co-occurrences of words in a window range of predefined size. The experiments have been designed to analyse the value of features that are beyond word-based features but all used ...
Elke Mittendorf, Bojidar Mateev, Peter Schäuble   +2 more
openaire   +2 more sources

Keyword Extraction Using Word Co-Occurrence

2010 Workshops on Database and Expert Systems Applications, 2010
A common strategy to assign keywords to documents is to select the most appropriate words from the document text. One of the most important criteria for a word to be selected as keyword is its relevance for the text. The tf.idf score of a term is a widely used relevance measure.
Christian Wartena, Wout Slakhorst
exaly   +3 more sources

Infinite Words with Well Distributed Occurrences

2013
In this paper we introduce the well distributed occurrences WDO combinatorial property for infinite words, which guarantees good behavior no lattice structure in some related pseudorandom number generators. An infinite word u on a d-ary alphabet has the WDO property if, for each factor w of u, positive integer m, and vector v $\in{\mathbb Z}_{m}^{d}$
Ľubomíra Balková, Michelangelo Bucci, DE LUCA, ALESSANDRO, Svetlana Puzynina   +3 more
openaire   +4 more sources

Separating words by occurrences of subwords

Journal of Applied and Industrial Mathematics, 2014
Summary: We obtain some lower bounds for the complexity of word separation by occurrences of subwords. In the case of length 1 subwords, we show that the bound is exact up to a constant factor. Connection with the problem of separating words by automata is considered.
Vyalyi, M. N., Gimadeev, R. A.
openaire   +1 more source