forked from ezimuel/PHPVector
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathIndex.php
More file actions
270 lines (228 loc) · 7.87 KB
/
Index.php
File metadata and controls
270 lines (228 loc) · 7.87 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
<?php
declare(strict_types=1);
namespace PHPVector\BM25;
use PHPVector\Document;
use PHPVector\SearchResult;
/**
* BM25 (Okapi BM25) inverted-index for full-text search.
*
* Data structures:
* $invertedIndex[term][docId] = term frequency (count of term in document)
* $docLengths[docId] = number of tokens in the document
* $totalTokens = running sum used to compute avgdl
*
* All document IDs used internally are the integer node-IDs assigned by
* VectorDatabase (not the user-visible Document::$id).
*/
final class Index
{
/**
* Inverted index: term → [nodeId → termFrequency]
* @var array<string, array<int, int>>
*/
private array $invertedIndex = [];
/**
* Per-document token counts.
* @var array<int, int>
*/
private array $docLengths = [];
/** Running sum of all document lengths (used for avgdl). */
private int $totalTokens = 0;
/** @var array<int, Document> nodeId → Document */
private array $documents = [];
public function __construct(
private readonly Config $config = new Config(),
private readonly TokenizerInterface $tokenizer = new SimpleTokenizer(),
) {}
// ------------------------------------------------------------------
// Public API
// ------------------------------------------------------------------
/**
* Index a document.
*
* @param int $nodeId Internal node-ID used to correlate with the HNSW index.
* @param Document $document Document to index.
*/
public function addDocument(int $nodeId, Document $document): void
{
if ($document->text === null || $document->text === '') {
return;
}
$tokens = $this->tokenizer->tokenize($document->text);
if (empty($tokens)) {
return;
}
$this->documents[$nodeId] = $document;
$this->docLengths[$nodeId] = count($tokens);
$this->totalTokens += count($tokens);
// Count per-term frequencies for this document.
$termFreqs = array_count_values($tokens);
foreach ($termFreqs as $term => $tf) {
$this->invertedIndex[$term][$nodeId] = $tf;
}
}
/**
* Search the index and return scored documents.
*
* @param string $query Raw query text.
* @param int $k Maximum number of results.
*
* @return SearchResult[] Sorted by score descending.
*/
public function search(string $query, int $k = 10): array
{
if (empty($this->documents)) {
return [];
}
$queryTokens = $this->tokenizer->tokenize($query);
if (empty($queryTokens)) {
return [];
}
$numDocs = count($this->documents);
$avgDl = $this->totalTokens / $numDocs;
$scores = [];
// Deduplicate query tokens to avoid summing the same IDF twice.
foreach (array_unique($queryTokens) as $term) {
if (!isset($this->invertedIndex[$term])) {
continue;
}
$postings = $this->invertedIndex[$term];
$df = count($postings);
// Smoothed IDF (Robertson–Jones with +1 to keep positive for common terms).
$idf = log(($numDocs - $df + 0.5) / ($df + 0.5) + 1.0);
foreach ($postings as $nodeId => $tf) {
$dl = $this->docLengths[$nodeId];
$k1 = $this->config->k1;
$b = $this->config->b;
// BM25 term-frequency normalisation.
$tfNorm = ($tf * ($k1 + 1.0))
/ ($tf + $k1 * (1.0 - $b + $b * $dl / $avgDl));
$scores[$nodeId] = ($scores[$nodeId] ?? 0.0) + $idf * $tfNorm;
}
}
if (empty($scores)) {
return [];
}
arsort($scores);
$results = [];
$rank = 1;
foreach (array_slice($scores, 0, $k, true) as $nodeId => $score) {
$results[] = new SearchResult(
document: $this->documents[$nodeId],
score: $score,
rank: $rank++,
);
}
return $results;
}
/**
* Return the raw BM25 scores for a query without wrapping in SearchResult.
* Used by VectorDatabase for hybrid score fusion.
*
* @return array<int, float> nodeId → BM25 score (sorted descending)
*/
public function scoreAll(string $query): array
{
if (empty($this->documents)) {
return [];
}
$queryTokens = $this->tokenizer->tokenize($query);
if (empty($queryTokens)) {
return [];
}
$numDocs = count($this->documents);
$avgDl = $this->totalTokens / $numDocs;
$scores = [];
foreach (array_unique($queryTokens) as $term) {
if (!isset($this->invertedIndex[$term])) {
continue;
}
$postings = $this->invertedIndex[$term];
$df = count($postings);
$idf = log(($numDocs - $df + 0.5) / ($df + 0.5) + 1.0);
foreach ($postings as $nodeId => $tf) {
$dl = $this->docLengths[$nodeId];
$k1 = $this->config->k1;
$b = $this->config->b;
$tfNorm = ($tf * ($k1 + 1.0))
/ ($tf + $k1 * (1.0 - $b + $b * $dl / $avgDl));
$scores[$nodeId] = ($scores[$nodeId] ?? 0.0) + $idf * $tfNorm;
}
}
arsort($scores);
return $scores;
}
/** Number of documents currently indexed. */
public function count(): int
{
return count($this->documents);
}
/**
* Remove a document from the index.
*
* @param int $nodeId Internal node-ID of the document to remove.
* @return bool True if the document was removed, false if it didn't exist.
*/
public function removeDocument(int $nodeId): bool
{
if (!isset($this->documents[$nodeId])) {
return false;
}
// Update totalTokens.
if (isset($this->docLengths[$nodeId])) {
$this->totalTokens -= $this->docLengths[$nodeId];
unset($this->docLengths[$nodeId]);
}
// Remove from inverted index.
foreach ($this->invertedIndex as $term => &$postings) {
unset($postings[$nodeId]);
// Remove empty posting lists to save memory.
if (empty($postings)) {
unset($this->invertedIndex[$term]);
}
}
unset($postings);
unset($this->documents[$nodeId]);
return true;
}
/** Vocabulary size (unique terms in the index). */
public function vocabularySize(): int
{
return count($this->invertedIndex);
}
/**
* Export the BM25 index state as plain PHP arrays.
*
* @return array{
* totalTokens: int,
* docLengths: array<int, int>,
* invertedIndex: array<string, array<int, int>>
* }
*/
public function exportState(): array
{
return [
'totalTokens' => $this->totalTokens,
'docLengths' => $this->docLengths,
'invertedIndex' => $this->invertedIndex,
];
}
/**
* Restore BM25 state from plain arrays.
* Document objects are supplied by the caller to avoid storing them twice.
*
* @param array{
* totalTokens: int,
* docLengths: array<int, int>,
* invertedIndex: array<string, array<int, int>>
* } $state
* @param array<int, Document> $documents nodeId → Document (from HNSW index)
*/
public function importState(array $state, array $documents): void
{
$this->totalTokens = $state['totalTokens'];
$this->docLengths = $state['docLengths'];
$this->invertedIndex = $state['invertedIndex'];
$this->documents = $documents;
}
}