РЕДАКЦИОННАЯ МЕТРИКА С ПОДСТАНОВКОЙ

In article analyzes the problems revealed by increasing the level of the definition of the line and the speed of the performance of fuzzy search engines. A new metric is revealed which reflect more accurate distance editing and similarity level. In particular, problems are considered when using Levenshtein or Dahmerau-Levenshtein distances, the greater the distance when changing the place of a word and its parts, the smaller the distance between short lines that do not descend to each other, the greater the distance between very long lines that are very similar to each other. Fuzzy algorithms have been developed and compared with existing algorithms to solve these problems.