diff --git a/legacy/eina/src/include/eina_accessor.h b/legacy/eina/src/include/eina_accessor.h
index b701bbc178..531e6a60c8 100644
--- a/legacy/eina/src/include/eina_accessor.h
+++ b/legacy/eina/src/include/eina_accessor.h
@@ -247,7 +247,7 @@ EAPI void  eina_accessor_over(Eina_Accessor *accessor,
  * @param accessor The accessor.
  * @return #EINA_TRUE on success, #EINA_FALSE otherwise.
  *
- * If the container of the @p accessor permit it, it will be locked.
+ * If the container of the @p accessor permits it, it will be locked.
  * If @p accessor is @c NULL or if a problem occurred, #EINA_FALSE is
  * returned, otherwise #EINA_TRUE is returned. If the container
  * is not lockable, it will return EINA_TRUE.
@@ -260,7 +260,7 @@ EAPI Eina_Bool eina_accessor_lock(Eina_Accessor *accessor) EINA_ARG_NONNULL(1);
  * @param accessor The accessor.
  * @return #EINA_TRUE on success, #EINA_FALSE otherwise.
  *
- * If the container of the @p accessor permit it and was previously
+ * If the container of the @p accessor permits it and was previously
  * locked, it will be unlocked. If @p accessor is @c NULL or if a
  * problem occurred, #EINA_FALSE is returned, otherwise #EINA_TRUE
  * is returned. If the container is not lockable, it will return
diff --git a/legacy/eina/src/include/eina_array.h b/legacy/eina/src/include/eina_array.h
index ff0c7acebb..5c4dde3092 100644
--- a/legacy/eina/src/include/eina_array.h
+++ b/legacy/eina/src/include/eina_array.h
@@ -153,7 +153,7 @@
  *
  * The usual features of an array are classic ones: to append an
  * element, use eina_array_push() and to remove the last element, use
- * eina_array_pop(). To retrieve the element at a given positin, use
+ * eina_array_pop(). To retrieve the element at a given position, use
  * eina_array_data_get(). The number of elements can be retrieved with
  * eina_array_count_get().
  *
diff --git a/legacy/eina/src/include/eina_hash.h b/legacy/eina/src/include/eina_hash.h
index 46204ba718..83d1f73e0d 100644
--- a/legacy/eina/src/include/eina_hash.h
+++ b/legacy/eina/src/include/eina_hash.h
@@ -146,7 +146,7 @@
  * (argument of @ref eina_hash_new too). The following picture ilustrates the
  * basic idea:
  *
- * @image html 01_hash-table.png
+ * <img src="01_hash-table.png" width="500" />
  * @image latex 01_hash-table.eps
  *
  * Adding an element to the hash table is made of:
diff --git a/legacy/eina/src/include/eina_iterator.h b/legacy/eina/src/include/eina_iterator.h
index 3eba53ba23..79403aa190 100644
--- a/legacy/eina/src/include/eina_iterator.h
+++ b/legacy/eina/src/include/eina_iterator.h
@@ -252,7 +252,7 @@ EAPI void eina_iterator_foreach(Eina_Iterator *iterator,
  * @param iterator The iterator.
  * @return #EINA_TRUE on success, #EINA_FALSE otherwise.
  *
- * If the container of the @p iterator permit it, it will be locked.
+ * If the container of the @p iterator permits it, it will be locked.
  * If @p iterator is @c NULL or if a problem occurred, #EINA_FALSE is
  * returned, otherwise #EINA_TRUE is returned. If the container
  * is not lockable, it will return EINA_TRUE.
@@ -265,7 +265,7 @@ EAPI Eina_Bool eina_iterator_lock(Eina_Iterator *iterator) EINA_ARG_NONNULL(1);
  * @param iterator The iterator.
  * @return #EINA_TRUE on success, #EINA_FALSE otherwise.
  *
- * If the container of the @p iterator permit it and was previously
+ * If the container of the @p iterator permits it and was previously
  * locked, it will be unlocked. If @p iterator is @c NULL or if a
  * problem occurred, #EINA_FALSE is returned, otherwise #EINA_TRUE
  * is returned. If the container is not lockable, it will return
diff --git a/legacy/eina/src/include/eina_list.h b/legacy/eina/src/include/eina_list.h
index 349870e669..7985081eaf 100644
--- a/legacy/eina/src/include/eina_list.h
+++ b/legacy/eina/src/include/eina_list.h
@@ -752,7 +752,7 @@ EAPI void                 *eina_list_nth(const Eina_List *list, unsigned int n)
  * @return The list node stored in the numbered element.
  *
  * This function returns the list node of element number @p n, in
- * @ list. The first element in the array is element number 0. If the
+ * @p list. The first element in the array is element number 0. If the
  * element number @p n does not exist or @p list is @c NULL or @p n is
  * greater than the count of elements in @p list minus 1, @c NULL is
  * returned. Otherwise the list node stored in the numbered element is
@@ -868,7 +868,7 @@ EAPI Eina_List            *eina_list_sort(Eina_List *list, unsigned int size, Ei
  * @param right Tail list to merge.
  * @return A new merged list.
  *
- * This function put right at the end of left and return the head.
+ * This function puts right at the end of left and return the head.
  *
  * Both left and right does not exist anymore after the merge.
  *
@@ -888,7 +888,7 @@ EAPI Eina_List            *eina_list_merge(Eina_List *left, Eina_List *right) EI
  * nodes.
  * @return A new sorted list.
  *
- * This function compare the head of @p left and @p right, and choose the
+ * This function compares the head of @p left and @p right, and choose the
  * smallest one to be head of the returned list. It will continue this process
  * for all entry of both list.
  *
@@ -925,7 +925,7 @@ EAPI Eina_List            *eina_list_sorted_merge(Eina_List *left, Eina_List *ri
  * @param right The head of the new right list.
  * @return The new left list
  *
- * This function split @p list into two lists ( left and right ) after the node @p relative. @p Relative
+ * This function splits @p list into two lists ( left and right ) after the node @p relative. @p Relative
  * will become the last node of the left list. If @p list or @p right are NULL list is returns.
  * If @p relative is NULL right is set to @p list and NULL is returns.
  * If @p relative is the last node of @p list list is returns and @p right is set to NULL.