Live data from Hacker News

I found the best anagram in English (2017)

blog.plover.com

71–80 of 236 posts

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

#73

I thought integrals / triangles was much more interesting, despite the shorter length. None of the other long pairs have any meaningful relationship, except for maybe excitation / intoxicate

What you don't think all married people are admirers of sidearms /s > 7 admirer married > 7 admires sidearm

This one reminded me of those captcha cartoons that were popular for awhile. “Admires sidearm” in curved writing and a simple drawing.

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

#74
post #57

I wonder whether someone made a similar effort for finding the "most rhyming" words in English. Of course, since this would be based on sound, it would need to incorporate additional information besides spelling.

It also starts a huge argument about what kinds of rhyming are permitted (visual, sound, which accent, etc) - and some languages “rhyme” on things we wouldn’t use in English like the emphasis, etc.

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

#75
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…

How many generated anagrams do you have to skim through to find these gems? Was the program written in a way that limits the output to phrases that make at least some sense?

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

#76
post #36

What’s nostalgic to me is that this is such a classic Perl pattern: hashing manipulated strings to find relationships. Prior to Perl doing this was painful. Boost wasn’t a thing. Python was in its cradle and Java was still struggling with beans. Perl removed the barriers between complex coding ideas and an implementation that C wasn’t ready for. The time from thought to prototype was near instant compared to current…

Ummm, the author used awk for the first version in the 1990s. > This was easy to do, even at the time, when the word list itself, at 2.5 megabytes, was a file of significant size. Perl and its cousins were not yet common; in those days I used Awk. But the task is not very different in any reasonable language:

I know. I’m talking about Perl. Try to keep up.

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

#77
post #40

What’s nostalgic to me is that this is such a classic Perl pattern: hashing manipulated strings to find relationships. Prior to Perl doing this was painful. Boost wasn’t a thing. Python was in its cradle and Java was still struggling with beans. Perl removed the barriers between complex coding ideas and an implementation that C wasn’t ready for. The time from thought to prototype was near instant compared to current…

You don't _need_ to hash anything. The simplest way to do it, is to convert all the words to (normal_form, orig_word) pairs, write the list to a file, then sort it. It will be trivial to find the words with common normal form after the sort. (Of course, you wouldn't catch me trying to implement that with C if perl is an option...)

Go try your method and spot the bug. If you can’t, then respond and I’ll tell you. hint: you need one more manipulation to find the answer before or after the sort, there’s a command line version of it but it uses .. a hash.

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

#80

Jeremy’s Iron

Tell me you’re a millennial who grew up watching The Simpsons without etc etc.

Actually early genx. I don’t think most millennials were old enough for a lot of the jokes in 90’s simpsons as they were young teens. But glad you got it!
Post reply on HN