Knowledge Graphs

Exercise 1.4 - Knowledge Graph Concepts

Identify if the following statements are true or false.

a. If word embeddings of two words show high similarity, they are likely to be synonyms.
b. A word embedding calculation views the text as a knowledge graph.
c. A sentence is to a word embedding as a path is to a graph embedding.
d. Edge detection is to computer vision as relation extraction is to NLP.
e. Calculating similarity using word embeddings is always better than using hand curated sources.