Re: From JoyceUlysses.txt -- words occurring exactly once

* Kaz Kylheku <20240530161942.627@kylheku.com> :
Wrote on Thu, 30 May 2024 23:20:08 -0000 (UTC):

On 2024-05-30, Stefan Monnier <monnier@iro.umontreal.ca> wrote:

Given a text file of a novel (JoyceUlysses.txt) ...
could someone give me a pretty fast (and simple) program that'd give me
a list of all words occurring exactly once?

>
    tr ' .;:,?!' '\n' | sort | uniq -u

>
Yep, that's pretty much how Doug McIlroy famously shut down Knuth.

https://www.cs.tufts.edu/~nr/cs257/archive/don-knuth/pearls-2.pdf

(how do you cite this?)

Knuth didn't invent the "hash trie" data structure for this the article,
it was already there in TeX, in this article knuth credits Frank Liang's
phd thesis for the data structure.

This was one of the first things things I coded up at the time of the
article.  The fun was in designing how to best modify the structure
without sacrificing space

Phil Bagwell's paper "Ideal Hash Trees" described its invention
correctly as Hash Array Mapped Tries. However at some point, (probably
after the coming from clojure developers with "functional" pretensions?)
the "hash trie" was appropriated meaning something else,
something"immutable" and all that.

At least there isn't a wiki page for it.