Home Projects npcpy
npcpy
Python

npcpy

The python library for research and development in NLP, multimodal LLMs, Agents, ML, Knowledge Graphs, and more.

by NPC-Worldwide · GitHub
Stars
Forks
License
Created
Last commit
Category
Language
Likely
Self-hostable
agentsaillmMITPythonSelf-hostable
View on GitHub
In plain words

Develop AI applications using a library that supports various language models and tools for research.

You maintain this project?

Claim its page: indexed whatever its rank, translated into six languages, and enriched with what you write yourself.

Claim this page →
npcpy — GitHub preview card
📈 Star history
1.5k1.4k
2026-07-202026-08-31
📈 Track npcpy

Get an email alert on its next release or when it starts trending — never miss the moment.

Free · no card · unsubscribe anytime
Get email alerts →
📄 About

The python library for research and development in NLP, multimodal LLMs, Agents, ML, Knowledge Graphs, and more.

npcpy has 1.5k stars on GitHub. It has been forked 115 times. npcpy is written mainly in Python. It has been in active development since 2024. npcpy is available under the MIT license. Its main topics are agents, ai, llm, mcp.

Frequently asked questions

What is npcpy?

The python library for research and development in NLP, multimodal LLMs, Agents, ML, Knowledge Graphs, and more.

Is npcpy open source?

npcpy is an open-source project. It is released under the MIT license.

Is npcpy free?

Yes. npcpy is free and open source — you can use, modify and self-host it.

What license does npcpy use?

npcpy is available under the MIT license.

What language is npcpy written in?

npcpy is written mainly in Python.

🏅 Maintainer of this project?
olud.ai badge — npcpy

Add this live badge to your README — your GitHub stars and directory rank, refreshed daily.

[![olud.ai](https://olud.ai/badge.php?tool=npc-worldwide-npcpy)](https://olud.ai/project/npc-worldwide-npcpy.html)
More badge options →
🧬 Shares DNA with🧬 View the DNA map →

Measured from GitHub topics shared by both projects, weighted by how rare each topic is.