File tree Expand file tree Collapse file tree
Expand file tree Collapse file tree Original file line number Diff line number Diff line change @@ -16,7 +16,8 @@ \section{Built-in Module \module{soundex}}
1616\begin {funcdesc }{get_soundex}{string}
1717Return the soundex hash value for a word; it will always be a
18186-character string. \var {string} must contain the word to be hashed,
19- with no leading whitespace; the case of the word is ignored.
19+ with no leading whitespace; the case of the word is ignored. (Note
20+ that the original algorithm produces a 4-character result.)
2021\end {funcdesc }
2122
2223\begin {funcdesc }{sound_similar}{string1, string2}
@@ -25,3 +26,16 @@ \section{Built-in Module \module{soundex}}
2526\code {get_soundex(\var {string1})} \code {==}
2627\code {get_soundex(\var {string2})}.
2728\end {funcdesc }
29+
30+
31+ \begin {seealso }
32+
33+ \seetext {Donald E. Knuth, \emph {Sorting and Searching, } vol. 3 in
34+ `` The Art of Computer Programming.'' Addison-Wesley Publishing
35+ Company: Reading, MA: 1973. pp.\ 391-392. Discusses the origin and
36+ usefulness of the algorithm, as well as the algorithm itself. Knuth
37+ gives his sources as \emph {U.S. Patents 1261167 } (1918) and
38+ \emph {1435663 } (1922), attributing the algorithm to Margaret K. Odell
39+ and Robert C. Russel. Additional references are provided.}
40+
41+ \end {seealso }
Original file line number Diff line number Diff line change @@ -16,7 +16,8 @@ \section{Built-in Module \module{soundex}}
1616\begin {funcdesc }{get_soundex}{string}
1717Return the soundex hash value for a word; it will always be a
18186-character string. \var {string} must contain the word to be hashed,
19- with no leading whitespace; the case of the word is ignored.
19+ with no leading whitespace; the case of the word is ignored. (Note
20+ that the original algorithm produces a 4-character result.)
2021\end {funcdesc }
2122
2223\begin {funcdesc }{sound_similar}{string1, string2}
@@ -25,3 +26,16 @@ \section{Built-in Module \module{soundex}}
2526\code {get_soundex(\var {string1})} \code {==}
2627\code {get_soundex(\var {string2})}.
2728\end {funcdesc }
29+
30+
31+ \begin {seealso }
32+
33+ \seetext {Donald E. Knuth, \emph {Sorting and Searching, } vol. 3 in
34+ `` The Art of Computer Programming.'' Addison-Wesley Publishing
35+ Company: Reading, MA: 1973. pp.\ 391-392. Discusses the origin and
36+ usefulness of the algorithm, as well as the algorithm itself. Knuth
37+ gives his sources as \emph {U.S. Patents 1261167 } (1918) and
38+ \emph {1435663 } (1922), attributing the algorithm to Margaret K. Odell
39+ and Robert C. Russel. Additional references are provided.}
40+
41+ \end {seealso }
You can’t perform that action at this time.
0 commit comments