In this paper, we introduce graded matrix grammars of natural language, a variant of the matrix grammars proposed by <cite>Rudolph and Giesbrecht (2010)</cite> , and show a close correspondence between this matrix-space model and weighted finite automata.