diff --git a/thesis.tex b/thesis.tex
index 4c94fac..b465250 100644
--- a/thesis.tex
+++ b/thesis.tex
@@ -60,16 +60,10 @@
     advisor     = {prof. RNDr. Ivana Černá, CSc.},
     title       = {Rank-Balanced Trees},
     TeXtitle    = {Rank-Balanced Trees},
-    keywords    = {algorithms, data structures, rank, trees, balanced trees, study material, visualization, ...},
-    TeXkeywords = {algorithms, data structures, rank, trees, balanced trees, study material, visualization, \ldots},
+    keywords    = {algorithms, data structures, rank, trees, balanced trees, study material, visualization, AVL, WAVL},
+    TeXkeywords = {algorithms, data structures, rank, trees, balanced trees, study material, visualization, AVL, WAVL},
     abstract    = {%
-      In the thesis we demonstrate usage of a rank for implementing balanced binary-search trees
-      and algorithms related to a specific rank-balanced tree, the weak AVL tree. First part
-      of the thesis consists of description of the rank-balanced tree followed by a comparison
-      to other balanced trees that can be implemented using rank, diagrams and pseudo-codes related
-      to the weak AVL tree. We also present an implementation of the weak AVL tree in Python, tested with a
-      property-based testing. The final part of the thesis is a web-page that allows performing operations
-      on the weak AVL tree with animations and step-by-step walk-through of a pseudo-code.
+      In this bachelor thesis, we demonstrate the usage of a rank for implementing balanced binary search trees and algorithms related to a specific rank-balanced tree, the weak AVL tree. In the first part of the thesis, we present commonly used balanced search trees. In the second part, we describe the rank-balanced tree, followed by a comparison to other balanced trees that can be implemented using rank, and also diagrams and pseudocodes related to the weak AVL tree. We also present an implementation of the weak AVL tree in Python, tested with property-based testing. The final part of the thesis is a web page that allows performing operations on the weak AVL tree with animations and a step-by-step walkthrough of pseudocode.
     },
     thanks      = {%
       \textit{TBD}