In this paper we propose an algorithm for converting dependency structures to phrase structures. This algorithm mainly concerns the characteristics of non-configurational languages. We review current works in the field and on the basis of these works we try to adopt a more flexible approach to the problem. 1