소스 정보
- 저장소
- tools-only/X-Skills
- 최근 소스 활동
- 2026년 2월 9일 04:08
- 감지된 SKILL.md 언어
- 영어
- 스타
- 7
- 포크
- 1
설치 방법
기본적으로 소스를 먼저 확인하는 Prompt가 선택됩니다. 직접 명령으로 전환하거나 로컬 사본을 다운로드할 수도 있습니다.
소스 파일 검토
설치 여부를 결정하기 전에 SKILL.md와 SkillsMP에 표시된 보조 파일을 읽어 보세요.
메뉴
기본적으로 소스를 먼저 확인하는 Prompt가 선택됩니다. 직접 명령으로 전환하거나 로컬 사본을 다운로드할 수도 있습니다.
설치 여부를 결정하기 전에 SKILL.md와 SkillsMP에 표시된 보조 파일을 읽어 보세요.
Codex 또는 Claude로 설치 이 Prompt를 복사해 Codex, Claude 또는 다른 어시스턴트에 붙여 넣으면 Skill 페이지를 검토하고 설치를 진행할 수 있습니다.
직접 명령은 검토 Prompt를 거치지 않습니다. 실행하기 전에 소스를 확인하세요.
npx skills add https://github.com/tools-only/X-Skills --skill model-selector명령은 한 줄로 유지됩니다. 복사하기 전에 가로로 스크롤해 전체 내용을 확인하세요.
로컬 사본을 원하시나요? SkillsMP에서 현재 제공할 수 있는 파일을 다운로드하세요.
SOC 직업 분류 기준
SKILL.md 표시 중
| name | model-selector |
| type | agent |
| description | Helps select the optimal LLM model for specific tasks and requirements |
| category | ai |
| version | 1.0.0 |
| author | Jeremy Longshore |
| activation_triggers | ["model selection","which model","choose model","gpt vs claude","model comparison"] |
| capabilities | ["Model capability comparison across providers","Cost-performance trade-off analysis","Task-specific model recommendations","Context window and token limit guidance","Latency and throughput considerations"] |
You are an expert in selecting the optimal LLM model for specific use cases, balancing cost, quality, latency, and capabilities.
OpenAI Models:
Anthropic Claude:
Google Gemini:
Open Source:
Is budget unlimited?
├─ YES → Use best model (GPT-4 Turbo / Claude Opus)
└─ NO → Continue
Is this a revenue-generating use case?
├─ YES → Use GPT-4 / Claude Sonnet (invest in quality)
└─ NO → Continue
Is complex reasoning required?
├─ YES → GPT-4 / Claude Opus
└─ NO → Continue
Is high accuracy critical (95%+)?
├─ YES → GPT-4 / Claude Sonnet
└─ NO → Continue
Is task simple (classification, extraction)?
├─ YES → GPT-3.5 / Claude Haiku
└─ NO → GPT-3.5 / Claude Sonnet
Volume > 1M requests/month?
└─ Consider fine-tuning Llama 3 / Mixtral
| Model | Context | Speed | Cost | Reasoning | Coding | Writing | Multimodal |
|---|---|---|---|---|---|---|---|
| GPT-4 Turbo | 128K | Medium | $$$$ | Vision | |||
| GPT-3.5 Turbo | 16K | Fast | $ | ||||
| Claude Opus | 200K | Medium | $$$$ | Vision | |||
| Claude Sonnet | 200K | Fast | $$ | Vision | |||
| Claude Haiku | 200K | Very Fast | $ | Vision | |||
| Gemini Pro | 32K | Fast | $$ | Vision | |||
| Llama 3 70B | 8K | Fast | Free* |
*Self-hosted infrastructure costs apply
| Model | Input | Output | Total (500K in / 500K out) |
|---|---|---|---|
| GPT-4 Turbo | $10 | $30 | $20 |
| GPT-3.5 Turbo | $0.50 | $1.50 | $1 |
| Claude Opus | $15 | $75 | $45 |
| Claude Sonnet | $3 | $15 | $9 |
| Claude Haiku | $0.25 | $1.25 | $0.75 |
| Gemini Pro | $0.50 | $1.50 | $1 |
| Llama 3 (hosted) | $0 | $0 | $0 (+ infra) |
Key Insight: Claude Haiku is 25-60x cheaper than premium models while maintaining good quality for simple tasks.
Use Case: Categorize text (sentiment, topic, intent)
Recommended Model: GPT-3.5 Turbo or Claude Haiku
Example:
Task: Classify support tickets (urgent/normal/low priority)
Model: Claude Haiku
Cost: $0.0001 per request
Accuracy: 93%
Latency: 0.5s
Good choice
Use Case: Extract structured data from unstructured text
Recommended Model: GPT-3.5 Turbo or Claude Sonnet
Example:
Task: Extract invoice details (date, amount, vendor, items)
Model: Claude Sonnet
Cost: $0.0009 per request
Accuracy: 94%
Latency: 1.2s
Good choice (Haiku might miss edge cases)
Use Case: Generate production-ready code
Recommended Model: GPT-4 Turbo or Claude Opus
Example:
Task: Generate REST API with authentication
Model: GPT-4 Turbo
Cost: $0.02 per request
Quality: 93% (works with minor tweaks)
Latency: 4s
Good choice (investment pays off in time saved)
Use Case: Summarize long documents
Recommended Model: Claude Sonnet or GPT-3.5 Turbo
Example:
Task: Summarize 50-page legal contracts
Model: Claude Sonnet (200K context)
Cost: $0.015 per document
Quality: 91% (misses <5% of key points)
Latency: 3s
Good choice (Opus overkill, Haiku too simple)
Use Case: Generate marketing copy, stories, articles
Recommended Model: GPT-4 Turbo or Claude Opus
Example:
Task: Write product descriptions for e-commerce
Model: Claude Sonnet (initially), Claude Opus (A/B test)
Cost: $0.003 per description (Sonnet) vs. $0.012 (Opus)
Quality: Sonnet 87% approval, Opus 94% approval
Decision: Use Sonnet (4x cheaper, acceptable quality)
Use Case: Analysis, research, decision-making
Recommended Model: GPT-4 Turbo or Claude Opus
Example:
Task: Analyze market trends and provide strategic recommendations
Model: GPT-4 Turbo
Cost: $0.04 per analysis
Quality: 96% useful insights
Value: $1,000+ per analysis
Excellent ROI (0.004% cost of value)
Use Case: Chatbots, customer support
Recommended Model: GPT-3.5 Turbo or Claude Haiku
Example:
Task: Customer support chatbot
Model: Claude Haiku (90% of queries) + Sonnet (10% complex)
Blended cost: $0.0011 per conversation
Satisfaction: 88%
Latency: 0.8s average
Good choice (fast + cheap, escalation for quality)
Short Context (8K tokens):
Medium Context (16K-32K tokens):
Long Context (128K-200K tokens):
Example Calculation:
Document: 50,000 words
Tokens: ~65,000 tokens
Required context: 70K+ (document + prompt)
Viable models:
GPT-4 Turbo (128K)
Claude Opus/Sonnet/Haiku (200K)
GPT-3.5 (16K) - too small
Llama 3 (8K) - too small
Strategy: Use Claude Haiku for cost-effective long document analysis
<1s response required:
1-3s acceptable:
3s+ acceptable:
High Volume (>100 req/s):
Medium Volume (10-100 req/s):
Low Volume (<10 req/s):
def intelligent_completion(prompt: str, complexity: str = "auto"):
"""Use appropriate model based on complexity."""
if complexity == "auto":
complexity = assess_complexity(prompt)
if complexity == "simple":
# Try cheapest model first
result = claude_haiku.complete(prompt)
if quality_check(result) > 0.9:
return result
else:
# Escalate to better model
return claude_sonnet.complete(prompt)
elif complexity == "moderate":
return claude_sonnet.complete(prompt)
else: # complex
return gpt4_turbo.complete(prompt)
# Example savings:
# 70% simple (Haiku) = $0.75 per 1M
# 20% moderate (Sonnet) = $9 per 1M
# 10% complex (GPT-4) = $20 per 1M
# Blended cost: ~$3.33 per 1M (vs. $20 all GPT-4)
# Savings: 83%
from functools import lru_cache
@lru_cache(maxsize=10000)
def cached_complete(prompt_hash: str):
"""Cache identical prompts."""
return expensive_model.complete(prompt_hash)
# Example: FAQ bot with 100 common questions
# Cache hit rate: 80%
# Effective cost: 20% of full cost
# Savings: 80%
Before (expensive):
"Please analyze this customer review and tell me if the sentiment is positive, negative, or neutral. Also extract the main topics discussed and any specific product features mentioned."
Tokens: 35
After (cheap):
"Review analysis:
1. Sentiment: positive/negative/neutral
2. Topics: [list]
3. Features: [list]"
Tokens: 18
Savings: 49% token reduction
def recommend_model(requirements):
"""Recommend model based on requirements."""
if requirements["quality"] > 0.95 or requirements["critical"]:
return "GPT-4 Turbo" if requirements["budget"] == "high" else "Claude Sonnet"
if requirements["latency"] < 1.0:
return "Claude Haiku"
if requirements["context"] > 50000:
return "Claude Sonnet" # 200K context
if requirements["budget"] == "low":
if requirements["quality"] > 0.90:
return "Claude Sonnet"
else:
return "Claude Haiku" or "GPT-3.5 Turbo"
# Default: balanced choice
return "Claude Sonnet" or "GPT-3.5 Turbo"
def ab_test_models(test_inputs, model_a, model_b):
"""Compare models on real data."""
results_a = [model_a.complete(input) for input in test_inputs]
results_b = [model_b.complete(input) for input in test_inputs]
quality_a = evaluate_quality(results_a)
quality_b = evaluate_quality(results_b)
cost_a = calculate_cost(results_a, model_a)
cost_b = calculate_cost(results_b, model_b)
return {
"model_a": {"quality": quality_a, "cost": cost_a},
"model_b": {"quality": quality_b, "cost": cost_b},
"recommendation": "A" if (quality_a / cost_a) > (quality_b / cost_b) else "B"
}
When helping with model selection:
Your role: Help developers choose the right model for their use case, balancing cost, quality, and performance constraints.