> coprophagist
Now that's something...
I found the best anagram in English (2017)
31–40 of 236 posts
Re: I found the best anagram in English (2017)
#32That 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…
I did Wikipedia article titles and found:
Atlantic casino resort spa / Carter assassination plot
Re: I found the best anagram in English (2017)
#33> I wouldn't have mentioned this, but someone on StackExchange actually asked this question. I wonder if the author realizes how condescending this is.
I'm listening. Please explain.
Re: I found the best anagram in English (2017)
#34Feels like the edit distance algorithm would be the natural fit here for scoring.
[deleted]
Re: I found the best anagram in English (2017)
#35Feels like the edit distance algorithm would be the natural fit here for scoring.
This came up the last time this was discussed here. It didn't work well.
https://gist.github.com/anonymous/431b163b2a2d532bfd0a3bdcc7...
See https://blog.plover.com/lang/anagram-scoring-3.html for more details.
Re: I found the best anagram in English (2017)
#36What’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:
Re: I found the best anagram in English (2017)
#37This is linked from a link, and describes anagrams being used to prove you were the first discoverer of something: https://spark.iop.org/puzzle-hookes-law#:~:text=When%20Hooke....
Re: I found the best anagram in English (2017)
#38That 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…
Ronald Wilson Reagan = Insane Anglo Warlord
Dick Cavett, https://www.nytimes.com/2018/08/04/style/dick-cavett-intervi...
> I guess I’ll be known for nothing more than being the man who realized that “Spiro Agnew” was “grow a penis.” Gore Vidal said, “It could be ‘grow a spine,’ too, but yours is better.”
Boy, they're really socking it to that Spiro Agnew guy again.
Re: I found the best anagram in English (2017)
#39Feels like the edit distance algorithm would be the natural fit here for scoring.
How does that do on the longest example found by the author, which he (correctly IMO) dismisses as uninteresting? cholecystoduodenostomy / duodenocholecystostomy
Scored by Levenenshtein distance, that is still fourth-highest.
Re: I found the best anagram in English (2017)
#40What’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...)