In an imaginary language , there are only three distinct letters. For simplicity, we call them: " A ", " B " & " C ".
The following table illustrates the average frequency of characters across all sentences written in that language. In addition, a " space " is included in the table and all of these characters also have a distinct perimeter:
character | frequency | perimeter |
"A" | 0.36 | 2 |
"B" | 0.21 | 3 |
"C" | 0.29 | 1 |
"space" | 0.14 | 0 |
An "average sentence" takes the above frequencies into account to apply them to the character count of such a sentence.
However, it should represent
"real"
or possible sentence. This means that the count of each character can only be a
natural number
. The character with the higher
overall
frequency would take the spot in a "tie".
If there were
A's and
B's in a sentence from a language with only "A" and "B" according to the frequency table of that language, the "average sentence" would contain
B's and
A's.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Frequencies
A = 4 2 ∗ 0 . 3 6 = 1 5 . 1 2
B = 4 2 ∗ 0 . 2 1 = 8 . 8 2
C = 4 2 ∗ 0 . 2 9 = 1 2 . 8
s p a c e s = 4 2 ∗ 0 . 1 4 = 5 . 8 8
Flooring these values, we already have 4 0 "whole" characters, which means that we have to find the two characters nearest to their next integer respectively and add 1 to those:
A = 1 5
B = 9
C = 1 2
s p a c e s = 6
Now, we can just sum up the A's, B's and C's multiplied by their respective perimeters:
1 5 ⋅ 2 + 9 ⋅ 3 + 1 2 = 6 9