Steps of the computation
- Data 0: the text
- "Bereishit" (the Book of Genesis) as a sequence of 78,064
- Step 0->1: classifying
- Data 1: relevant letters
- Each letter of the given word occurs in the text a lot of
- Step 1->2: searching for
- Data 2: ELS's
- Equidistant letter sequences (ELS's) spelling out the given
- Step 2->3: sorting ELS's
- Data 3: families
- Families of equally perturbed ELS's.
- Step 3->4: how
noteworthy is each ELS?
- Data 4: domains of
- Step 4->5: comparing two
- Data 5: distance between
- Step 5->6: correcting
- Data 6: the corrected
What for did I cut the program in six? Surely it does not
make it faster. Rather, it makes it
understandable and verifiable.
Intermediate data, formerly invisible, became intermediate
files, open to inspection. Moreover, we can test each step
separately by modifying its input file manually and observing
the effect on its output file.