MCP For Claude Marketplace
Long-Tail Extractor

Long-Tail Extractor MCP Connector for Claude

A+

Identify recurring word sequences (n-grams) to discover potential long-tail keyword candidates within any text.

3 tools Official Updated Oct 1, 2026 Official Vinkius Partner
More Details Connect to Claude

The Long-Tail Extractor is a specialized analysis engine designed to uncover hidden patterns in large bodies of text. By identifying contiguous blocks of words--specifically 3, 4, and 5-word sequences (n-grams)--it helps users discover high-potential long-tail keyword candidates for SEO and content strategy. The server provides three powerful tools: extract_ngram_sequences to scan text for recurring phrases, filter_high_frequency_patterns to isolate significant patterns based on a frequency threshold, and calculate_pattern_density to measure the prevalence of these sequences relative to the total word count. This tool automates the tedious process of manual text analysis, providing precise data on phrase frequency and position.

n-gramskeywordstext-analysisseo-toolspattern-recognitiondata-mining

3 tools expose this connector's capabilities to your AI agent.

calculate_pattern_density

Calculate the density of N-grams within a text

filter_high_frequency_patterns

Filter N-grams by a minimum frequency threshold

extract_ngram_sequences

Returns phrases with their counts and positions. Identify recurring sequences of words within a text

See how to talk to your AI agent using Long-Tail Extractor.

Find all recurring 3-word sequences in this text: 'The quick brown fox jumps over the lazy dog. The quick brown fox is very fast.'

Found 1 recurring sequence: 'the quick brown' (2 occurrences).

Filter these n-grams to only show those that appear at least 3 times: '[{"phrase": "apple pie", "count": 1}, {"phrase": "banana split", "count": 4}]'

The following patterns met the threshold: 'banana split'.

Calculate the density for 'hello world' which appears 2 times in a text of 100 words.

The density score for 'hello world' is 0.02.

N-grams are contiguous sequences of $n$ items from a given sample of text. In this tool, we focus on sequences of 3, 4, and 5 words.

Related Connectors

I Ching Hexagram Engine

I Ching Hexagram Engine MCP

3 tools Official

Calculate primary, transformed, and nuclear hexagrams from line values or coin tosses.

A+ View details →
Emotion Wheel Classifier

Emotion Wheel Classifier MCP

3 tools Official

Map raw text descriptions to Plutchik's Wheel of Emotions, identifying intensity and emotional families.

A+ View details →
Jina AI (Search Foundation & LLM Grounding)

Jina AI (Search Foundation & LLM Grounding) MCP

6 tools Official

Power your RAG and search via Jina AI — generate embeddings, rerank documents, read URLs, and perform semantic web search.

A+ View details →
Couchbase (Vector & NoSQL)

Couchbase (Vector & NoSQL) MCP

7 tools Official

Manage vector search and NoSQL via Couchbase — execute N1QL queries, perform KNN vector searches, and audit documents directly from any AI agent.

A+ View details →