diff --git a/docs/design/dedicated-volume.md b/docs/design/dedicated-volume.md
index 789bb9ca7e..26143e52d7 100644
--- a/docs/design/dedicated-volume.md
+++ b/docs/design/dedicated-volume.md
@@ -80,7 +80,7 @@ type VolumeSpec struct {
 - By default, this is empty. The task instance will use volumes defined in `JobSpec.Volumes` and `TaskSpec.Template`.
 
 - If `Volumes` are specified, these pvcs are referenced by all the pods of the task.
-  If the the VolumeSpec specifies the `GenerateName` while the `VolumeClaimName` left empty,  the pvc name is generated with task index suffixed by job controller.
+  If the VolumeSpec specifies the `GenerateName` while the `VolumeClaimName` left empty,  the pvc name is generated with task index suffixed by job controller.
   Otherwise, the explicitly declared pvc will be shared by all pods of a task.
 
 - If the pvcs does not exist, job controller will create them.
diff --git a/docs/design/queue-resource-reservation-design.md b/docs/design/queue-resource-reservation-design.md
index 807f8b0ff7..e050a4ed5e 100644
--- a/docs/design/queue-resource-reservation-design.md
+++ b/docs/design/queue-resource-reservation-design.md
@@ -121,7 +121,7 @@ lokced,The smaller the impact on the cluster.
 ##### Lock Strategy
 * schedule relock
 
-for every 5s or 10s. the worker in the  queueController  will find the best combination nodes for a a queue.
+for every 5s or 10s. the worker in the  queueController  will find the best combination nodes for a queue.
 and update the queue's locked nodes,and caculate the idle resources on the locked nodes.
 
 
diff --git a/pkg/scheduler/plugins/numaaware/policy/policy.go b/pkg/scheduler/plugins/numaaware/policy/policy.go
index 442547c2c6..b482828020 100644
--- a/pkg/scheduler/plugins/numaaware/policy/policy.go
+++ b/pkg/scheduler/plugins/numaaware/policy/policy.go
@@ -128,7 +128,7 @@ func iterateAllProviderTopologyHints(allProviderHints [][]TopologyHint, callback
 		}
 
 		// Loop through all hints for provider 'i', and recurse to build the
-		// the permutation of this hint with all hints from providers 'i++'.
+		// permutation of this hint with all hints from providers 'i++'.
 		for j := range allProviderHints[i] {
 			iterate(i+1, append(accum, allProviderHints[i][j]))
 		}