Home Projects raptor
raptor
Python

raptor

The official implementation of RAPTOR: Recursive Abstractive Processing for Tree-Organized Retrieval

by parthsarthi03 · GitHub
Stars
Forks
License
Created
Last commit
Category
Language
agentsclusteringframeworkMITPython
View on GitHub
In plain words

Retrieve information from large texts more effectively by organizing documents in a tree structure.

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 →
raptor — GitHub preview card
📈 Star history
1.8k1.7k
2026-07-202026-08-31
📈 Track raptor

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 official implementation of RAPTOR: Recursive Abstractive Processing for Tree-Organized Retrieval

raptor has 1.8k stars on GitHub. It has been forked 234 times. raptor is written mainly in Python. It has been in active development since 2024. raptor is available under the MIT license. Its main topics are agents, clustering, framework, language-model.

Frequently asked questions

What is raptor?

The official implementation of RAPTOR: Recursive Abstractive Processing for Tree-Organized Retrieval

Is raptor open source?

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

Is raptor free?

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

What license does raptor use?

raptor is available under the MIT license.

What language is raptor written in?

raptor is written mainly in Python.

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

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

[![olud.ai](https://olud.ai/badge.php?tool=parthsarthi03-raptor)](https://olud.ai/project/parthsarthi03-raptor.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.