This paper proposes a dictionary machine which can handle redundant instructions on a modified semi X-tree structure in one pass. The proposed machine which is based on \textit{C. E. Leiserson}'s design [Systolic priority queues, Technical report CMU-CS-79-115, Carnegie- Mellon University, Pittsburg, PA (1979)], operates with a pipeline interval of two steps. The cell complexity of the design is comparable to that of Leiserson. Unlike other designs [e.g., \textit{M. J. Atallah} and \textit{S. R. Kosaraju}, IEEE Trans. Comput. C 34, 151-155 (1985; Zbl 0555.68011)] where cell complexity, pipeline interval and structure are compromised to get optimal response time, in this design, response time is compromised to get better pipeline interval, cell complexity and structure. The reason for taking this approach is presented in the paper.