7 unstable releases (3 breaking)

0.4.0 Feb 9, 2025
0.3.3 Aug 18, 2024
0.2.1 Feb 28, 2024
0.1.0 Dec 16, 2023

#798 in Machine learning

Download history 70/week @ 2024-10-29 29/week @ 2024-11-05 43/week @ 2024-11-12 54/week @ 2024-11-19 52/week @ 2024-11-26 73/week @ 2024-12-03 107/week @ 2024-12-10 61/week @ 2024-12-17 18/week @ 2024-12-24 82/week @ 2024-12-31 136/week @ 2025-01-07 118/week @ 2025-01-14 62/week @ 2025-01-21 46/week @ 2025-01-28 178/week @ 2025-02-04 117/week @ 2025-02-11

414 downloads per month
Used in 2 crates (via kalosm-language)

MIT/Apache

290KB
5.5K SLoC

rbert

A Rust wrapper for bert sentence transformers implemented in Candle

Usage

use kalosm_language_model::Embedder;
use rbert::*;

#[tokio::main]
async fn main() -> anyhow::Result<()> {
    let mut bert = Bert::new().await?;
    let sentences = [
        "Cats are cool",
        "The geopolitical situation is dire",
        "Pets are great",
        "Napoleon was a tyrant",
        "Napoleon was a great general",
    ];
    let embeddings = bert.embed_batch(sentences).await?;
    println!("embeddings {:?}", embeddings);

    // Find the cosine similarity between the first two sentences
    let mut similarities = vec![];
    let n_sentences = sentences.len();
    for (i, e_i) in embeddings.iter().enumerate() {
        for j in (i + 1)..n_sentences {
            let e_j = embeddings.get(j).unwrap();
            let cosine_similarity = e_j.cosine_similarity(e_i);
            similarities.push((cosine_similarity, i, j))
        }
    }
    similarities.sort_by(|u, v| v.0.total_cmp(&u.0));
    for &(score, i, j) in similarities.iter() {
        println!("score: {score:.2} '{}' '{}'", sentences[i], sentences[j])
    }

    Ok(())
}

Dependencies

~31–54MB
~1M SLoC