Apply suggestions from code review

Co-authored-by: Martin Thomson <mt@lowentropy.net>
Co-authored-by: Jana Iyengar <jri.ietf@gmail.com>

draft-ietf-quic-recovery.md

@@ -355,8 +355,8 @@ frequently observable.
 ## Estimating smoothed_rtt and rttvar {#smoothed-rtt}
 
 smoothed_rtt is an exponentially-weighted moving average of an endpoint's RTT
-samples, and rttvar represents the variation in the RTT samples, estimated using
-a mean variation.
+samples, and rttvar estimates the variation in the RTT samples using a mean
+variation.
 
 The calculation of smoothed_rtt uses RTT samples after adjusting them for
 acknowledgment delays. These delays are decoded from the ACK Delay field of
@@ -1019,10 +1019,9 @@ Since network congestion is not affected by packet number spaces, persistent
 congestion SHOULD consider packets sent across packet number spaces. A sender
 that does not have state for all packet number spaces or an implementation that
 cannot compare send times across packet number spaces MAY use state for just the
-packet number space that was acknowledged.  This might result in erroneously
-declaring persistent congestion when including all packet number spaces would
-not have declared persistent connection, but will not lead to a failure to
-detect persistent congestion.
+packet number space that was acknowledged. This might result in erroneously
+declaring persistent congestion, but it will not lead to a failure to detect
+persistent congestion. 
 
 When persistent congestion is declared, the sender's congestion window MUST be
 reduced to the minimum congestion window (kMinimumWindow), similar to a TCP