Improve performance of the Word Embedding algorithm

The running time of the algorithm is very high which can be bad for real life applications. Is there any better performing algorithm available?

Hey @ankur_shuklauR9, yes there is complexity issue with this, it takes a lot of time, one thing you can do is, use pca etc dimensionality reduction techniques to reduce the feature size for each word, but to find the analogy there is no other way but to iterate over all words. and calcualte the distance.

Hope this resoslved your doubt.
Plz mark the doubt as resolved in my doubts section. :blush: