| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | * Use binary tree in tokenizers, that would provide us fast checking for ↵ | Vsevolod Stakhov | 2008-12-04 | 1 | -6/+6 |
| | | | | | unique tokens and have O(log n) difficulty | ||||
| * | * Add learning interface to rspamd (still requires classifier to work) | Vsevolod Stakhov | 2008-12-02 | 1 | -0/+15 |
| | | |||||
| * | * Add simple implementation of OSB tokenizer | Vsevolod Stakhov | 2008-11-07 | 1 | -0/+29 |
 |
index : rspamd.git | |
| Rapid spam filtering system: https://github.com/rspamd/rspamd | www-data |
| aboutsummaryrefslogtreecommitdiffstats |