提出了一种自顶向下、深度优先的概念格横向合并算法.首先研究了父子概念插入顺序对新生概念和更新概念的影响,并证明了概念插入和更新的相关定理.在此基础上,设计了一种递归插入概念的遍历顺序,能够大幅缩小概念比较的范围.实验和分析均表明,与其他概念格合并算法相比,该算法效率明显提高,适合概念格的合并运算. This paper proposes a top-down and depth-first concept lattice horizontal merging algorithm.Firstly, it studies the influence of parent-child concept insertion order on new concepts and update concepts and proves the related theorems of concept insertion and updating.On this basis, We design a traversal order of recursive interpolation concepts, which can greatly reduce the scope of concept comparison.Experiments and analyzes show that compared with other concept lattice merging algorithms, this algorithm is obviously more efficient and suitable for the merging operation of concept lattice.