Some flexible information retrieval systems using structure matching procedures

摘要: The comparison between stored information identifications and requests for is one of the principal tasks to be performed in automatic retrieval. In so-called descriptor systems, where represented by sets independent key words, this operation relatively simple, since it consists a respective "vertors" words. many retrieval systems has been found necessary or expedient use more complicated constructs identification information. Notably "role" indicators are often added identify various types "links" specify variety relations A complete document an item graph, consisting nodes branches nodes, respectively words matching such graphs with representing time consuming operation, particularly request structure can made match only partially incompletely.