Last chance! 50% off unlimited learning
Sale ends in
The Soundex phonetic algorithms
soundex(word, maxCodeLen = 4L)refinedSoundex(word, maxCodeLen = 10L)
string or vector of strings to encode
maximum length of the resulting encodings, in characters
soundex encoded character vector
The function soundex phonentically encodes the given
string using the soundex algorithm. The function refinedSoundex
uses Apache's refined soundex algorithm. Both implementations are loosely
based on the Apache Commons Java editons.
The variable maxCodeLen is the limit on how long the returned
soundex should be.
Charles P. Bourne and Donald F. Ford, "A study of methods for systematically abbreviating English words and names," Journal of the ACM, vol. 8, no. 4 (1961), p. 538-552.
Howard B. Newcombe, James M. Kennedy, "Record linkage: making maximum use of the discriminating power of identifying information," Communications of the ACM, vol. 5, no. 11 (1962), p. 563-566.
Other phonics: caverphone,
cologne, lein,
metaphone, mra_encode,
nysiis, rogerroot,
statcan
# NOT RUN {
soundex("wheel")
soundex(c("school", "benji"))
# }
Run the code above in your browser using DataLab