One of the central problems in information retrieval is that of finding the k documents in a large text collection that best match a query given by a user. A recent result of Navarro & Nekrich (SODA 2012) showed that single term and phrase queries of length m can be solved in optimal O(m + k) time using a linear word sized index. While a verbatim implementation of the index would be at least an...

This paper describes how recently developed techniques for suffix array construction and compression can be expanded to bring a new data structure, called parallel suffix array, into existence, which is suitable as an in-memory representation of large annotated corpora, enabling complex queries and fast extractions of the context of matching substrings. It is also shown how parallel suffix arra...

This paper introduces a generalization of the operation of catenation: u[k]lv, the left-k-insertion, is the set of all words obtained by inserting v into u in positions that are at most k letters away from the left extremity of the word u. We define k-suffix codes using the left-kinsertion operation and extend the concept of k-prefix and k-suffix codes to involution k-prefix and involution k-su...

Machine translation has been a major motivation of development in natural language processing. Despite the burgeoning achievements creating more efficient machine systems, thanks to deep learning methods, parallel corpora have remained indispensable for progress field. In an attempt create Kurdish language, this article, we describe our approach retrieving potentially alignable news articles fr...

Discourse particles constitute an important part of spoken language; they have a wide range pragmatic functions in interactional contexts. The object the present paper is to introduce Kurdish discourse particles, clarify their different contexts, and briefly sketch some aspects grammatical properties. I will focus on Sorani since this dialect has rich inventory that not so far been investigated...

Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments against widespread usage of the structure is its space requirement. This paper describes a new structure called suffix vector, which is not only better in terms of storage space but also simpler than the most efficient suffix tree representation known to date. Alternativ...

Suffix-trees are popular indexing structures for various sequence processing problems in biological data management. We investigate here the possibility of enhancing the search efficiency of disk-resident suffix-trees through customized layouts of tree-nodes to disk-pages. Specifically, we propose a new layout strategy, called Stellar, that provides significantly improved search performance on ...

A factorisation x = u 1 2 ? $x u_1 u_2 \cdots$ of an infinite word $x$ on alphabet X $X$ is called ‘monochromatic’, for a given colouring the finite words ? $X^*$ , if each i $u_i$ same colour. Wojcik and Zamboni proved that periodic only every there monochromatic . On other hand, it follows from Ramsey's theorem that, any suffix having factorisation. ‘super-monochromatic’ k n $u_{k_1} u_{k_2} ...