Merge pull request #85 from imparth7/fix-issue-27791

Fixes Indexes Typo mistakes ( Resolve Issue #27791 )

docs/concepts_indexes.md

@@ -10,7 +10,7 @@ query does not have a covering index for cosine_similarity. See Collection.creat
 
 As each query vector must be checked against every record in the collection. When the number of dimensions and/or number of records becomes large, that becomes extremely slow and computationally expensive.
 
-An index is a heuristic datastructure that pre-computes distances among key points in the vector space. It is smaller and can be traversed more quickly than the whole collection enabling __much__ more performant seraching.
+An index is a heuristic data structure that pre-computes distances between key points in the vector space. It is smaller and can be traversed more quickly than the whole collection enabling much more performant searching.
 
 Only one index may exist per-collection. An index optimizes a collection for searching according to a selected distance measure.