text::soundex(3pm) [redhat man page]

Text::Soundex(3pm)					 Perl Programmers Reference Guide					Text::Soundex(3pm)

NAME

       Text::Soundex - Implementation of the Soundex Algorithm as Described by Knuth

SYNOPSIS

	 use Text::Soundex;

	 $code = soundex $string;	     # get soundex code for a string
	 @codes = soundex @list;	     # get list of codes for list of strings

	 # set value to be returned for strings without soundex code

	 $soundex_nocode = 'Z000';

DESCRIPTION

       This module implements the soundex algorithm as described by Donald Knuth in Volume 3 of The Art of Computer Programming.  The algorithm is
       intended to hash words (in particular surnames) into a small space using a simple model which approximates the sound of the word when spo-
       ken by an English speaker.  Each word is reduced to a four character string, the first character being an upper case letter and the remain-
       ing three being digits.

       If there is no soundex code representation for a string then the value of $soundex_nocode is returned.  This is initially set to "undef",
       but many people seem to prefer an unlikely value like "Z000" (how unlikely this is depends on the data set being dealt with.)  Any value
       can be assigned to $soundex_nocode.

       In scalar context "soundex" returns the soundex code of its first argument, and in list context a list is returned in which each element is
       the soundex code for the corresponding argument passed to "soundex" e.g.

	 @codes = soundex qw(Mike Stok);

       leaves @codes containing "('M200', 'S320')".

EXAMPLES

       Knuth's examples of various names and the soundex codes they map to are listed below:

	 Euler, Ellery -> E460
	 Gauss, Ghosh -> G200
	 Hilbert, Heilbronn -> H416
	 Knuth, Kant -> K530
	 Lloyd, Ladd -> L300
	 Lukasiewicz, Lissajous -> L222

       so:

	 $code = soundex 'Knuth';	       # $code contains 'K530'
	 @list = soundex qw(Lloyd Gauss);      # @list contains 'L300', 'G200'

LIMITATIONS

       As the soundex algorithm was originally used a long time ago in the US it considers only the English alphabet and pronunciation.

       As it is mapping a large space (arbitrary length strings) onto a small space (single letter plus 3 digits) no inference can be made about
       the similarity of two strings which end up with the same soundex code.  For example, both "Hilbert" and "Heilbronn" end up with a soundex
       code of "H416".

AUTHOR

       This code was implemented by Mike Stok ("stok@cybercom.net") from the description given by Knuth.  Ian Phillipps ("ian@pipex.net") and Rich
       Pinder ("rpinder@hsc.usc.edu") supplied ideas and spotted mistakes.

perl v5.8.0							    2002-06-01							Text::Soundex(3pm)

htdig(1)						      General Commands Manual							  htdig(1)

NAME

       htfuzzy - fuzzy command-line search utility for the ht://Dig search engine

SYNOPSIS

       htfuzzy [-c configfile] [-v] algorithm [options]

DESCRIPTION

       Description to follow here

OPTIONS

       -c configfile
	      Use the specified configfile instead of the default.

       -v     Verbose mode Use this to get more verbose output while running htfuzzy. More than one v can be specified (ie.  -vv , -vvv
	       etc ). Specifying more than two v's is probably only useful for debugging purposes.

Supported Algorithms
       Different algorithms are supported for searching:
	      soundex  Creates	 a  slightly modified soundex key database. Differences with the standard soundex algorithm are: Keys are 6 digits
	      and the first letter is also encoded.	   metaphone Creates a metaphone key database. This algorithm is more specific to English,
	      but  will  get  fewer  "weird" matches than the soundex algorithm.

	      accents (No description of the algorithm at the moment)

	      endings Creates  two  databases  which  can  be  used  to match common word endings. The creation of these databases requires a list
	      of affix rules and a dictionary which uses those affix rules. The format of the affix  rules and	dictionary   files  are  the  ones
	      used  by	the  ispell program. Included with the distribution are the affix rules for English and a fairly small English dictionary.
	      Other languages can be supported	by  getting  the appropriate affix rules and dictionaries. These are available for many languages;
	      check the ispell distribution for more details.

	      synonyms	Creates a database of synonyms for words. It reads a text database of synonyms and creates a  database	that htsearch  can
	      then use. Each line of the text database consists of words where the first word will have the other words on that line as synonyms.

Notes on searching
       Please consult specialised literature to find out how the different algorithms work or simply try another
	      search strategy you do not get the intended search results.

FILES

       /etc/htdig/htdig.conf
	      The default configuration file.

SEE ALSO

       Please refer to the HTML pages (in the htdig-doc package) /usr/share/doc/htdig-doc/html/index.html and the manual  pages  htdigconfig(8)  ,
       htmerge(1) , htnotify(1) , htsearch(1) and rundig(1) for a detailed description of ht://Dig and its commands.

AUTHOR

       This  manual  page  was	written by Robert Ribnitz. It is based on documentation of ht://Dig, and on earlier manpages provided by Christian
       Schwarz and Stijn de Bekker.

								   21 July 1997 							  htdig(1)