Programming Praxis

11 Responses to “Anagrams”

1. FalconNL said

   April 10, 2009 at 12:30 PM

   In Haskell:

   import Data.List
   import GHC.Exts
   import Control.Arrow
   import Data.Map (Map, findWithDefault, fromList)
   
   main = do words' <- fmap lines $ readFile "words.txt"
             print . last . sortWith length $ map (anagrams (anagramMap words')) words'
   
   anagramMap :: &#91;String&#93; -> Map String [String]
   anagramMap = fromList . map (sort . head &&& id) . groupWith sort
   
   anagrams :: Map String [String] -> String -> [String]
   anagrams d s = findWithDefault [] (sort s) d
   

   Largest anagram class in my dictionary: [“pares”,”parse”,”pears”,”rapes”,”reaps”,”spare”,”spear”]
2. g said

   April 21, 2009 at 6:41 AM

   python:

   
   wordlist = [line.strip() for line in open("WORD.LST")]
   dic = {}
   for word in wordlist:
       dic.setdefault(len(word), set()).add(word)
   
   def find_anagrams(str):
       anagrams = ()
       if len(str) in dic:
           for word in dic[len(str)]:
               match = True
               for letter in frozenset(str):
                   if str.count(letter) != word.count(letter):
                       match = False
                       break
               if match:
                   anagrams += word,
       return anagrams
   
   def longest_anagram():
       anagrams = ()
       for key in dic:
           anagrams += tuple(find_anagrams(word) for word in dic[key])
       return max(anagrams, key=len)
   
3. Treaps « Programming Praxis said

   June 26, 2009 at 9:05 AM

   […] we have used in several exercises (Mark V. Shaney, Word Frequencies, Dodgson’s Doublets, Anagrams). Hash tables are often used as the underlying implementation for dictionaries, and in a previous […]
4. kryptosfan said

   June 30, 2009 at 3:29 PM

   I’m not much of a programmer but if we can look past that character deficit…

   Anyways, I’m looking at the puzzle sculpture Kryptos and think the keywords can be retrieved from the Morse Code messages via anagramming. I’m trying to recruit help from folks with an interest in anagrams across WordPress. I kept the details brief because it’s all available online. Besides help, I was wondering if there are anagram methods that work in an algorithmic method allowing you to systematically build a second plaintext message from the original. I may be grasping at straws here but I was hoping you and maybe your readers might have some direction for me as I feel rather lost. Thanks!
5. Abhijith said

   July 22, 2009 at 5:27 PM

   def anagram(file)
     table = []
   
     File.open(file).each_line do |word| # assumes one word per line
       unsorted = word.chomp             # get rid of \n
       sorted = unsorted.split("").sort.join("")
       if table.has_key?(sorted)
         table[sorted].push(unsorted)
       else
         table[sorted] = [].push(unsorted)
       end
     end
   
     table
   end
   
   def longest_anagram_class(hash)
     hash.sort_by { |k, v| -1 * v.length }.first.last
   end
   
   h = anagram("/usr/share/dict/words")
   puts "Longest anagram class #{longest_anagram_class(h).inspect}"
   
   

   output:
   => Longest anagram class [“angor”, “argon”, “goran”, “grano”, “groan”, “nagor”, “orang”, “organ”, “rogan”]
6. Abhijith said

   August 4, 2009 at 8:59 AM

   Improved version and shorter version.

    def anagram(file)  
      table = Hash.new { |hash, key| hash[key] = [] }
      
      File.open(file).each_line do |word| # assumes one word per line  
        unsorted = word.chomp             # get rid of \n  
        sorted = unsorted.split("").sort.join("")  
        table[sorted].push(unsorted)
      end  
      
      table  
    end  
      
    def longest_anagram_class(hash)  
      hash.sort_by { |k, v| -1 * v.length }.first.last  
    end  
      
    h = anagram("/usr/share/dict/words")  
    puts "Longest anagram class #{longest_anagram_class(h).inspect}"
   
7. An anagram measure « Alasdair’s musings said

   September 30, 2009 at 3:33 AM

   […] From an anagrams programming page: […]
8. Finding all anagrams in a dictionary using a signature based algorithm | Complete Coding said

   February 12, 2010 at 4:18 PM

   […] Phil from Programming Praxis had posted this problem in his post. You can also find the implementation in different languages. Share/BookmarkRelated […]
9. OraQA » Blog Archive » How to solve the Anagrams Puzzle in SQL said

   June 8, 2010 at 3:41 PM

   […] Anagrams Words that are formed from the same set of letters are anagrams of each other. For instance, pots, post, stop, spot, opts, and tops are anagrams. Your task is to write a program that, given a dictionary and an input word, prints all the anagrams of the input word. You are also to determine the largest anagram class in your dictionary. […]
10. Vikas Tandi said

    May 7, 2011 at 3:27 PM

    Here is my implementation in C
    http://codepad.org/Xx6GE4vU
11. ftt said

    March 6, 2014 at 11:57 PM

    https://github.com/ftt/programming-praxis/blob/master/20090410-anagrams/anagrams.py