Automatic construction of the list of characteristic suffixes for an arbitrary flective language

The paper considers an algorithm that allows us to automatically construct a list of characteristic suffixes by the dictionary of stems with prescribe d morphological classes that are at our disposal. A set of heuristic rules of rejecting noninformative stems and cutting off the remaining informative stems is proposed starting from the comparison of similarity of neighborin g stems in the dictionary with the inverse alphabet order. The results of e ffectivity of work of the proposed algorithm are presented for the Russian, Ukrainian, and French languages.