We demonstrate the usefulness of the structured representations in two important tasks: entity resolution and relation extraction.
we compute structural similarity c(i, j) of a pair of mentions (i, j) as the edit distance of their structures, S i and S j .