pdf - Universität zu Köln

#Hash with encodings for combinations of two characters
#the § is probably to avoid later matching of UE in names like bauer ?
our %doublechars=(SC=>’C’, SZ=>’C’, CZ=>’C’, TZ=>’C’, SZ=>’C’, TS=>’C’,
KS=>’X’, PF=>’V’, QU=>’KW’, PH=>’V’, UE=>’Y’, AE=>’E’,
OE=>’Ö’, EI=>’AY’, EY=>’AY’, EU=>’OY’, AU=>’A§’, OU=>’§ ’);
sub PHONEM
{
my $string = uc shift;
#iterate over two character substitutions
foreach my $index (0..((length $string)-2))
{
if ($doublechars{substr $string,$index,2})
{
substr ($string,$index,2) = $doublechars{substr $string,$index,2};
}
}
#single character substitutions via tr
#umlauts are still lower case, since they are not converted by uc
$string =~tr/ZKGQäüIJflFWPT§àáéèúu^ooi^ı/CCCCEYYYSVVBDUAAEEUUOOYY/;
#delete forbidden characters by using the complementary operator
$string =~tr/ABCDLMNORSUVWXYö//cd;
#remove double chars
$string =~tr/ABCDLMNORSUVWXYö//s;
return $string;
}
1;
11.4 Implementation der Silbentrennung
# Syllabification algorithm tailored for german words as suggested by
# multiple authors as for Example
# Spencer, 1996, Phonology: theory and description
# ISBN 0-631-19233-6
#
# Martin Wilz 2004-12-10
70