Arrangement for efficient storage of large quantities of text in the style of an associative field

摘要

When an associative field is used for efficient storage of large quantities of linguistic text, there are often conflict situations in the chaining. It is shown that intermediate memories are expediently used for code conversion, while complying with the Zipf curves, and the problem can thus be completely solved.