diff --git a/docs/developer_guides/proxy-reduce.md b/docs/developer_guides/proxy-reduce.md
index 9e6abd70c3..ed7f0ceec1 100644
--- a/docs/developer_guides/proxy-reduce.md
+++ b/docs/developer_guides/proxy-reduce.md
@@ -42,7 +42,7 @@ for i -> topk:
 		topk_results = append(topk_results, choice)
 ```
 
-This algorithm is originated from the merging phase of merge sort. The common point of the two is that the results have been sorted when merging, and the difference is that merge sort merges two-way results, proxy reduce merges multiple results.
+This algorithm is originated from the merging phase of merge sort. The common point of the two is that the results have been sorted when merging, and the difference is that merge sort merges two-way results, proxy reduces merges multiple results.
 
 In contrast, in merge sort, two pointers are used to record the offsets of the two-way results, and proxy reduce uses multiple pointers `locs` to record the offsets of the `k-way` results.