Results 21 to 30 of about 18,622 (258)

PFP Compressed Suffix Trees [PDF]

open access: yes, 2021
Prefix-free parsing (PFP) was introduced by Boucher et al. (2019) as a preprocessing step to ease the computation of Burrows-Wheeler Transforms (BWTs) of genomic databases. Given a string S, it produces a dictionary D and a parse P of overlapping phrases such that BWT(S) can be computed from D and P in time and workspace bounded in terms of their ...
Boucher C.   +6 more
openaire   +2 more sources

Intent Arabic text categorisation based on different machine learning and term frequency

open access: yesIET Networks, EarlyView., 2022
Abstract The complexity of Internet network configurations has made managing networks a complicated undertaking. Intent‐Based Networking (IBN) is a potential solution to this issue. In contrast to conventional networks, where a concrete description of the settings typically conveys a network administrator's goal kept on each device, an administrator's ...
Mohammad Fadhil Mahdi   +1 more
wiley   +1 more source

RANCANG BANGUN APLIKASI PENCARIAN DOKUMEN BERBASIS WEB MENGGUNAKAN METODE SUFFIX CACTUS CLUSTERING

open access: yesJUTI: Jurnal Ilmiah Teknologi Informasi, 2003
Salah satu bagian dari temu kembali (retrieval) informasi adalah menyajikan data hasil pencarian dengan cara mengelompokkan (clustering) seluruh dokumen hasil pencarian sesuai dengan kemiripan antar dokumen.
F. X. Arunanto, Agus Widodo
doaj   +1 more source

Relative Suffix Trees [PDF]

open access: yesThe Computer Journal, 2017
Accepted to The Computer Journal.
Farruggia, Andrea   +4 more
openaire   +5 more sources

Hungarian gyerekestül vs. gyerekkel (‘with [the] kid’)

open access: yesHungarian Cultural Studies, 2016
The paper analyzes the various uses of the Hungarian -stUl (‘together with’, ‘along with’) sociative (associative) suffix (later in the paper referred to simply as “sociative”), as in the example gyerekestül.
István Fekete
doaj   +1 more source

Sliding Suffix Tree [PDF]

open access: yesAlgorithms, 2018
We consider a sliding window W over a stream of characters from some alphabet of constant size. We want to look up a pattern in the current sliding window content and obtain all positions of the matches. We present an indexed version of the sliding window, based on a suffix tree.
Brodnik, Andrej, Jekovec, Matevž
openaire   +2 more sources

On the Functional Analysis of Morphemes or How Many -ушк- (-ushk-) Suffixes There Are in the Russian Language [PDF]

open access: yesУченые записки Казанского университета: Серия Гуманитарные науки, 2016
The paper is devoted to the important linguistic problem – the search of criteria to differentiate between homonymic morphemes. This problem is associated with the need to reveal the features of the evaluative suffix -ушк- (-ushk-) as one of the striking
V.A. Kosova, E.A. Makleeva
doaj  

De la localisation à l’évaluation : des verbes préfixés évaluatifs au sens bien particulier

open access: yesCorela, 2012
In French, evaluative morphology can result from two different derivational processes, prefixation and suffixation; prefixes such as suffixes forming important paradigms.
Dany Amiot
doaj   +1 more source

Clitic Doubling and Dislocation of Direct Object based on Evidence from Kalhori Kurdish [PDF]

open access: yes̒Ilm-i Zabān, 2020
The present study aimed at investigating clitic doubling in Kalhori Kurdish. The implications of clitic doubling for Kurdish syntax were also investigated.
Sara Ahmadi, Habib Gohari
doaj   +1 more source

The History of -eer in English: Suffix Competition or Symbiosis?

open access: yesLanguages
Ecological models of competition have provided great explanatory power regarding synonymy in derivational morphology. Competition models of this type have certainly shown their utility, as they have demonstrated, among other things, the relevance of ...
Zachary Dukic, Chris C. Palmer
doaj   +1 more source

Home - About - Disclaimer - Privacy