Update README.md

Author: jeanbern

README.md

@@ -1,8 +1,8 @@
 # Portent
 
-[![Build status](https://ci.appveyor.com/api/projects/status/8g8n9bd3wh3boddb?svg=true)](https://ci.appveyor.com/project/jeanbern/portent)
+<!--[![Build status](https://ci.appveyor.com/api/projects/status/8g8n9bd3wh3boddb?svg=true)](https://ci.appveyor.com/project/jeanbern/portent)-->
 <!--[![codecov](https://codecov.io/gh/jeanbern/portent/branch/master/graph/badge.svg)](https://codecov.io/gh/jeanbern/portent)-->
-[![Codacy Badge](https://api.codacy.com/project/badge/Grade/6dc3f766018a42f8a08b29e3afda2bc2)](https://www.codacy.com/manual/jeanbern/portent?utm_source=github.com&amp;utm_medium=referral&amp;utm_content=jeanbern/portent&amp;utm_campaign=Badge_Grade)
+<!--[![Codacy Badge](https://api.codacy.com/project/badge/Grade/6dc3f766018a42f8a08b29e3afda2bc2)](https://www.codacy.com/manual/jeanbern/portent?utm_source=github.com&amp;utm_medium=referral&amp;utm_content=jeanbern/portent&amp;utm_campaign=Badge_Grade)-->
 
 A highly optimized C# implementation of fuzzy word matching with a Directed Acyclic Word Graph.  
 
@@ -11,4 +11,6 @@ Eventually there will be a host of content explaining the design decisions invol
 1. Performance enhancements in `Lookup()`
 2. Memory management in the `Dawg()` constructor
 3. Node ordering in `PartitionedGraphBuilder.TopologicalSort()`
-4. Reduction of allocations with custom `SuggestItemCollections`
+4. Reduction of allocations with custom `SuggestItemCollections`
+
+This can be plugged into the previous implementation at https://github.com/jeanbern/Augury to provide word-prediction.