Return True if ch1 and ch2 are both vowels or both consonants.
489590
def same_syllabic_feature(ch1, ch2):
    ''''''
    if ch1 == '.' or ch2 == '.':
        return False

    ch1 = 'V' if ch1 in VOWELS else 'C' if ch1 in CONSONANTS else None
    ch2 = 'V' if ch2 in VOWELS else 'C' if ch2 in CONSONANTS else None

    return ch1 == ch2
266571
def curp
      all_letters = CONSONANTS + VOWELS
      hm = %w[H M]
      date = ::Time.at(rand * ::Time.now.to_f).strftime('%y%m%d')
      [
        fetch_sample(CONSONANTS),
        fetch_sample(VOWELS),
        fetch_sample(all_letters, count: 2).join,
        date,
        fetch_sample(hm),
        fetch_sample(ESTADOS_CURP),
        fetch_sample(CONSONANTS, count: 3).join,
        fetch_sample(HOMOCLAVE),
        rand(0..9)
      ].join
    end
906352
def isclose(a, b, rtol=1e-5, atol=1e-8):
    """"""
    return abs(a - b) < (atol + rtol * abs(b))
371886
public static boolean isSibling(String p1, String p2)
   {
      int pos1 = p1.lastIndexOf('/');
      int pos2 = p2.lastIndexOf('/');
      return (pos1 == pos2 && pos1 >= 0 && p1.regionMatches(0, p2, 0, pos1));
   }
324369
function acceptable(value) {
  return vowels.test(value.charAt(0))
    ? value.length > 1
    : value.length > 2 && vowels.test(value)
}
388862
def apply_T5(word):
    ''''''
    WORD = _split_consonants_and_vowels(word)

    for k, v in WORD.iteritems():

        if len(v) >= 3 and is_vowel(v[0]):
            vv = [v.find(i) for i in i_DIPHTHONGS if v.find(i) > 0]

            if any(vv):
                vv = vv[0]

                if vv == v[0]:
                    WORD[k] = v[:2] + '.' + v[2:]

                else:
                    WORD[k] = v[:vv] + '.' + v[vv:]

    word = _compile_dict_into_word(WORD)

    return word
741163
protected function isSameFilesystem(
        /*# string */ $path1,
        /*# string */ $path2
    )/*# : bool */ {
        return $this->path($path1)->getFilesystem() === $this->path($path2)->getFilesystem();
    }
565399
public boolean areUnified(E e1, E e2) {
	return find(e1).equals(find(e2));
    }
504929
def vowelinstem(self):
        """"""
        for i in range(self.k0, self.j + 1):
            if not self.cons(i):
                return 1
        return 0
240258
public static boolean keyMatch(String key1, String key2) {
        int i = key2.indexOf('*');
        if (i == -1) {
            return key1.equals(key2);
        }

        if (key1.length() > i) {
            return key1.substring(0, i).equals(key2.substring(0, i));
        }
        return key1.equals(key2.substring(0, i));
    }
101682
def consonants(self):
        
        return IPAString(ipa_chars=[c for c in self.ipa_chars if c.is_consonant])
690422
def compare(string1, string2):
    
    if len(string1) != len(string2):
        return False
    result = True
    for c1, c2 in izip(string1, string2):
        result &= c1 == c2
    return result
1036200
def aligned(e1, e2):
    
    return (
        any(close(c1, c2) for c1, c2 in zip(e1.bbox, e2.bbox))
        or x_center_aligned(e1, e2)
        or y_center_aligned(e1, e2)
    )
40522
def _starts_with_vowel(self, letter_group: str) -> bool:
        """"""
        if len(letter_group) == 0:
            return False
        return self._contains_vowels(letter_group[0])
836548
def _character_matches(name1, name2):
    
    if name1[0] == "*":
        for i in range(len(name2) + 1):
            yield 1, i
    if name2[0] == "*":
        for i in range(len(name1) + 1):
            yield i, 1
    if name1[0] == name2[0]:
        yield 1, 1
1147390
def is_letter(char, strict=True):
	
	if (char in chart.consonants) or (char in chart.vowels):
		return True

	if not strict:
		return unicodedata.category(char) in ['Ll', 'Lo', 'Lt', 'Lu']

	return False
313012
private boolean charsMatch(char[] chars, int pos1, int len1, int pos2, int len2) {
        if (len1 != len2) {
            return false;
        }
        if (pos1 + len1 > chars.length || pos2 + len2 > chars.length) {
            return false;
        }
        for (int i = 0; i < len1; i++) {
            if (chars[pos1 + i] != chars[pos2 + i]) {
                return false;
            }
        }
        return true;
    }