diff --git a/python-cachey.changes b/python-cachey.changes
index 67ae9c3..bab7dbc 100644
--- a/python-cachey.changes
+++ b/python-cachey.changes
@@ -1,3 +1,8 @@
+-------------------------------------------------------------------
+Thu Jan 24 09:25:19 UTC 2019 - Jan Engelhardt <jengelh@inai.de>
+
+- Use noun phrase in summary.
+
 -------------------------------------------------------------------
 Thu Jan 24 08:20:29 UTC 2019 - Tomáš Chvátal <tchvatal@suse.com>
 
diff --git a/python-cachey.spec b/python-cachey.spec
index eb0d045..fa0bcf2 100644
--- a/python-cachey.spec
+++ b/python-cachey.spec
@@ -20,7 +20,7 @@
 Name:           python-cachey
 Version:        0.1.1
 Release:        0
-Summary:        Caching mindful of computation/storage costs
+Summary:        A Python cache mindful of computation/storage costs
 License:        BSD-3-Clause
 Group:          Development/Languages/Python
 URL:            http://github.com/mrocklin/cachey/
@@ -48,7 +48,7 @@ It accomplishes this by adding the following to each items score on each access
 
     score += compute_time / num_bytes * (1 + eps) ** tick_time
 
-For some small value of epsilon (which determines the memory halflife.) This
+For some small value of epsilon (which determines the memory halflife). This
 has units of inverse bandwidth, has exponential decay of old results and
 roughly linear amplification of repeated results.