Parrot is a paraphrase based utterance augmentation framework purpose built to accelerate training NLU models. A paraphrase framework is more than just a paraphrasing model. For more details on the library and usage please refer to the github page **Huggingface** lists 12 paraphrase models, **RapidAPI** lists 7 fremium and commercial paraphrasers like QuillBot, Rasa has discussed an experimental paraphraser for augmenting text data here, Sentence-transfomers offers a paraphrase mining utility and NLPAug offers word level augmentation with a PPDB (a multi-million paraphrase database). While these attempts at paraphrasing are great, there are still some gaps and paraphrasing is NOT yet a mainstream option for text augmentation in building NLU models....Parrot is a humble attempt to fill some of these gaps. **What is a good paraphrase?** Almost all conditioned text generation models are validated on 2 factors, (1) if the generated text conveys the same meaning as the original context (Adequacy) (2) if the text is fluent / grammatically correct english (Fluency). For instance Neural Machine Translation outputs are tested for Adequacy and Fluency. But a good paraphrase should be adequate and fluent while being as different as possible on the surface lexical form. With respect to this definition, the **3 key metrics** that measures the quality of paraphrases are: - **Adequacy** (Is the meaning preserved adequately?) - **Fluency** (Is the paraphrase fluent English?) - **Diversity (Lexical / Phrasal / Syntactical)** (How much has the paraphrase changed the original sentence?)

Text generationOpen weights

Input Text→ Output Text

Price not verifiedCheck multimodal and channel pricing separately

View details ↗

CompareSource / docs ↗

Splade_PP_en_v1

prithivida

This work stands on the shoulders of 2 robust researches: Naver's From Distillation to Hard Negative Sampling: Making Sparse Neural IR Models More Effective paper and Google's SparseEmbed. Props to both the teams for such a robust work. **Beginner ?** expand this. **Expert in Sparse & Dense representations ?** feel free skip to next section 2, Lexical search with BOW based sparse vectors are strong baselines, but they famously suffer from vocabulary mismatch problem, as they can only do exact term matching. Here are the pros and cons:

Embeddings & similarity

Input Text→ Output Embedding

Price not verifiedCheck multimodal and channel pricing separately

View details ↗

CompareSource / docs ↗

Splade_PP_en_v2

prithivida

Embeddings & similarity

Input Text→ Output Embedding

Price not verifiedCheck multimodal and channel pricing separately

View details ↗

CompareSource / docs ↗

COST EXPLORER

Great models. Clear costs.

Cost analysis

Adjust monthly token usage to compare estimated API costs.

Monthly input tokens 10 MMonthly output tokens 2 M1 M = 1 million tokens · USD
Compares base text-token rates within the same channel

Uses collected, comparable USD-per-million-token rates. Snapshots exclude cache discounts, tiers, extra reasoning output and taxes. Check current source prices.

MODEL HANDBOOK

Understand before you choose

Selection guide & FAQ

How should API prices be compared?+

Separate input, output and cache rates, then estimate the same workload. Image, audio and video rates may use items, duration or resolution rather than tokens.

Do open weights mean free commercial use?+

Not necessarily. Check each version’s license, commercial restrictions and policies. Self-hosting also incurs compute and maintenance costs.

Is the top-ranked model the best for me?+

Rankings depend on tasks, versions and methods. Compare accuracy, latency, reliability and costs on your own workload.

Find your ideal AI model.

Explore AI models 7

bert-for-patents-64d

grammar_error_correcter_v1

parrot_adequacy_model

parrot_fluency_model

parrot_paraphraser_on_T5

Splade_PP_en_v1

Splade_PP_en_v2

No matching models

Great models. Clear costs.

Understand before you choose

Follow trends. Find tools. Explore models.