It is elementary set theory really. You know what is a reflexive relation, what is a symmetric relation, and what is a transitive relation, right? An equivalence relation is one that satisfies all three of those properties.
You have probably heard of the "transitive closure" of a relation $R$? Well, it is nothing but the least transitive relation that includes $R$. That is what the term "closure" means. Similarly, you can talk about the "symmetric closure" of a relation $R$, the "reflexive closure" of a relation $R$ and the "equivalence closure" of a relation $R$ in exactly the same way.
With some thought, you can convince yourself that the transitive closure of $R$ is $R \cup R^2 \cup R^3 \cup \ldots$. The symmetric closure is $R \cup R^{-1}$. The reflexive closure is $R \cup I$ (where $I$ is the identity relation).
We use the notation $R^*$ for $I \cup R \cup R^2 \cup \ldots$. This is the reflexive transitive closure of $R$. Now notice that if $R$ is symmetric, each of the relations $I$, $R$, $R^2$, $R^3$, ... is symmetric. Hence $R^*$ will also be symmetric.
So the equivalence closure of $R$ is the transitive closure of its symmetric closure, i.e., $(R \cup R^{-1})^*$. This represents a sequence of steps, some of which are forward steps ($R$) and some backward steps ($R^{-1}$).
The relation $R$ is said to have the Church-Rosser property if the equivalence closure is the same as the composite relation $R^* (R^{-1})^*$. This represents a sequence of steps in which all the forward steps come first, followed by all backward steps. So, the Church-Rosser property says that any interleaving of forward and backward steps can be equivalently carried out by doing forward steps first and backward steps later.