Over the past year several researchers gave talks proposing the use of embedding models for measuring code similarity. At least four different embedding models are currently available, however there has not been an evaluation of these methods. In this talk I will provide an overview of the four methods, as well as a comparison of their computational complexity. I will also attempt to measure how well these embeddings encode interesting information by comparing the similarity of the embeddings generated between systems.