From d4f94546fd3d43438591b44f04ef15a8aac49a7b Mon Sep 17 00:00:00 2001
From: Marcin Chrzanowski <mc370754@students.mimuw.edu.pl>
Date: Wed, 24 Nov 2021 15:47:17 +0100
Subject: Fix wording

---
 mgr.tex | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

(limited to 'mgr.tex')

diff --git a/mgr.tex b/mgr.tex
index 89f6c2d..d639355 100644
--- a/mgr.tex
+++ b/mgr.tex
@@ -98,9 +98,9 @@ tree.
 \section{Main result}
 
 We will improve on the above method even further showing an algorithm that,
-after linear preprocessing of the tree can answer questions in time linearithmic
-with respect to the question size. In particular, we eliminate any dependence on
-tree size during question answering.
+after linear preprocessing of the tree we can answer questions in time
+linearithmic with respect to the question size. In particular, we eliminate any
+dependence on tree size during question answering.
 
 More explicitly, we will show how to solve Problem
 \ref{mso-query-answering-problem}, with a preprocessing algorithm working in
@@ -180,7 +180,7 @@ The rest of our work is organized in the following way:
 
 \begin{itemize}
     \item In Chapter \ref{preliminaries} we introduce definitions and
-        existing algorithms we will use to arrive at our main result.
+        known algorithms we will use to arrive at our main result.
         \begin{itemize}
             \item In particular, Section \ref{query-answering-problems} serves
                 as a short review of some fundamental algorithms for solving
-- 
cgit v1.2.3

