removed LRU from the docstring, will be implemented later

notebooks/en/semantic_cache_chroma_vector_database.ipynb

@@ -896,7 +896,7 @@
         "Looking at the structure of the cache, the implementation of FIFO seemed straightforward. Whenever a new question-answer pair is added to the cache, it's appended to the end of the lists. Thus, the oldest (first-in) items are at the front of the lists. When the cache reaches its maximum size and you need to evict an item, you remove (pop) the first item from each list. This is the FIFO eviction policy. \n",
         "\n",
         "\n",
-        "However, for LRU (Least-Recently-Used), the implementation is more complex because this policy requires knowledge of when each item in the cache was last accessed. \n"
+        "Another eviction policy is the Least Recently Used (LRU) policy, which is more complex because it requires knowledge of when each item in the cache was last accessed. However, this policy is not yet available and will be implemented later.\n"
       ]
     },
     {
@@ -924,7 +924,7 @@
         "    thresold (float): The threshold for the Euclidean distance to determine if a question is similar.\n",
         "    max_response (int): The maximum number of responses the cache can store.\n",
         "    eviction_policy (str): The policy for evicting items from the cache. \n",
-        "                            This can be 'LRU' (Least Recently Used) or 'FIFO' (First In First Out).\n",
+        "                            This can be any policy, but 'FIFO' (First In First Out) has been implemented for now.\n",
         "                            If None, no eviction policy will be applied.\n",
         "    \"\"\"\n",
         "       \n",