—our
$AUTHORITY
=
'cpan:MATY'
;
$PMLTQ::Relation::PDT::AEChildIterator::VERSION
=
'2.0.1'
;
# TRIAL
# ABSTRACT: Effective child relation iterator on a-nodes for PDT like treebanks
use
strict;
use
warnings;
use
PMLTQ::Relation {
name
=>
'echild'
,
schema
=>
'adata'
,
reversed_relation
=>
'implementation:eparent'
,
start_node_type
=>
'a-node'
,
target_node_type
=>
'a-node'
,
iterator_class
=> __PACKAGE__,
iterator_weight
=> 5,
test_code
=>
q( grep($_ == $start, PMLTQ::Relation::PDT::AGetEParents($end,\&PMLTQ::Relation::PDT::ADiveAuxCP)
) ? 1 : 0 ),
};
sub
get_node_list {
my
(
$self
,
$node
) =
@_
;
my
$type
=
$node
->type->get_base_type_name;
my
$fsfile
=
$self
->start_file;
return
[
map
[
$_
,
$fsfile
], PMLTQ::Relation::PDT::AGetEChildren(
$node
, \
&PMLTQ::Relation::PDT::ADiveAuxCP
) ];
}
1;
__END__
=pod
=encoding UTF-8
=head1 NAME
PMLTQ::Relation::PDT::AEChildIterator - Effective child relation iterator on a-nodes for PDT like treebanks
=head1 VERSION
version 2.0.1
=head1 AUTHORS
=over 4
=item *
Petr Pajas <pajas@ufal.mff.cuni.cz>
=item *
Jan Štěpánek <stepanek@ufal.mff.cuni.cz>
=item *
Michal Sedlák <sedlak@ufal.mff.cuni.cz>
=item *
Matyáš Kopp <matyas.kopp@gmail.com>
=back
=head1 COPYRIGHT AND LICENSE
This software is copyright (c) 2015 by Institute of Formal and Applied Linguistics (http://ufal.mff.cuni.cz).
This is free software; you can redistribute it and/or modify it under
the same terms as the Perl 5 programming language system itself.
=cut