This paper presents a theory and a computational model of analogical match, and an implementation of this model, named AME. The theory includes consistency, predicate similarity and support principles. Because the computational model constructs mapping in proposition-oriented match, and takes proposition mapping as primitive units, the complexity of AME is lower than the same kind of system. The paper also proves the implementation algorithms to be complete and reasonable.