reword (#256)

Author: bitfaster

BitFaster.Caching/ReadMe.md

@@ -4,9 +4,9 @@ High performance, thread-safe in-memory caching primitives for .NET.
 
 ## ConcurrentLru
 
-`ConcurrentLru` is a light weight drop in replacement for `ConcurrentDictionary`, but with bounded size enforced by the TU-Q eviction policy (similar to [2Q](https://www.vldb.org/conf/1994/P439.PDF)). There are no background threads, no lock contention, lookups are fast and hit rate outperforms a pure LRU in all tested scenarios.
+`ConcurrentLru` is a light weight drop in replacement for `ConcurrentDictionary`, but with bounded size enforced by the TU-Q eviction policy (similar to [2Q](https://www.vldb.org/conf/1994/P439.PDF)). There are no background threads, no global locks, concurrent throughput is high, lookups are fast and hit rate outperforms a pure LRU in all tested scenarios.
 
-Choose a capacity and use just like ConcurrentDictionary, but with bounded size:
+Choose a capacity and use just like `ConcurrentDictionary`, but with bounded size:
 
 ```csharp
 int capacity = 666;
@@ -17,9 +17,9 @@ var value = lru.GetOrAdd("key", (key) => new SomeItem(key));
 
 ## ConcurrentLfu
 
-`ConcurrentLfu` is a drop in replacement for `ConcurrentDictionary`, but with bounded size enforced by the [W-TinyLFU eviction policy](https://arxiv.org/pdf/1512.00727.pdf). `ConcurrentLfu` has near optimal hit rate. Reads and writes are buffered and replayed asynchronously to mitigate lock contention.
+`ConcurrentLfu` is a drop in replacement for `ConcurrentDictionary`, but with bounded size enforced by the [W-TinyLFU eviction policy](https://arxiv.org/pdf/1512.00727.pdf). `ConcurrentLfu` has near optimal hit rate. Reads and writes are buffered then replayed asynchronously to mitigate lock contention.
 
-Choose a capacity and use just like ConcurrentDictionary, but with bounded size:
+Choose a capacity and use just like `ConcurrentDictionary`, but with bounded size:
 
 ```csharp
 int capacity = 666;
@@ -30,4 +30,4 @@ var value = lfu.GetOrAdd("key", (key) => new SomeItem(key));
 
 ## Documentation
 
-Please refer to the [wiki](https://github.com/bitfaster/BitFaster.Caching/wiki) for full API documentation, and a complete analysis of hit rate vs cache size, latency and throughput.
+Please refer to the [wiki](https://github.com/bitfaster/BitFaster.Caching/wiki) for full API documentation, and a complete analysis of hit rate, latency and throughput.