Docs: Small fixes

Author: erezsh

README.md

@@ -125,7 +125,7 @@ Lark is fast and light (lower is better)
 
 Check out the [JSON tutorial](/docs/json_tutorial.md#conclusion) for more details on how the comparison was made.
 
-For a more thorough and objective comparison, checkout the [Python Parsing Benchmarks](https://github.com/goodmami/python-parsing-benchmarks) repo.
+For thorough 3rd-party benchmarks, checkout the [Python Parsing Benchmarks](https://github.com/goodmami/python-parsing-benchmarks) repo.
 
 #### Feature comparison
 
@@ -180,8 +180,8 @@ Lark accepts pull-requests. See [How to develop Lark](/docs/how_to_develop.md)
 
 Big thanks to everyone who contributed so far:
 
-<a href="https://github.com/lark-parser/lark/graphs/contributors">
   <img src="https://contributors-img.web.app/image?repo=lark-parser/lark" />
+<a href="https://github.com/lark-parser/lark/graphs/contributors">
 </a>
 
 ## Sponsor

docs/parsers.md

@@ -23,7 +23,7 @@ Lark provides the following options to combat ambiguity:
 
 2) Users may choose to receive the set of all possible parse-trees (using ambiguity='explicit'), and choose the best derivation themselves. While simple and flexible, it comes at the cost of space and performance, and so it isn't recommended for highly ambiguous grammars, or very long inputs.
 
-3) As an advanced feature, users may use specialized visitors to iterate the SPPF themselves.
+3) As an advanced feature, users may use specialized visitors to iterate the SPPF themselves. There is also [a 3rd party utility for iterating over the SPPF](https://github.com/chanicpanic/lark-ambig-tools).
 
 **lexer="dynamic_complete"**