remove superfluous nodes (dotnet#9369)

Author: gewarren

xml/Microsoft.Extensions.Primitives/StringSegment.xml

@@ -315,12 +315,10 @@
         <ReturnType>System.String</ReturnType>
       </ReturnValue>
       <Docs>
-        <summary>Gets the <see cref="T:System.String" /> buffer for this <see cref="T:Microsoft.Extensions.Primitives.StringSegment" />.</summary>
-        <value>The <see cref="T:System.String" /> buffer for this <see cref="T:Microsoft.Extensions.Primitives.StringSegment" />.</value>
+        <summary>Gets the value of this segment as a string.</summary>
+        <value>The string buffer for this segment.</value>
         <remarks>To be added.</remarks>
       </Docs>
-      <summary>Gets the value of this segment as a <see cref="T:System.String" />.</summary>
-      <value>The value of this segment as a <see cref="T:System.String" />.</value>
     </Member>
     <Member MemberName="Compare">
       <MemberSignature Language="C#" Value="public static int Compare (Microsoft.Extensions.Primitives.StringSegment a, Microsoft.Extensions.Primitives.StringSegment b, StringComparison comparisonType);" />
@@ -723,7 +721,7 @@
         <summary>Returns the hash code for this instance.</summary>
         <returns>A 32-bit signed integer that is the hash code for this instance.</returns>
         <remarks>The returned hash code is suitable for use in hashing algorithms and data structures, for example, a hash table.
-        
+
         This method is expensive since it allocates on every call. However, the allocation is required to retain any behavior (such as hash code randomization) that <see cref="M:System.String.GetHashCode" /> has.</remarks>
       </Docs>
     </Member>