«Theodoros Tokis is a high level professional. Talented with many skills. I highly recommend him to LinkedIn.»
Σχετικά με εμάς
With over 13 years of experience as a web engineer and entrepreneur, I am passionate…
Δραστηριότητα
-
I’m excited to be heading to Dublin for UXDX from October 9 to 11! 🎉 If you’re around or attending, it would be great to meet up. Let’s grab a…
I’m excited to be heading to Dublin for UXDX from October 9 to 11! 🎉 If you’re around or attending, it would be great to meet up. Let’s grab a…
Άρεσε στον χρήστη Teo Tokis
-
Som UI-designer arbejder jeg ud fra en kombination mellem best practice og indsigter fra brugerne. Den sidste del kan af og til være ret besværlig og…
Som UI-designer arbejder jeg ud fra en kombination mellem best practice og indsigter fra brugerne. Den sidste del kan af og til være ret besværlig og…
Άρεσε στον χρήστη Teo Tokis
Εμπειρία
Εκπαίδευση
Άδειες και πιστοποιήσεις
Δημοσιεύσεις
-
Handling Weighted Sequences Employing Inverted Files and Suffix Trees
10th International Conference on Web Information Systems and Technologies (WEBIST 2014)
In this paper, we address the problem of handling weighted sequences. This is by taking advantage of the inverted files machinery and targeting text processing applications, where the involved documents cannot be separated into words (such as texts representing biological sequences) or word separation is difficult and involves extra linguistic knowledge (texts in Asian languages). Besides providing a handling of weighted sequences using n-grams, we also provide a study of constructing space…
In this paper, we address the problem of handling weighted sequences. This is by taking advantage of the inverted files machinery and targeting text processing applications, where the involved documents cannot be separated into words (such as texts representing biological sequences) or word separation is difficult and involves extra linguistic knowledge (texts in Asian languages). Besides providing a handling of weighted sequences using n-grams, we also provide a study of constructing space efficient n-gram inverted indexes. The proposed techniques combine classic straightforward n-gram indexing, with the recently proposed two-level n-gram inverted file technique. The final outcomes are new data structures for n-gram indexing, which perform better in terms of space consumption than the existing ones. Our experimental results are encouraging and depict that these techniques can surely handle n-gram indexes more space efficiently than already existing methods.
Ληφθείσες συστάσεις
1 Το άτομο έχει συστήσει Teo
Εγγραφείτε τώρα για να δείτε