Index: www/lsmusr.wiki
==================================================================
--- www/lsmusr.wiki
+++ www/lsmusr.wiki
@@ -1322,11 +1322,11 @@
 <ul>
   <li> <p>All database content is stored in a single 
        <a href=#architectural_overview>segment</a>. This makes the
        data structure equivalent to an optimally packed b-tree stucture
        for search operations - minimizing the number of disk sectors that need
-       to be visted when searching the database.
+       to be visited when searching the database.
 
   <li> <p>The database file contains no (or as little as possible) free space.
        In other words, it is no larger than required to contain the single
        segment.
 </ul>
@@ -1344,8 +1344,5 @@
 parameter should be set to a non-zero value or lsm_checkpoint() should be
 called periodically. Otherwise, no checkpoints will be performed, preventing
 the library from reusing any space occupied by old segments even after their
 content has been merged into the new segment. The result - a database file that
 is optimized, except that it is up to twice as large as it otherwise would be.
-
-
-