Could you please state some examples of these real-world problems where "almost symmetry" would help?

Face/shape recognition comes to mind, where inexact graph matching would be useful, but are there any others?

I'm not trolling, just interested in graph matching in general as amateur. I have this feeling that there should be many more applications of these techniques, but amusingly, in practice there's always a more specialized, non matching algorithm used. (probably because of matching's algorithm complexity which doesn't scale for larger problems...)