nli-bert-base-max-pooling safetensors download | Hugging Bay

Q: What is this model?

sentence-transformers/nli-bert-base-max-pooling is an embedding model for sentence similarity and retrieval published by sentence-transformers, added to Hugging Bay Jun 30, 2026. Model from Hugging Face: sentence-transformers/nli-bert-base-max-pooling

Q: Can I use it commercially?

It is released under the apache-2.0 license. Commercial use is allowed. Permissive open license: commercial use, modification, and redistribution are permitted.

Q: How big is it?

Hosted here: at least 11 listed files; full count and size unknown. The full repository size is not recorded. The recommended download, model.safetensors, is 438 MB.

Q: What can I download here?

Hosted here: at least 11 listed files; full count and size unknown. Full repo upstream: unknown. The original release is at https://huggingface.co/sentence-transformers/nli-bert-base-max-pooling.

Q: File pattern scans

Automated file-pattern scans flagged nothing; not a safety guarantee. 11 hosted files carry a published SHA-256 you can re-hash. The machine-readable verdict is at /api/artifacts/hf-model-sentence-transformers-nli-bert-base-max-pooling/safety on Hugging Bay.

Q: Will sentence-transformers/nli-bert-base-max-pooling run on my computer?

We can’t check the fit; we don’t know your machine. We don’t have your machine’s specs, so no check ran and no verdict is shown. Answer two quick questions and we’ll estimate, from the memory you tell us, whether it fits your machine. Or skip it; you can still download; fit isn’t checked.

sentence-transformers

nli-bert-base-max-pooling

Can I run nli-bert-base-max-pooling on my computer?

It depends on your memory, processor, file format and runtime. Hugging Bay offers 11 hosted files; check the file list for the exact selection. A file-size fit is an estimate, not a successful run or speed promise. Read the license before use.

nli-bert-base-max-pooling is an embedding model for sentence similarity and retrieval. Model weights are learned parameters; a runtime loads them. A hosted file is an individual file Hugging Bay can serve. SHA-256 identifies exact file bytes. The availability date above applies to this file record, not the upstream metadata update date.

As of the recorded file availability check on 2026-10-22.

Recorded SHA-256 for model.safetensors: ea2fce20c3c4ff75b5774d02b1d789b90637f821fc72791d0b3bf542832b5748. Exact file evidence · Machine-readable source facts · Run evidence and any recorded receipts. A checksum fingerprints only the named file bytes; it does not prove safety, quality, a complete multi-file selection or a successful run.

Updated 2026-10-21 · Page-copy source revision 8871bab84e1cf80aea1686a944ec335078a6c036 · Source files: apps/web/lib/model-page-template.mjs, apps/web/lib/model-page-v3.mjs, apps/web/lib/aeo-page.mjs · Full revision record

Model metadata: As of 2026-08-04 at the model source. Popularity counters are source-reported, not measured by Hugging Bay. Availability checked 2026-10-22.

sentence-transformers/nli-bert-base-max-pooling

Model details

sentence similarity and retrievalLicense: apache-2.0SHA-256 recorded for 11 of 26 filessafetensors · ONNX · BIN

Content controls: not assessed.

The catalog lists this model for checking whether two sentences mean similar things. Catalog sources: license, task.

View as JSON →

Your next step

Use it from code

This Python snippet downloads the selected file. Running the model needs its own library and setup.

from urllib.request import urlretrieve

urlretrieve(
    "https://huggingbay.xyz/api/downloads/hf-model-sentence-transformers-nli-bert-base-max-pooling/model.safetensors",
    "model.safetensors",
)

Other ways

This file cannot open in the app. The app supports one GGUF file at a time.

See app requirements

11 hosted of 26 listed · Hashes recorded. Date not recorded.

Selected downloadmodel.safetensors438 MB · 1 file Download · 438 MB (1 file)

Open-file help

Content controls: not assessed.

Check your download →

Compare your file’s SHA-256 with the recorded hash.