View Javadoc
1   /*
2    * Licensed to the Apache Software Foundation (ASF) under one or more
3    * contributor license agreements.  See the NOTICE file distributed with
4    * this work for additional information regarding copyright ownership.
5    * The ASF licenses this file to You under the Apache License, Version 2.0
6    * (the "License"); you may not use this file except in compliance with
7    * the License.  You may obtain a copy of the License at
8    *
9    *      https://www.apache.org/licenses/LICENSE-2.0
10   *
11   * Unless required by applicable law or agreed to in writing, software
12   * distributed under the License is distributed on an "AS IS" BASIS,
13   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
14   * See the License for the specific language governing permissions and
15   * limitations under the License.
16   */
17  
18  package org.apache.commons.codec.language;
19  
20  /**
21   * Encodes a string into a Caverphone 1.0 value.
22   *
23   * This is an algorithm created by the Caversham Project at the University of Otago. It implements the Caverphone 1.0
24   * algorithm:
25   *
26   * @see <a href="https://en.wikipedia.org/wiki/Caverphone">Wikipedia - Caverphone</a>
27   * @see <a href="https://caversham.otago.ac.nz/files/working/ctp060902.pdf">Caverphone 1.0 specification</a>
28   * @since 1.5
29   *
30   * <p>This class is immutable and thread-safe.</p>
31   */
32  public class Caverphone1 extends AbstractCaverphone {
33  
34      private static final String SIX_1 = "111111";
35  
36      /**
37       * Constructs a new instance.
38       */
39      public Caverphone1() {
40          // empty
41      }
42  
43      /**
44       * Encodes the given String into a Caverphone value.
45       *
46       * @param source
47       *            String the source string
48       * @return A Caverphone code for the given String
49       */
50      @Override
51      public String encode(final String source) {
52          String txt = source;
53          if (txt == null || txt.isEmpty()) {
54              return SIX_1;
55          }
56  
57          // 1. Convert to lowercase
58          txt = txt.toLowerCase(java.util.Locale.ENGLISH);
59  
60          // 2. Remove anything not A-Z
61          txt = txt.replaceAll("[^a-z]", "");
62  
63          // 3. Handle various start options
64          // 2 is a temporary placeholder to indicate a consonant which we are no longer interested in.
65          txt = txt.replaceAll("^cough", "cou2f");
66          txt = txt.replaceAll("^rough", "rou2f");
67          txt = txt.replaceAll("^tough", "tou2f");
68          txt = txt.replaceAll("^enough", "enou2f");
69          txt = txt.replaceAll("^gn", "2n");
70  
71          // End
72          txt = txt.replaceAll("mb$", "m2");
73  
74          // 4. Handle replacements
75          txt = txt.replace("cq", "2q");
76          txt = txt.replace("ci", "si");
77          txt = txt.replace("ce", "se");
78          txt = txt.replace("cy", "sy");
79          txt = txt.replace("tch", "2ch");
80          txt = txt.replace("c", "k");
81          txt = txt.replace("q", "k");
82          txt = txt.replace("x", "k");
83          txt = txt.replace("v", "f");
84          txt = txt.replace("dg", "2g");
85          txt = txt.replace("tio", "sio");
86          txt = txt.replace("tia", "sia");
87          txt = txt.replace("d", "t");
88          txt = txt.replace("ph", "fh");
89          txt = txt.replace("b", "p");
90          txt = txt.replace("sh", "s2");
91          txt = txt.replace("z", "s");
92          txt = txt.replaceAll("^[aeiou]", "A");
93          // 3 is a temporary placeholder marking a vowel
94          txt = txt.replaceAll("[aeiou]", "3");
95          txt = txt.replace("3gh3", "3kh3");
96          txt = txt.replace("gh", "22");
97          txt = txt.replace("g", "k");
98          txt = txt.replaceAll("s+", "S");
99          txt = txt.replaceAll("t+", "T");
100         txt = txt.replaceAll("p+", "P");
101         txt = txt.replaceAll("k+", "K");
102         txt = txt.replaceAll("f+", "F");
103         txt = txt.replaceAll("m+", "M");
104         txt = txt.replaceAll("n+", "N");
105         txt = txt.replace("w3", "W3");
106         txt = txt.replace("wy", "Wy"); // 1.0 only
107         txt = txt.replace("wh3", "Wh3");
108         txt = txt.replace("why", "Why"); // 1.0 only
109         txt = txt.replace("w", "2");
110         txt = txt.replaceAll("^h", "A");
111         txt = txt.replace("h", "2");
112         txt = txt.replace("r3", "R3");
113         txt = txt.replace("ry", "Ry"); // 1.0 only
114         txt = txt.replace("r", "2");
115         txt = txt.replace("l3", "L3");
116         txt = txt.replace("ly", "Ly"); // 1.0 only
117         txt = txt.replace("l", "2");
118         txt = txt.replace("j", "y"); // 1.0 only
119         txt = txt.replace("y3", "Y3"); // 1.0 only
120         txt = txt.replace("y", "2"); // 1.0 only
121 
122         // 5. Handle removals
123         txt = txt.replace("2", "");
124         txt = txt.replace("3", "");
125 
126         // 6. put six 1s on the end
127         txt += SIX_1;
128 
129         // 7. take the first six characters as the code
130         return txt.substring(0, SIX_1.length());
131     }
132 
133 }