"HIS HONOUR: Do I understand your evidence to be that the
addresses for the first of three key strokes are worked out
prior to the program being loaded into the computer?---Your
Honour, those addresses are built into the index - the
frequency index file which is called, in the case of
traditional T frequency dot JJ or simplified S frequency dot JJ
Part of the file is this table and it is pre-calculated by the
program which makes the table and it is simply loaded from the
disk and placed on the file, placed into the memory at the time
the program is first started.
.....
MR. GARNSEY: You said that the table - I think it was T
frequency JJ, to take the traditional version number - - -?---
Yes.
- - - was made when the program was loaded?--- No, it's made
well prior to that. It's made when the index was calculated,
which is done not with this program at all, with another.
What index?---The index being the tree and the table and the
word index.
You say the index being the tree and the table and the word
index?---Yes.
By the table, do you mean the table T frequency JJ?---No, no.
There's three parts to T frequency JJ It's not a single entity.
It's a single file but there are three parts of it. One is this
tree structure, one part.
Yes?---The second part is the table which is called the look-up
table or the go-to table or whatever you want to describe it
as, which is on example 3 of Thomas Rogers statement, and then
there is another section to do with the word index which brings
back our word help, which is not mentioned anywhere at all.
And when you said the tree section, you had in front of you
exhibit 29 of Mr Rogers' statement and you pointed to, did you,
page 2 of TR2?---Yes.
Now, I may have misunderstood your answer, but I thought you
said you used the programme to create the table when the
programme was first run?---No, I didn't - I haven't said that
at all, I don't think. If I have given that impression - that
is wrong. The table is not created by the programme. We have
got to specify which programme. It is not created by the
Jiejing programme which is loaded, no.
Is it created by another programme?---It is created by another
programme, but it is not part of the - of what was sold with
Jiejing.
And what is that other programme?---That programme is CC not
EXC.
Yes, and is that programme used to create the tree as well?---
It creates the entire structure necessary to retrieve the
characters in this matter.
And if you change the table would it be necessary to change the
tree?---They have to be related, of course, yes.
And the operation of the creation of those - of the three and
the table, I put to you, is a presearch of the entire data base
created, as you say, by Dr Chappell?---That is again a great
jump of things. There are a lot of stages in between there.
That statement is not - I can't say yes or no to anything
because there are a number of sections. If you break it up I
can answer each individual part.
Now the tree, though, is originally created, is it not, from a
search of the entire data base?---It's - no, it's created from
a file called Frequency.DBF. Frequency.DBF contains the
frequency values for the various characters and words used
within a particular version of the programme. The master data
base contains all words - that is Chinese words and their
stroke categories untruncated - that is complete. It is - there
is no truncation in the master data base. It has all of the
characters and all of the strokes, and that is equally true if
they're Japanese, Chinese, or Korean, for that matter. And from
that we select according to the ones which have a frequency for
that particular language that we're creating the frequency file
for - the T frequency file, for example, we select which
characters are going to be included and at that point that
creates the tree, the table, and the word associations".