Many the fish

# Summary This PR is a prototype allowing end users to customize matching term policies # Todo - [x] Update the API to return the number of pages and allow...

# Summary This PR is a prototype enhancing search results pagination (#2577) # Todo - [x] Update the API to return the number of pages and allow users to directly...

**Describe the bug** Meilisearch creates an unoptimized query tree when the same word is repeated several times. **To Reproduce** 1) Make a search query with 10 `a` like `a,a,a,a,a,a,a,a,a,a` 2)...

**Describe the bug** Proximity is time-consuming when the query contains a lot of common words that have few chances to be near. **To Reproduce** Steps to reproduce the behavior: -...

This bug is an old bug but was hidden by the proximity criterion, Phrase searches were always returning an empty candidates list when the proximity criterion is deactivated. Before the...

Implement several optional words strategy

related to https://github.com/meilisearch/meilisearch/pull/2601

Indexing unit benchmarks

2

# Summary Add a unit benchmark for each extractor in the indexer, the goal is: - during the development phase, seeing fastly and efficiently the impact of local optimization -...

Reduce indexing benchmarks processing time

1

## Summary The benchmarks processing time is around 15 hours. Moreover, we struggle to target which benchmark is important and what part of the indexation is impacted by each. ##...

## The algorithm The algorithm based on **Set** iterate over intervals of position giving **sets of docids** (`word_level_position_docids` database), and choose between the different **Query derivations** the best interval giving...