1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
|
;;; soundex.el --- implement Soundex algorithm
;; Copyright (C) 1993, 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
;; Author: Christian Plaunt <chris@bliss.berkeley.edu>
;; Maintainer: FSF
;; Keywords: matching
;; Created: Sat May 15 14:48:18 1993
;; This file is part of GNU Emacs.
;; GNU Emacs is free software; you can redistribute it and/or modify
;; it under the terms of the GNU General Public License as published by
;; the Free Software Foundation; either version 2, or (at your option)
;; any later version.
;; GNU Emacs is distributed in the hope that it will be useful,
;; but WITHOUT ANY WARRANTY; without even the implied warranty of
;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
;; GNU General Public License for more details.
;; You should have received a copy of the GNU General Public License
;; along with GNU Emacs; see the file COPYING. If not, write to the
;; Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
;; Boston, MA 02110-1301, USA.
;;; Commentary:
;; The Soundex algorithm maps English words into representations of
;; how they sound. Words with vaguely similar sound map to the same string.
;;; Code:
(defvar soundex-alist
'((?B . "1") (?F . "1") (?P . "1") (?V . "1")
(?C . "2") (?G . "2") (?J . "2") (?K . "2") (?Q . "2") (?S . "2")
(?X . "2") (?Z . "2") (?D . "3") (?T . "3") (?L . "4") (?M . "5")
(?N . "5") (?R . "6"))
"Alist of chars-to-key-code for building Soundex keys.")
(defun soundex (word)
"Return a Soundex key for WORD.
Implemented as described in:
Knuth, Donald E. \"The Art of Computer Programming, Vol. 3: Sorting
and Searching\", Addison-Wesley (1973), pp. 391-392."
(let* ((word (upcase word)) (length (length word))
(code (cdr (assq (aref word 0) soundex-alist)))
(key (substring word 0 1)) (index 1) (prev-code code))
;; once we have a four char key, we're done
(while (and (> 4 (length key)) (< index length))
;; look up the code for each letter in word at index
(setq code (cdr (assq (aref word index) soundex-alist))
index (1+ index)
;; append code to key unless the same codes belong to
;; adjacent letters in the original string
key (concat key (if (or (null code) (string= code prev-code))
()
code))
prev-code code))
;; return a key that is 4 chars long and padded by "0"s if needed
(if (> 4 (length key))
(substring (concat key "000") 0 4)
key)))
;(defvar soundex-test
; '("Euler" "Gauss" "Hilbert" "Knuth" "Lloyd" "Lukasiewicz"
; "Ellery" "Ghosh" "Heilbronn" "Kant" "Ladd" "Lissajous")
; "\n Knuth's names to demonstrate the Soundex algorithm.")
;
;(mapcar 'soundex soundex-test)
;("E460" "G200" "H416" "K530" "L300" "L222"
; "E460" "G200" "H416" "K530" "L300" "L222")
(provide 'soundex)
;;; arch-tag: b2615a98-feb7-430e-a717-171086738953
;;; soundex.el ends here
|
