-
Notifications
You must be signed in to change notification settings - Fork 33
/
Copy pathlearn-lang-diary-part-six.lyx
6167 lines (4801 loc) · 128 KB
/
learn-lang-diary-part-six.lyx
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#LyX 2.3 created this file. For more info see http://www.lyx.org/
\lyxformat 544
\begin_document
\begin_header
\save_transient_properties true
\origin unavailable
\textclass article
\begin_preamble
\usepackage{url}
\usepackage{slashed}
\end_preamble
\use_default_options false
\maintain_unincluded_children false
\language english
\language_package default
\inputencoding utf8
\fontencoding global
\font_roman "times" "default"
\font_sans "helvet" "default"
\font_typewriter "cmtt" "default"
\font_math "auto" "auto"
\font_default_family default
\use_non_tex_fonts false
\font_sc false
\font_osf false
\font_sf_scale 100 100
\font_tt_scale 100 100
\use_microtype false
\use_dash_ligatures false
\graphics default
\default_output_format default
\output_sync 0
\bibtex_command default
\index_command default
\paperfontsize default
\spacing single
\use_hyperref true
\pdf_bookmarks true
\pdf_bookmarksnumbered false
\pdf_bookmarksopen false
\pdf_bookmarksopenlevel 1
\pdf_breaklinks true
\pdf_pdfborder true
\pdf_colorlinks true
\pdf_backref false
\pdf_pdfusetitle true
\papersize default
\use_geometry false
\use_package amsmath 2
\use_package amssymb 2
\use_package cancel 1
\use_package esint 0
\use_package mathdots 1
\use_package mathtools 1
\use_package mhchem 0
\use_package stackrel 1
\use_package stmaryrd 1
\use_package undertilde 1
\cite_engine basic
\cite_engine_type default
\biblio_style plain
\use_bibtopic false
\use_indices false
\paperorientation portrait
\suppress_date false
\justification true
\use_refstyle 0
\use_minted 0
\index Index
\shortcut idx
\color #008000
\end_index
\secnumdepth 3
\tocdepth 3
\paragraph_separation indent
\paragraph_indentation default
\is_math_indent 0
\math_numbering_side default
\quotes_style english
\dynamic_quotes 0
\papercolumns 1
\papersides 1
\paperpagestyle default
\listings_params "basicstyle={\ttfamily},basewidth={0.45em}"
\tracking_changes false
\output_changes false
\html_math_output 0
\html_css_as_file 0
\html_be_strict false
\end_header
\begin_body
\begin_layout Title
Language Learning Diary - Part Six
\end_layout
\begin_layout Date
Feb 2022 - March 2022
\end_layout
\begin_layout Author
Linas Vepštas
\end_layout
\begin_layout Abstract
The language-learning effort involves research and software development
to implement the ideas concerning unsupervised learning of grammar, syntax
and semantics from corpora.
This document contains supplementary notes and a loosely-organized semi-chronol
ogical diary of results.
The notes here might not always makes sense; they are a short-hand for
my own benefit, rather than aimed at you, dear reader!
\end_layout
\begin_layout Section*
Introduction
\end_layout
\begin_layout Standard
Part Six of the diary on the language-learning effort re-examines some older
data from a physical-science, graph-theoretic, information-theoretic viewpoint.
The
\begin_inset Quotes eld
\end_inset
older data
\begin_inset Quotes erd
\end_inset
here is primarily the data for word-pairs.
The first section defines the
\begin_inset Quotes eld
\end_inset
density of states
\begin_inset Quotes erd
\end_inset
in terms of the
\begin_inset Quotes eld
\end_inset
energy
\begin_inset Quotes erd
\end_inset
.
These are fundamental physics concepts appearing in thermodynamics; they're
mapped onto the analogous word-pair statistics concepts.
The second section examines a number of other quantities in this same conceptua
l framework.
Some of this repeats results reported earlier; here, a more comprehensive
approach is taken.
\end_layout
\begin_layout Standard
There is an implicit meta-goal, which is not achieved: to provide a statistical-
mechanical, field-theoretic framework for the language data.
This is explored only at a rather superficial level.
It feels like deeper analogies are certainly possible, but it is not clear
how these could offer insight.
\end_layout
\begin_layout Section*
Summary Conclusions
\end_layout
\begin_layout Standard
The most important result presented here is an analysis of the word-pair
MI distribution.
For the first time, it becomes clear that it factors into two parts: a
Gaussian distribution, arising from randomly-paired words, and a log-normal
distribution, arising from word-pairs that carry actual syntactic information.
This is obvious, in retrospect, and was always visible; just that now,
we have an rough explanation for the shape.
Here's the relevant graph, in full glory; it is explained towards the end
of the chapter.
\end_layout
\begin_layout Standard
\align center
\begin_inset Graphics
filename p6-density/pair-fmi-signal.eps
width 80col%
\end_inset
\end_layout
\begin_layout Standard
This chapter starts with definitions of some abstract concepts, followed
by some data analysis.
In order of appearance (and not in order of importance):
\end_layout
\begin_layout Itemize
The product topology.
The space of natural-language sentences is simply the collection of ordered
strings of words.
A
\begin_inset Quotes eld
\end_inset
sentence
\begin_inset Quotes erd
\end_inset
is just the Cartesian product of words in a vocabulary.
As a Cartesian-product space, it has a natural
\begin_inset Quotes eld
\end_inset
topology
\begin_inset Quotes erd
\end_inset
, the
\begin_inset Quotes eld
\end_inset
product topology
\begin_inset Quotes erd
\end_inset
.
The basis of product topologies are called
\begin_inset Quotes eld
\end_inset
cylinder sets
\begin_inset Quotes erd
\end_inset
; these are just sequences of specific words, interspersed with wild-cards.
Word-pairs are just specific cylinder sets: two words, with zero or more
wild-cards between them, and an arbitrary number of wild-cards before and
after them.
\end_layout
\begin_layout Itemize
Density of states, theoretical definition.
A
\begin_inset Quotes eld
\end_inset
state
\begin_inset Quotes erd
\end_inset
can be identified with a cylinder set in the product topology.
The
\begin_inset Quotes eld
\end_inset
energy
\begin_inset Quotes erd
\end_inset
of a state can be identified with the log of the probability of that state
(equivalently, the log of the measure of the cylinder set).
The density of states is then simply the distribution of the states, as
a function of their energy.
That is, for a given small but fixed interval of energy, how many states
are there in that interval? This is the density of states.
In thermodynamics and chemistry, this is a fundamental concept; for natural
language, it is novel, but worth asking about to see if any analogies hold.
\begin_inset Foot
status collapsed
\begin_layout Plain Layout
For example, in chemistry, there are lots of low-energy states at low temperatur
es; it is hard to have many high-energy states at low temperatures.
Typical distributions are the Maxwell-Boltzmann distribution for an ideal
gas; the Fermi-Dirac distribution for fermions, and the Bose-Einstein distribut
ion for supercooled quantum states.
The first is conventionally taught in college chemistry.
Is there anything analogous in natural language?
\end_layout
\end_inset
\end_layout
\begin_layout Itemize
Density of states, experimental result.
Consider the collection of all observed word-pairs
\begin_inset Formula $\left(w_{j},w_{k}\right)$
\end_inset
.
The frequency with which some word-pair is observed is
\begin_inset Formula $p\left(w_{j},w_{k}\right)$
\end_inset
and the energy is
\begin_inset Formula $E=-\log_{2}p$
\end_inset
.
The density of states
\begin_inset Formula $\rho\left(E\right)$
\end_inset
is then just a histogram: how many word-pairs were observed in a small,
finite-sized interval of energy? Making this histogram, one easily finds
that, to first order, its a nice straight line (on a semi-log graph), so
that the density of states is
\begin_inset Formula $\rho\left(E\right)\sim2^{-E}$
\end_inset
over a wide range, dropping off at the low and the high end due to under-sampli
ng effects.
This is, more or less, with some twists, a rephrasing of the old and well-known
result that the Zipfian distribution applies to word-pairs.
\end_layout
\begin_layout Itemize
The Zipf graph goes very nearly as 1/rank i.e.
as the classical Zipf with exponent 1.
However, it has a bit of a hump, as does
\begin_inset Formula $\rho\left(E\right)$
\end_inset
.
Looking more closely, at the top-1200 ranked pairs, the Zipf exponent is
3/4 (almost exactly) and not 1.
This is a so-called
\begin_inset Quotes eld
\end_inset
small-world
\begin_inset Quotes erd
\end_inset
exponent.
The open-world exponent of 1 kicks in above 1200.
This suggests that all word-pairs above 1200 are under-sampled.
This is out of a total of
\begin_inset Formula $10^{7}$
\end_inset
distinct word-pairs that were observed.
The small world is indeed small, the provinces vast.
\end_layout
\begin_layout Itemize
The
\begin_inset Formula $\rho\left(E\right)$
\end_inset
has a similar hump.
The constant slope can be removed by rescaling to
\begin_inset Formula $2^{E}\rho\left(E\right)$
\end_inset
which revels the precise form of the hump: it is exactly a (log-normal)
Gaussian!
\end_layout
\begin_layout Itemize
Closer examination reveals that the idea of a measure on a product topology
is naive and incorrect.
The first problem is that the size of the vocabulary is not fixed; the
larger the corpus, the more new words are found (proper names, geographical
place-names, slang, marketing terms, technical terms...) In the limit of infinite
vocabulary, this would imply that the measure is log-divergent, i.e.
is not a measure.
\end_layout
\begin_layout Itemize
A better theoretical foundation is needed.
(None is proposed here) Such a foundation would need to explain and characteriz
e:
\end_layout
\begin_deeper
\begin_layout Itemize
The under-sampling effect, and the location of the large-world to small-world
cross-over.
\end_layout
\begin_layout Itemize
The effect of human-scale finite sentence lengths on punctuation and determiners.
\end_layout
\end_deeper
\begin_layout Itemize
The under-sampling effect is foundational, and affects the graphed distributions
in all graphs in all chapters of this diary.
It's pervasive, and confounding, and makes it difficult to understand
\begin_inset Quotes eld
\end_inset
what's actually happening
\begin_inset Quotes erd
\end_inset
.
A preliminary sketch is made for how to untangle sample-size effects is
given.
\end_layout
\begin_layout Itemize
Earlier chapters explored marginal probabilities, fractional entropies,
mutual information, marginal MI and so on.
These are re-examined again here, this time as functions of
\begin_inset Formula $E$
\end_inset
\end_layout
\begin_layout Itemize
Vertex-degree graphs are presented.
Vertex-degree graphs are commonplace in network analysis; it seems fitting
to do that here.
A vertex is a word, and it's degree is the number of (distinct, unique)
word-pairs it occurs in.
For the range of
\begin_inset Formula $10\apprle D\apprle1200$
\end_inset
, the probability
\begin_inset Formula $p\left(D\right)$
\end_inset
of observing a word-vertex with degree
\begin_inset Formula $D$
\end_inset
goes as
\begin_inset Formula $p\left(D\right)\sim D^{-1.6}$
\end_inset
.
This is a small-world scaling exponent; it is far away from being a scale-free
network exponent.
Note that this is a statement about infrequent words; common words, like
\begin_inset Quotes eld
\end_inset
the
\begin_inset Quotes erd
\end_inset
will have a degree in the millions.
\end_layout
\begin_layout Itemize
The word-pair MI distribution is composed of two parts.
One part is a Gaussian, centered more or less on an MI of zero.
This Gaussian is purely due to selections of word-pairs having no syntactic
relationships, and contains no syntactic information.
Subtracting this leaves behind the word-pairs with the actual syntactic
information.
That distribution seems to be log-normal, i.e has strictly-positive MI.
\end_layout
\begin_layout Itemize
Distributions of the word-disjunct MI are presented.
They vaguely resemble the word-pair MI graphs, but are dirtier/uglier.
No particular insight is gained.
\end_layout
\begin_layout Itemize
The ranked-MI looks vaguely like a Laplacian.
Two ideas are developed: a fibered-Laplacian, and a Hamming-Laplacian.
Experimental data is shown for the Hamming-Laplacian.
It's curious, but provides no particular insight.
\end_layout
\begin_layout Standard
That's it.
Now on with the main text.
\end_layout
\begin_layout Section*
Field Theory Models and Statistical Mechanics
\end_layout
\begin_layout Standard
Field theory models applied to statistics and language have surely been
thrashed to death in the literature (of which I am only dimly aware; thus,
no bibliography.).
The below is an attempted recap of some basic ideas, recast into the notation
used locally in this diary.
After a few basic initial definitions, it rapidly devolves into a presentation
of experimental results (for word-pairs).
\end_layout
\begin_layout Subsection*
Density of States
\end_layout
\begin_layout Standard
Starting point is a discrete linear lattice of words in a sentence.
Associated to each sentence is a probability
\begin_inset Formula $p\left(w_{1},\cdots,w_{n}\right)$
\end_inset
for words
\begin_inset Formula $w_{k}$
\end_inset
and a sentence of length
\begin_inset Formula $n$
\end_inset
.
We do not know that probability; we just assume it exists
\emph on
a priori
\emph default
.
We can make experimental pair-wise observations of word-pairs as
\begin_inset Formula $\left(*,*,\cdots,*,w_{i},*,\cdots,*,w_{j},*,\cdots,*\right)$
\end_inset
of pairs of words
\begin_inset Formula $\left(w_{i},w_{j}\right)$
\end_inset
within the full sentence.
Note the former is a cylinder set,
\emph on
i.e.
\emph default
an element of the product topology on strings.
\end_layout
\begin_layout Standard
Let
\begin_inset Formula $\sigma=\left(w_{1},\cdots,w_{n}\right)$
\end_inset
be a string (the sentence).
Define the energy of a string as
\begin_inset Formula $E\left(\sigma\right)=-\log_{2}p\left(\sigma\right)$
\end_inset
and define the energy density as
\begin_inset Formula
\begin{align*}
\rho\left(E\right)= & \sum_{\sigma}\delta\left(E-E\left(\sigma\right)\right)\\
=C & \sum_{w_{i},w_{j}}\delta\left(E+\log_{2}p\left(w_{i},w_{j}\right)\right)
\end{align*}
\end_inset
where
\begin_inset Formula $\delta\left(x\right)$
\end_inset
is the Dirac delta function (in principle) or just a finite–width, but
thin Gaussian in practice, or, more plainly, just a box filter, so that
we can do histogram counting.
The constant
\begin_inset Formula $C$
\end_inset
appears because the sum over pairs is a multiple of the sum over all states;
it over-counts (since
\begin_inset Formula $\sum_{\sigma}=\sum_{w_{1},w_{2},\cdots,w_{n}}$
\end_inset
counts all words at all word-positions.) A formal derivation of the value
of
\begin_inset Formula $C$
\end_inset
from first principles seems tedious and unenlightening.
Not to worry, we can force it experimentally simply by requiring that
\begin_inset Formula
\[
\int\rho\left(E\right)dE=1
\]
\end_inset
I honestly do not recall if any of the prior diary entries ever supplied
a graph of
\begin_inset Formula $\rho\left(E\right)$
\end_inset
.
Better late than never?
\end_layout
\begin_layout Subsection*
Interpretation
\end_layout
\begin_layout Standard
The above definition of the density of states is motivated by the Boltzmann
distribution
\begin_inset Formula $p=e^{-\beta E}$
\end_inset
.
Taking the log of both sides and setting
\begin_inset Formula $\beta=1$
\end_inset
gives
\begin_inset Formula $E=-\log p$
\end_inset
.
\begin_inset Foot
status collapsed
\begin_layout Plain Layout
See Wikipedia,
\begin_inset CommandInset href
LatexCommand href
name "Boltzmann distribution"
target "https://en.wikipedia.org/wiki/Boltzmann_distribution"
literal "false"
\end_inset
for additional details.
\end_layout
\end_inset
\end_layout
\begin_layout Subsection*
Density of States - Experimental Result
\end_layout
\begin_layout Standard
Working with the Run-1 dataset `
\family sans
run-1-en_pairs-tranche-123.rdb
\family default
`.
This dataset is characterized in the subsection below.
To generate the histogram, simply create N bins, and increment by one whenever
\begin_inset Formula $-\log_{2}p\left(w_{i},w_{j}\right)$
\end_inset
lies within the bin boundaries.
\begin_inset Foot
status collapsed
\begin_layout Plain Layout
Use the script in `
\family sans
utils/density-of-states.scm
\family default
`
\end_layout
\end_inset
\end_layout
\begin_layout Standard
The graph below uses 200 bins, running between a lower bound of 7.0 and upper
bound of 30.0.
Thus, the width of each bin is
\begin_inset Formula $dh=23/200$
\end_inset
.
The data is as marked, and, to provide a sense of scale, the line
\begin_inset Formula $2^{E-30}$
\end_inset
is graphed.
Note that there is a scattering of dots at the upper-right and lower left
(zoom in to see them).
Dots correspond to non-empty bins in the histogram, with empty neighbors.
These dots have a special significance.
\end_layout
\begin_layout Standard
\align center
\begin_inset Graphics
filename p6-density/density.eps
width 80col%
\end_inset
\end_layout
\begin_layout Standard
This graph can be understood as a kind-of upside-down Zipfian distribution.
The scatter of dots at the top-right are the pairs that were seen only
a handful of times.
The topmost, rightmost dot corresponds to the word-pairs that were observed
only once, and thus have a very high
\begin_inset Formula $E$
\end_inset
.
Specifically,
\begin_inset Formula $E_{1}=\log_{2}985483375\approx29.8763$
\end_inset
for this point, as there was a grand total of 985 million pairs observed.
The density here is a Dirac delta spike, since there were 9215082 distinct,
unique word-pairs observed exactly once; thus
\begin_inset Formula $\rho\left(E_{1}\right)$
\end_inset
is normalized to
\begin_inset Formula $985483375/9215082/dh$
\end_inset
.
The next dots correspond to the number of distinct word-pairs that were
observed only twice, then three times,
\emph on
etc.
\emph default
until they run together into common bins in the histogram.
The dots at the bottom-left correspond to word-pairs there are extremely
common (typically involving the words
\begin_inset Quotes eld
\end_inset
the
\begin_inset Quotes erd
\end_inset
,
\begin_inset Quotes eld
\end_inset
a
\begin_inset Quotes erd
\end_inset
, punctuation.) These would be ranked first in a Zipfian distribution, thus
the bottom-left of this graph corresponds to the top-left of a Zipf graph.)
\end_layout
\begin_layout Standard
Note that if the counts in the right-most bins are smeared, so that they
are not delta functions, but smooth, then the right side of the graph would
twist down sharply.
It appears that it could be approximated by
\begin_inset Formula $(30-E)2^{E-30}$
\end_inset
.
Not shown; it would be nice to show this graph.
\end_layout
\begin_layout Standard
For comparison, below left is the conventional Zipf distribution graph,
and, on the right, the same graph flipped along the diagonal, together
with density of states from above.
\end_layout
\begin_layout Standard
\align center
\begin_inset Graphics
filename p6-density/pair-rank.eps
width 50col%
\end_inset
\begin_inset Graphics
filename p6-density/pair-rank-flip.eps
width 50col%
\end_inset
\end_layout
\begin_layout Subsubsection*
Under-sampling
\end_layout
\begin_layout Standard
The humpback shape appears to be due to an under-sampling effect.
This is exposed and explained in the next few sections.
Due to a finite sample size, it appears that the only pairs that are sufficient
ly sampled are those up to a rank of about 1200.
After that, pairs are under-sampled.
The result of that under-sampling is a humpback shape, as seen above; the
top of the hump is where the under-sampling begins.
This suggests that the eyeballed fit is incorrect, and that the Rank distributi
on should be considered only up to 1200.
This is shown below.
\end_layout
\begin_layout Standard
\align center
\begin_inset Graphics
filename p6-density/pair-rank-cut.eps
width 80col%
\end_inset
\end_layout
\begin_layout Standard
This time, the slope is different: it is 0.75, which is, umm, err, I guess
its a
\begin_inset Quotes eld
\end_inset
small world
\begin_inset Quotes erd
\end_inset
slope.
This is no longer the canonical Zipf slope of 1.0.
This raises the question: how many of the graphs in the earlier parts of
the diary are compromised, as being mixtures of under-sampling and
\begin_inset Quotes eld
\end_inset
actual effects
\begin_inset Quotes erd
\end_inset
? This also raises the question: aren't all learning effects always driven
by an under-sampling? That is, isn't one always doomed to under-sample?
How can one know this, and how can one take this into account?
\end_layout
\begin_layout Standard
Whence this magic number 1200?
\end_layout
\begin_layout Subsubsection*
Top-ten Word Pairs
\end_layout
\begin_layout Standard
Given the above discussion about under-sampling, it is hard to avoid noticing
that the top-ten word-pairs appear to follow an eve flatter slope.
What does this mean? Clearly, they are not under-sampled, and so the flatter
slope needs to have some more sophisticated explanation.
\end_layout
\begin_layout Standard
The top-ten most frequently observed word-pairs are shown in the table below:
\end_layout
\begin_layout Standard
\begin_inset VSpace defskip
\end_inset
\end_layout
\begin_layout Standard
\align center
\begin_inset Tabular
<lyxtabular version="3" rows="11" columns="3">
<features tabularvalignment="middle">
<column alignment="center" valignment="top">
<column alignment="center" valignment="top">
<column alignment="center" valignment="top">
<row>
<cell alignment="center" valignment="top" topline="true" bottomline="true" leftline="true" usebox="none">
\begin_inset Text
\begin_layout Plain Layout
Rank
\end_layout
\end_inset
</cell>
<cell alignment="center" valignment="top" topline="true" bottomline="true" leftline="true" usebox="none">
\begin_inset Text
\begin_layout Plain Layout
Count
\end_layout
\end_inset
</cell>
<cell alignment="center" valignment="top" topline="true" bottomline="true" leftline="true" rightline="true" usebox="none">
\begin_inset Text
\begin_layout Plain Layout
Pair (word <<> word)
\end_layout
\end_inset
</cell>
</row>
<row>
<cell alignment="center" valignment="top" topline="true" leftline="true" usebox="none">
\begin_inset Text
\begin_layout Plain Layout
\family roman
\series medium
\shape up
\size normal
\emph off
\bar no
\strikeout off
\xout off
\uuline off
\uwave off
\noun off
\color none
1
\end_layout
\end_inset
</cell>
<cell alignment="center" valignment="top" topline="true" leftline="true" usebox="none">
\begin_inset Text
\begin_layout Plain Layout
\family roman
\series medium
\shape up
\size normal
\emph off
\bar no
\strikeout off
\xout off
\uuline off
\uwave off
\noun off
\color none
4765096
\end_layout
\end_inset
</cell>
<cell alignment="center" valignment="top" topline="true" leftline="true" rightline="true" usebox="none">
\begin_inset Text
\begin_layout Plain Layout
\family roman
\series medium
\shape up
\size normal
\emph off
\bar no
\strikeout off
\xout off
\uuline off
\uwave off
\noun off
\color none
, <<>> and
\end_layout
\end_inset
</cell>
</row>
<row>
<cell alignment="center" valignment="top" topline="true" leftline="true" usebox="none">
\begin_inset Text
\begin_layout Plain Layout
2
\end_layout
\end_inset
</cell>
<cell alignment="center" valignment="top" topline="true" leftline="true" usebox="none">
\begin_inset Text
\begin_layout Plain Layout
4254477
\end_layout
\end_inset
</cell>
<cell alignment="center" valignment="top" topline="true" leftline="true" rightline="true" usebox="none">
\begin_inset Text