doc: fix some typos (#37301)

base/condition.jl

@@ -58,7 +58,7 @@ islocked(::AlwaysLockedST) = true
     GenericCondition
 
 Abstract implementation of a condition object
-for synchonizing tasks objects with a given lock.
+for synchronizing tasks objects with a given lock.
 """
 struct GenericCondition{L<:AbstractLock}
     waitq::InvasiveLinkedList{Task}

doc/src/manual/performance-tips.md

@@ -169,7 +169,7 @@ julia> push!(a, 1); push!(a, 2.0); push!(a, π)
  π = 3.1415926535897...
 ```
 
-Because `a` is a an array of abstract type [`Real`](@ref), it must be able to hold any
+Because `a` is an array of abstract type [`Real`](@ref), it must be able to hold any
 `Real` value. Since `Real` objects can be of arbitrary size and structure, `a` must be
 represented as an array of pointers to individually allocated `Real` objects. However, if we instead
 only allow numbers of the same type, e.g. [`Float64`](@ref), to be stored in `a` these can be stored more

stdlib/Random/src/generation.jl

@@ -172,7 +172,7 @@ end
 #    rand(Float64) "fast enough".
 #    The tradeoff is faster creation of the sampler, but more consumption of entropy bits.
 # 2) "Slow" (SamplerRangeInt) which tries to use as few entropy bits as possible, at the
-#    cost of a a bigger upfront price associated with the creation of the sampler.
+#    cost of a bigger upfront price associated with the creation of the sampler.
 #    This sampler is most appropriate for slower random generators.
 # 3) "Nearly Division Less" (NDL) which is generally the fastest algorithm for types of size
 #    up to 64 bits. This is the default for these types since Julia 1.5.