diff --git a/README.md b/README.md
index 2a44514..422a8e8 100644
--- a/README.md
+++ b/README.md
@@ -1,6 +1,6 @@
# Dervish MCP
-
+
**Dervish** infers **regular expression grammars** from example sequences using the BEX family of algorithms. Given a set of example sequences (strings over some alphabet), it learns a compact regular expression that captures the general pattern.
diff --git a/SHOWCASE.md b/SHOWCASE.md
index d43b05b..fc2ff39 100644
--- a/SHOWCASE.md
+++ b/SHOWCASE.md
@@ -1,6 +1,6 @@
# Dervish — Showcase
-
+
Infer the **unwritten convention** from existing examples. Given N example
sequences, produce a ~100-char grammar that captures the structural
diff --git a/blog_post.md b/blog_post.md
index b330c7c..954e266 100644
--- a/blog_post.md
+++ b/blog_post.md
@@ -1,6 +1,6 @@
# Dervish: Discovering Unwritten Conventions with Grammar Inference
-
+
**How we turned 36 Ansible roles into a 200-character grammar — and why
it matters for LLM agents.**