/usr/share/guile/site/string/soundex.scm is in guile-library 0.2.2-0.2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 | ;; (string soundex) -- the soundex algorithm
;; Based on soundex.scm from SLIB, by jjb@isye.gatech.edu.
;; Copyright (C) 2003 Richard Todd
;; This program 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 3 of the License, or
;; (at your option) any later version.
;;
;; This program 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 this program. If not, see <http://www.gnu.org/licenses/>.
#!
;;; Commentary:
Soundex algorithm, taken from Knuth, Vol. 3 ``Sorting and searching'', pp 391--2
;;; Code:
!#
(define-module (string soundex)
#:export (soundex)
#:use-module (scheme documentation)
#:use-module (srfi srfi-1))
(define-with-docs soundex
"Performs the original soundex algorithm on the input @var{name}.
Returns the encoded string. The idea is for similar sounding
sames to end up with the same encoding.
@lisp
(soundex \"Aiza\")
=> \"A200\"
(soundex \"Aisa\")
=> \"A200\"
(soundex \"Aesha\")
=> \"A200\"
@end lisp"
(let* ((letters-to-omit
(list #\A #\E #\H #\I #\O #\U #\W #\Y))
(codes
(list (list #\B #\1)
(list #\F #\1)
(list #\P #\1)
(list #\V #\1)
;;
(list #\C #\2)
(list #\G #\2)
(list #\J #\2)
(list #\K #\2)
(list #\Q #\2)
(list #\S #\2)
(list #\X #\2)
(list #\Z #\2)
;;
(list #\D #\3)
(list #\T #\3)
;;
(list #\L #\4)
;;
(list #\M #\5)
(list #\N #\5)
;;
(list #\R #\6)))
(xform
(lambda (c)
(let ((code (assv c codes)))
(if code
(cadr code)
c)))))
(lambda (name)
(let ((char-list
(map char-upcase
(remove (lambda (c)
(not (char-alphabetic? c)))
(string->list name)))))
(if (null? char-list)
name
(let* ( ;; Replace letters except first with codes:
(n1 (cons (car char-list) (map xform char-list)))
;; If 2 or more letter with same code are adjacent
;; in the original name, omit all but the first:
(n2 (let loop ((chars n1))
(cond ((null? (cdr chars))
chars)
(else
(if (char=? (xform (car chars))
(cadr chars))
(loop (cdr chars))
(cons (car chars) (loop (cdr chars))))))))
;; Omit vowels and similar letters, except first:
(n3 (cons (car char-list)
(remove
(lambda (c)
(memv c letters-to-omit))
(cdr n2)))))
;;
;; pad with 0's or drop rightmost digits until of form "annn":
(let loop ((rev-chars (reverse n3)))
(let ((len (length rev-chars)))
(cond ((= 4 len)
(list->string (reverse rev-chars)))
((> 4 len)
(loop (cons #\0 rev-chars)))
((< 4 len)
(loop (cdr rev-chars))))))))))))
;;; arch-tag: 978c72d5-40bd-4e76-9af0-a74222a77b65
|