AN 0.92(6) AN 0.92(6) NNAAMMEE an - Anagram generator SSYYNNOOPPSSIISS aann [-w] [-c string] [-d dictionary] [-l number_words] [-m word_length] [-u string] [-n number_anagrams] [--words] [--contain string] [--dict dictionary] [--length num- ber_words] [--minimum word_length] [--used string] [--number number_anagrams] [--help] [--version] PHRASE DDEESSCCRRIIPPTTIIOONN aann finds all anagrams which can be made from the letters in PPHHRRAASSEE, using words in the specified dictionary (default=/usr/dict/words). OOPPTTIIOONNSS _-_w_, _-_-_w_o_r_d_s Print words that PPHHRRAASSEE letters can make, then exit. _-_c_, _-_-_c_o_n_t_a_i_n _s_t_r_i_n_g Only print anagrams which contain _s_t_r_i_n_g _-_d_, _-_-_d_i_c_t _d_i_c_t_i_o_n_a_r_y Use _d_i_c_t_i_o_n_a_r_y file to find words which letters in PPHHRRAASSEE can make _-_m_, _-_-_m_i_n_i_m_u_m _w_o_r_d___l_e_n_g_t_h Only uses words which are at least _w_o_r_d___l_e_n_g_t_h long. _-_u_, _-_-_u_s_e_d _s_t_r_i_n_g Considers that letters in _s_t_r_i_n_g have allready used when analyzing letters in PPHHRRAASSEE _-_l_, _-_-_l_e_n_g_t_h _n_u_m_b_e_r___w_o_r_d_s Finds anagrams which have a maximum of _n_u_m_b_e_r___w_o_r_d_s words in them, very useful when number of anagrams output is large. _-_n_, _-_-_n_u_m_b_e_r _n_u_m_b_e_r___a_n_a_g_r_a_m_s Specifies _n_u_m_b_e_r___a_n_a_g_r_a_m_s as the maximum number of anagrams to find. _-_-_h_e_l_p Print a usage message on standard output then exit 1 AN 0.92(6) AN 0.92(6) _-_-_v_e_r_s_i_o_n Print version information on standard output then exit EEXXAAMMPPLLEE an -c acid 'Richard Jones' Finds anagrams for _R_i_c_h_a_r_d _J_o_n_e_s which contain the word _a_c_i_d AAUUTTHHOORRSS _R_i_c_h_a_r_d _M_. _J_o_n_e_s (jonesr@latcs1.cs.latrobe.edu.au) - Coding and algorithm design. _J_u_l_i_a_n _A_s_s_a_n_g_e (proff@suburbia.net) - Algorithm design. CCOOPPYYRRIIGGHHTT Copyright (c) Free Software Foundation, 1996. Copyright (c) Richard M. Jones 1995, 1996, All rights reserved. BBUUGGSS Surely. Please report any bugs to jonesr@latcs1.cs.latrobe.edu.au Suggestions and contributions are also welcome. 2