Soft set theory has been evolved as a very useful mathematical tool to handle uncertainty and ambiguity associated with the real world data based structures. Parameters with certain conditions have been used to classify the data with the help of suitable functions. The aim of this paper is to relax conditions on parameters which lead us to propose some new concepts that consequently generalize existing comparable notions. We introduce the concepts of generalized finite soft equality (f −soft equality), generalized finite soft union (f −soft union) and generalized finite soft intersection (f −soft intersection) of two soft sets. We prove results involving operations introduced herein. Moreover, with the help of examples, it is shown that these operations are proper generalizations of existing comparable operations.