Select Code to Download

my %analysed = (
    baSlar     => ['plural'],
    baSlarimiz => ['plural', 'possessed by us'],
    baSimda    => ['possessed by me', 'locative'],
);

sub findroot {
    my @words = @_;
...
    #return the stem - i.e. the longest common element
    return [ sort { length $b <=> length $a } keys %stems ]->[0];
}

imda: 'possessed by me', 'locative'

use Algorithm::Permute qw( permute );
# not so fast as other modules, but it compiled OK on cygwin
...
    return if $incrnext;
    return @lengths;
}

@possibles = ( {
 'i'   => 'locative',
...
 'im'  => 'locative',
 'da'  => 'poss.by.me',
}, ........ );

my %analysed = (
    baSlar     => ['root:head', 'plural'],
    baSlarimiz => ['root:head', 'plural', 'possessed by us'],
    baSimda    => ['root:head', 'possessed by me', 'locative'],
);