diff --git a/jscomp/others/bs_Array.mli b/jscomp/others/bs_Array.mli
index 820d50dc90..42af2d8ec2 100644
--- a/jscomp/others/bs_Array.mli
+++ b/jscomp/others/bs_Array.mli
@@ -77,7 +77,7 @@ val fill: 'a array -> offset:int -> len:int -> 'a -> unit
 
     [offset] can be negative,
     [fill arr offset:(-1) len:1 ] means fill the last element,
-    if the arry does not have enogh data, [fill] will ignore it
+    if the array does not have enough data, [fill] will ignore it
  *)
 
 val blit: 
diff --git a/jscomp/others/bs_Map.mli b/jscomp/others/bs_Map.mli
index ff8094a145..4232adcf93 100644
--- a/jscomp/others/bs_Map.mli
+++ b/jscomp/others/bs_Map.mli
@@ -19,19 +19,19 @@ type ('key, 'id ) dict = ('key, 'id) Bs_Dict.comparable
 (** The data associated with a comparison function *)   
 
 (*
-    How we remain soundness:
+    How we retain soundness:
     The only way to create a value of type [_ t] from scratch 
     is through [empty] which requires [_ Bs_Dict.t]
     The only way to create [_ Bs_Dict.t] is using [Bs_Dict.Make] which
     will create a fresh type [id] per module
 
-    Generic operations over tree without [cmp] is still exported 
-    (for efficient reaosns) so that [data] does not need be boxed and unboxed.
+    Generic operations over tree without [cmp] are still exported 
+    (for efficient reasons) so that [data] does not need be boxed and unboxed.
 
-    The soundness is guarantted in two aspects:
+    The soundness is guaranteed in two aspects:
     When create a value of [_ t] it needs both [_ Bs_Dict.t] and [_ t0].
     [_ Bs_Dict.t] is an abstract type. Note [add0] requires [_ Bs_Dict.cmp] which 
-    is also an abtract type which can only come from [_ Bs_Dict.t]
+    is also an abstract type which can only come from [_ Bs_Dict.t]
 
     When destructing a value of [_ t], the ['id] parameter is threaded.
 
diff --git a/jscomp/others/bs_Queue.ml b/jscomp/others/bs_Queue.ml
index 2cb54b417f..bbfce906f7 100644
--- a/jscomp/others/bs_Queue.ml
+++ b/jscomp/others/bs_Queue.ml
@@ -13,7 +13,7 @@
 (*   special exception on linking described in the file LICENSE.          *)
 (*                                                                        *)
 (**************************************************************************)
-(* Adapted siginifcantly by BuckleScript Authors                          *)
+(* Adapted significantly by BuckleScript Authors                          *)
 module A = Bs_Array
 
 type 'a node = { 
diff --git a/jscomp/others/bs_Queue.mli b/jscomp/others/bs_Queue.mli
index 4ad0413728..10baf63998 100644
--- a/jscomp/others/bs_Queue.mli
+++ b/jscomp/others/bs_Queue.mli
@@ -12,7 +12,7 @@
 (*   special exception on linking described in the file LICENSE.          *)
 (*                                                                        *)
 (**************************************************************************)
-(* Adapted siginifcantly by BuckleScript Authors *)
+(* Adapted significantly by BuckleScript Authors *)
 (** First-in first-out queues.
 
     This module implements queues (FIFOs), with in-place modification.
diff --git a/jscomp/others/bs_SortArray.mli b/jscomp/others/bs_SortArray.mli
index 4fec34378f..9f292d7a42 100644
--- a/jscomp/others/bs_SortArray.mli
+++ b/jscomp/others/bs_SortArray.mli
@@ -38,7 +38,7 @@ val strictlySortedLength:
 
 val isSorted: 'a array -> ('a -> 'a -> int [@bs]) -> bool
 (** [isSorted arr cmp]  
-    returns true if array is increeasingly sorted 
+    returns true if array is increasingly sorted 
    , equal is okay 
    for example 
    {[
@@ -92,7 +92,7 @@ val binarySearchBy:
   (the index of the last element plus 1)
 
   for example, if [key] is smaller than all elements return [-1] since [lnot (-1) = 0]
-  if [key] is largeer than all elements return [- (len + 1)] since [lnot (-(len+1)) = len]
+  if [key] is larger than all elements return [- (len + 1)] since [lnot (-(len+1)) = len]
 
 *)
 
diff --git a/jscomp/others/bs_SortArrayInt.mli b/jscomp/others/bs_SortArrayInt.mli
index 8a3feca8c4..b5cc8ed5c6 100644
--- a/jscomp/others/bs_SortArrayInt.mli
+++ b/jscomp/others/bs_SortArrayInt.mli
@@ -57,7 +57,7 @@ val binarySearch: element array -> element -> int
   (the index of the last element plus 1)
 
   for example, if [key] is smaller than all elements return [-1] since [lnot (-1) = 0]
-  if [key] is largeer than all elements return [- (len + 1)] since [lnot (-(len+1)) = len]
+  if [key] is larger than all elements return [- (len + 1)] since [lnot (-(len+1)) = len]
 
 *)  
 
diff --git a/jscomp/others/bs_SortArrayString.mli b/jscomp/others/bs_SortArrayString.mli
index 72339b5509..4143b40175 100644
--- a/jscomp/others/bs_SortArrayString.mli
+++ b/jscomp/others/bs_SortArrayString.mli
@@ -57,7 +57,7 @@ val binarySearch: element array -> element -> int
   (the index of the last element plus 1)
 
   for example, if [key] is smaller than all elements return [-1] since [lnot (-1) = 0]
-  if [key] is largeer than all elements return [- (len + 1)] since [lnot (-(len+1)) = len]
+  if [key] is larger than all elements return [- (len + 1)] since [lnot (-(len+1)) = len]
 
 *)  
 
diff --git a/jscomp/others/sort.cppo.mli b/jscomp/others/sort.cppo.mli
index 641211d110..cb091bc827 100644
--- a/jscomp/others/sort.cppo.mli
+++ b/jscomp/others/sort.cppo.mli
@@ -60,7 +60,7 @@ val binarySearch: element array -> element -> int
   (the index of the last element plus 1)
 
   for example, if [key] is smaller than all elements return [-1] since [lnot (-1) = 0]
-  if [key] is largeer than all elements return [- (len + 1)] since [lnot (-(len+1)) = len]
+  if [key] is larger than all elements return [- (len + 1)] since [lnot (-(len+1)) = len]
 
 *)