Hello I have been working on NLP project for that I have to find the common relationship patterns in the two different graphs.
This is one graph
And the other one which is actually a pattern
Both graph has the common relationship pattern i.e., NN<-[:nsubj]-AUX->[:dobj].So,how to match with this similarity and show that the graph1 matches the graph2 patterns?
Could anyone know about this please?
I tried the adjacency matrix concept but it didn't work out.