GO/OG/LE HI/TS
2005
http://kunst.no/alias/HJEMMESIDE/bjornmag/mpphp2004/2-LWGH2005.htm
REFERENCE PAGE
http://kunst.no/alias/HJEMMESIDE/bjornmag/mpphp2004/2-LWGH2005.pdf
PDF FILE (20KB)
A database is set up to include all possible N-letter words, in
alphabetical order. (N in this case is set equal to 2.) Each word is
then searched using a common search engine -- Google, in this case --
and the number of hits returned for each word is stored in a numeric
array. The array is then converted into a 2D graph, thus measuring in a
certain way the text’s structural degree of “commonness” in relation to
one particular span of time; namely, a single day, today, the cache’s
default setting, on 5-28-05.
This work makes use of a free MATLAB hit-count program called GHITS.
The rest of the calculations, designed by myself, are also done in
MATLAB and EXCEL.
There is no recognizable use that I can see for such an unusual method
of data-gathering. If it has any importance, it may remain to be
discovered only within the realms of pataphysics and art.
mwp
