Live data from Hacker News

I found the best anagram in English (2017)

blog.plover.com

101–110 of 236 posts

Re: I found the best anagram in English (2017)

#102
post #87

Earlier quoted context omitted.

Do pay attention. You wrote "Prior to Perl doing this was painful.". I highlighted how you contradicted the author's claim that it was easy to do using awk. Awk existed long before Perl.

What’s the word for when snark backfires?

krans

Re: I found the best anagram in English (2017)

#103
post #56

Previously on HN: https://news.ycombinator.com/item?id=13696196 Response by the author: https://blog.plover.com/lang/anagram-scoring-3.html

Inspired by the author's recent brief revisitings: https://blog.plover.com/addenda/202304.html and https://blog.plover.com/lang/etym/water-polo.html

The latter on diminutives is interesting. Wikipedia:

> Productive diminutives are infrequent to nonexistent in Standard English in comparison with many other languages.

https://en.m.wikipedia.org/wiki/List_of_diminutives_by_langu...

Re: I found the best anagram in English (2017)

#104
post #98

Earlier quoted context omitted.

> ELEVEN PLUS TWO = TWELVE PLUS ONE Goedel's incompleteness theorem fans would be drooling all over this

Why?

Because it would be another way of expressing this idea https://en.wikipedia.org/wiki/G%C3%B6del_numbering (yes it's not easy to understand)

Re: I found the best anagram in English (2017)

#105
post #6

That was pretty good for a one-word anagram. Back in the 1990s I wrote a program that generated anagrams for longer phrases and I was surprised to find these prescient ones: Saddam Hussein = He damns Saudis Charles Manson = Slasher con man David Letterman = Dead mitral vent Mary Jo Kopechne = My joke chaperon * Benito Mussolini = So, I bout Leninism Lee Harvey Oswald = Oe, why ever Dallas? * * "Chaperon" is a valid a…

Clint Eastwood = Old West Action is still my favorite serendiptious anagram. I also like the mathematically correct ELEVEN PLUS TWO = TWELVE PLUS ONE especially because it's also an numeric anagram 11 + 2 = 12 + 1

Things like that explain how some people get obsessed with numerology. Except, I find the anagrams like you and the previous commenter mentioned to be more impressive than anything numerologists produce.

Some of those are almost creepy in how they make so much sense.

Re: I found the best anagram in English (2017)

#106
Megachiropteran lit up helicopter for me (as soon as he worte it means mega-bat) and chiro- naturally zing'd the word chiropractor. First guess was 'opter'/'opter' must have something to do with flight and the o is shared as a connective and it means 'bone-flying'. Wrong: turns out -pter is Latin for 'wing', and so we have helico(l)-pter (helix-wing) and our featherless friends are chiro-pter (hand-wing).

Re: I found the best anagram in English (2017)

#107
post #67

This is the TXR Lisp interactive listener of TXR 285. Quit with :quit or Ctrl-D on an empty line. Ctrl-X ? for cheatsheet. TXR's sound system features 120 dB separation between quarreling audiophiles. 1> (flow "/usr/share/dict/words" file-get-lines (group-by sort) hash-values (keep-if cdr) (sort @1 : [chain car len])) (("ho" "oh") ("am" "ma") ("em" "me") ("no" "on") ("ah" "ha") ("it" "ti") ("mu" "um") ("eh" "he") ("a…

Waiting for someone to post a 4-symbol APL version (which makes use of a language feature added by an eccentric hedge fund millionaire in 2002 and removed in 2017, to ensure nobody ever runs it).

According to GPT-4, an equivalent APL one-liner is:

(⊢⌷⍨∘⍋∘≢¨)↑1<≢¨⊢⌸(⍋⊢)¨⎕NGET'/usr/share/dict/words'1

Re: I found the best anagram in English (2017)

#108

I'm a non-coding lurker here, but the only thing that ever motivated me to write my own program was to solve the newspaper anagram puzzle, "Jumble", faster than my wife. I wrote it in Basic, then re-wrote it in assembly language, I forget when. Then in Fortran while home bound during the first summer of the pandemic - to atone for my past sin of neglecting to learn Fortran when I had a chance in the late 1960's.

I dunno man, I’ve never heard of a “non-coder” rewriting the same program in three languages, including one round ‘just because’

Re: I found the best anagram in English (2017)

#109
post #82

Earlier quoted context omitted.

The point is that you don’t need a hash table implementation. And the normalization that is used as the sorting key doesn’t otherwise have good hash-like qualities (like constant size and a good distribution) and thus doesn’t especially deserve to be called a hash.

How do you extract the last (largest) entry for each normalized key from the sorted list? What is the command line function?

It can be a simple ~20 line C program that checks whether the previous line has the same normalized key as the current line. It doesn't require hashing. I didn't say you could do it all with standard unix programs.
Post reply on HN