Paul Masurel

Would love to have this.

The version published does not work. It works if you install from this repository. `cargo install --git https://github.com/mgattozzi/cargo-wa --force`

(tantivy creatomaintainer and quickwit CEO) quickwit (https://github.com/quickwit-inc/quickwit) aims precisely at allowing client-side search on a distant high latency storage. We are in the process of opensourcing our code under the...

See my reply on #1417, this is out of tantivy's scope: language specific tokenizers are meant to be hosted in separate crates.

> Another question: is there any way to factor in the length of the suffix of the term (when using the query as the prefix) to the score? If possible...

@Restioson a funciton is good I think. `Fn(lev_distance: u8, approximate_suffix_length: u32) -> f32` We can cache the result for lev_distance = 0,1,2,3,>=3 and approximate_suffix_length = 0..10 or something like that.

That's incorrect. We avoid spawning too many merges, but we do not prevent people from committing.

@fmassot agreeing with the above.

I think "very serious" applications should think about implementing their own query parser.

I prefer to work with a `&[u8]`. It makes it much easier to optimize things. Did you observe a performance regression / improvement? Did it shave off the memory peaks...