diff --git a/python-Parsley.changes b/python-Parsley.changes
index 4e1ad4d..12536b3 100644
--- a/python-Parsley.changes
+++ b/python-Parsley.changes
@@ -1,3 +1,8 @@
+-------------------------------------------------------------------
+Sat Aug 25 18:05:32 UTC 2018 - jengelh@inai.de
+
+- Use noun phrase in summary. Strip storytelling from description.
+
 -------------------------------------------------------------------
 Thu Aug 23 11:17:06 UTC 2018 - tchvatal@suse.com
 
diff --git a/python-Parsley.spec b/python-Parsley.spec
index 2c16e9f..9b8657b 100644
--- a/python-Parsley.spec
+++ b/python-Parsley.spec
@@ -22,7 +22,7 @@
 Name:           python-Parsley
 Version:        1.3
 Release:        0
-Summary:        Parsing and pattern matching made easy
+Summary:        PEG algorithm based parser generator
 License:        MIT
 Group:          Development/Libraries/Python
 URL:            http://github.com/washort/parsley
@@ -39,17 +39,13 @@ BuildArch:      noarch
 %python_subpackages
 
 %description
-Parsley is a parsing library for people who find parsers scary or annoying. I
-wrote it because I wanted to parse a programming language, and tools like PLY
-or ANTLR or Bison were very hard to understand and integrate into my Python
-code. Most parser generators are based on LL or LR parsing algorithms that
-compile to big state machine tables. It was like I had to wake up a different
-section of my brain to understand or work on grammar rules.
-
-Parsley, like pyparsing and ZestyParser, uses the PEG algorithm, so each
-expression in the grammar rules works like a Python expression. In particular,
-alternatives are evaluated in order, unlike table-driven parsers such as yacc,
-bison or PLY.
+Parsley is a parsing library. Most parser generators like ANTLR and
+Bison are based on LL or LR parsing algorithms that compile to big
+state machine tables, whereas Parsley, like pyparsing and
+ZestyParser, uses the PEG algorithm, so each expression in the
+grammar rules works like a Python expression. In particular,
+alternatives are evaluated in order, unlike table-driven parsers such
+as yacc, bison or PLY.
 
 The binaries are prefixed with parsley-.