COMPLEXITY CLASS SEMANTIC-DEPENDENT WORD PROCESSING TASKS

Abstract

Consider the formal signs of class-dependent semantic word processing tasks, it proved of Np-complete procedural complexity. On the basis of the analogy between the problems of the backpack and automatic summarizationmethod shows the feasibility of using formal language skills, taking into account the reduction of procedural complexities. A universal approach to the treatment of the text, taking into account the links between entities, obtained its information and assessment of the ways to improve.