Autographs

Due to the fact that my first article, Multilingual Quains , seems to be liked by fellow programmers, I want to continue and write a few more articles about all sorts of auto reference files . I have always been amazed at autoreference - recursion, fractals, quains, human self-consciousness ... Now I will begin to rant and I rightly throw something bad into karma. I'd better advise those who have not read it to read Hölstadter’s “Godel Asher Bach” Hofstadter. This is a brilliant book and hymn of autoreference. And now to the point.

Autographs .

As long as programmers write quains in different languages, those who have not yet mastered programming for some reason can do the same interesting and quite similar thing - writing autographs.
Autograms are natural language sentences that describe their own internal structure.

Examples of autograms:
')
This sentence is in Russian.

This sentence has five words.

In this sentence there is one preposition, one demonstrative pronoun, seven nouns, one adjective, one union and six numerals.

The phrase you read contains: two words “Phrase”, two words “which”, two words “you”, two words “read”, two words “contains”, twenty-five words “words”, two words “words” , two words “colon”, two words “commas”, two words “to”, two words “left”, two words “and”, two words “right”, two words “quotes”, two words “a”, two the words “also”, two words “point”, two words “one”, two words “one”, twenty two words “two”, three words “three”, two words “four”, three words “five”, four words “Twenty”, two words “thirty”, one colon, thirty s commas, for twenty-five left and right quotation marks, as well as one point.

In this sentence there are forty-four letters "a", thirty-four letters "b", forty-four letters "c", one letter "g", thirty-four letters "d", twenty-seven letters "e", one letter "e" , two letters “g”, one letter “z”, thirty letters “i”, one letter “y”, thirty-six letters “k”, two letters “l”, six letters “m”, nineteen letters “n”, twenty letters "o", three letters "p", eighteen letters "p", eleven letters "c", thirty-six letters "t", thirty-four letters "y", one letter "f", one letter "x", Fifteen letters "c", seven letters "h", four letters "sh", one letter "u ”, One letter“ ”, eighteen letters“ s ”, twenty one letters“ ”, two letters“ e ”, one letter“ y ”, and three letters“ i ”.

The principle of constructing such proposals (well, except for the very first example) is somewhat similar to the principle of constructing quineas - blank spaces are left that provide “freedom of fit” and are filled in when the rest of the autograph is already written.

And now the problem (you can solve it with the use of programming (I confess, I myself decided this way), but you can on paper).
A few years ago, I came up with the most simplified version of autographs. An autogram is a list of pairs. The first element in a pair is a digit, the second is the number of times this digit is found in the autogram.
Well, for example:

0-1
12
2 - 3
3 - 2

Read this follows:
0 in this autogram is found 1 time, 1 - 2 times, 2 - 3 times, 3 - 2 times.

A full autogram we will call the autogram, which uses all digits of the number system.
For a binary system, the full autogram may look like this:

0 - 11
1 - 100

For the ternary, so:

0 - 10
1 - 10
2 - 2

For the Quaternary, the very first of the above autographs is quite suitable (it will be an autogram in the same way in any system with a base greater than four, but there it will not be complete).

Well, the question is whether it is possible to create a complete autogram for any number system and whether there is a universal method for compiling such autograms.

Solving the problem here: dl.dropboxusercontent.com/u/20473637/autograms_solution.txt

PS I tried to find authors of autograms about words and letters. About the letters - Vyacheslav Kabanovich. I could not find the words.
About parts of speech - exclusive, invented specifically for this article!