|8 days ago||4 days ago|
|GNU Lesser General Public License v2.1 only||Apache License 2.0|
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Topic modelling with Gensim and SpaCy on startup news
3 projects | dev.to | 17 Jan 2022
For the topic modelling itself, I am going to use Gensim library by Radim Rehurek, which is very developer friendly and easy to use.
Unsupervised Learning for String Matching in Python - can I have advice on how to go about this?
2 projects | reddit.com/r/learnmachinelearning | 16 Dec 2021
Gensim: Topic Modelling for Humans
1 project | news.ycombinator.com | 7 Dec 2021
Gensim – a Python library for topic modelling, document indexing
1 project | news.ycombinator.com | 25 Nov 2021
How to build a search engine with word embeddings
2 projects | dev.to | 22 Nov 2021
We will be using gensim to load our Google News pre-trained word vectors. Find the code for this here.
The unthinking application of this regex-efficiency check wasted our attention
1 project | news.ycombinator.com | 30 Sep 2021
The Levenshtein Distance in Production
4 projects | news.ycombinator.com | 6 Jun 2021
> Problem statement: the Levenshtein distance is a string metric for measuring the difference between two sequences
Another variant is "I have a bunch of words (a dictionary) and one query word, and want to find all words from the dictionary that are close to the query word".
This leads to an interesting class of problems, because you can do clever things where you precompute search structures (Levenshtein automata ) from the dictionary. The similarity queries then run (much) faster – in production, performance matters.
We recently merged a PR like that into Gensim .
This gave a ~1,500x speed-up compared to naively comparing all pairwise strings with Levenshtein distance. A difference between the training step running for years (=unusable) and minutes.
Superior tools to Gensim's similarity
1 project | reddit.com/r/LanguageTechnology | 20 Mar 2021
So Gensim's Similarity module seems like a good fit for this problem, especially soft cosine similarity checking. But inside I can't get comfortable, because transformers are very popular lately.
Koan: A word2vec negative sampling implementation with correct CBOW update
2 projects | news.ycombinator.com | 2 Jan 2021
Apparently it did: https://github.com/RaRe-Technologies/gensim/issues/1873
'y contains previously unseen labels' (label encoder)
1 project | reddit.com/r/pythonhelp | 9 Dec 2021
What are some alternatives?
Prophet - Tool for producing high quality forecasts for time series data that has multiple seasonality with linear or non-linear growth.
MLP Classifier - A handwritten multilayer perceptron classifer using numpy.
tensorflow - An Open Source Machine Learning Framework for Everyone
scikit-learn - scikit-learn: machine learning in Python
Keras - Deep Learning for humans
MLflow - Open source platform for the machine learning lifecycle
catboost - A fast, scalable, high performance Gradient Boosting on Decision Trees library, used for ranking, classification, regression and other machine learning tasks for Python, R, Java, C++. Supports computation on CPU and GPU.
mlpack - mlpack: a scalable C++ machine learning library --
BERTopic - Leveraging BERT and c-TF-IDF to create easily interpretable topics.
LightFM - A Python implementation of LightFM, a hybrid recommendation algorithm.