Generating algorithms for counting k-grams

Rok Novosel (2016) Generating algorithms for counting k-grams. EngD thesis.

Preview

Abstract

Generative algorithmics is a process of designing and implementing generated algorithms. It belongs in a larger area of algorithm engineering, which deals with experimental evaluation and speedup of algorithms. At the beginning of the thesis we describe both areas and show the basics of generative algorithmics solving parallel prefix scan. For our main problem we choose counting k-grams. First, we implement a general algorithm for counting k-grams against which we will compare the generated algorithms. This was followed by the design and implementation of basic and enhanced generated algorithm. At the end we conducted an experimental evaluation of all the algorithms and verify the effectiveness of generated algorithms. In the last section we discussed the results, potential improvements and opportunities for further exploration.

Item Type:

Thesis (EngD thesis)

Keywords:

algorithm, generating algorithms,k-grams, prefix scan, finite state automatons

Number of Pages:

Language of Content:

Slovenian

Mentor / Comentors:

Name and Surname	ID	Function
doc. dr. Jurij Mihelič	305	Mentor

Link to COBISS:

http://www.cobiss.si/scripts/cobiss?command=search&base=51012&select=(ID=1537107395)

Institution:

University of Ljubljana

Department:

Faculty of Computer and Information Science

Item ID:

3463

Date Deposited:

30 Aug 2016 11:39

Last Modified:

15 Sep 2016 10:04

URI:

http://eprints.fri.uni-lj.si/id/eprint/3463

Actions (login required)

View Item