Sign up to save tools and stay up to date with the latest in AI
bg
bg
1

LLM now provides tools for working with embeddings

Sep 04, 2023 - simonwillison.net
LLM, a Python library and command-line tool for working with language models, has released version 0.9 with new features for working with embeddings. The update includes several command-line tools and a new Python API for working with embeddings in your own code. It also supports the installation of additional embedding models via plugins. The new release introduces the concept of a "collection" of embeddings, which contains a set of embeddings, each with an ID and an embedding vector. All embeddings in a collection are generated by the same model to ensure comparability. The update also includes a new plugin, llm-cluster, which allows users to cluster content and identify patterns in a corpus of documents.

Future plans for LLM include indexing and chunking. Indexing will speed up the process of calculating a cosine difference between an input vector and every other embedding in the collection. Chunking will improve the process of building an embeddings-based search engine by being smarter about what to embed. The potential scope of the LLM project is vast, and the developers are encouraging users to get involved by testing plugins, building new ones, and sharing their creations.

Key takeaways:

  • LLM is a Python library and command-line tool for working with language models, and its latest version, LLM 0.9, has new features for working with embeddings.
  • Embeddings are a way to convert text into an array of floating point numbers, or an embedding vector, which can be used to measure semantic similarity between texts.
  • LLM 0.9 introduces the concept of a collection of embeddings, where all embeddings in a collection are generated by the same model to ensure comparability.
  • LLM also provides command-line tools and a Python API for working with embeddings, and has a new plugin, llm-cluster, for clustering content using embeddings.
View Full Article

Comments (0)

Be the first to comment!