X-Git-Url: http://git.shadowcat.co.uk/gitweb/gitweb.cgi?a=blobdiff_plain;f=lib%2FText%2FTradition%2FCollation%2FReading.pm;h=5b11f852c268eb27872d24c62c9a7778f3e25744;hb=a7f4020a1a1fd72aba6e25dc0a8f8aa9a1891202;hp=a2fff663c558c51835533d158950433b4ee77b8f;hpb=4cdd82f11ff3566dcb09b89aa7bc3ba908a5e677;p=scpubgit%2Fstemmatology.git

diff --git a/lib/Text/Tradition/Collation/Reading.pm b/lib/Text/Tradition/Collation/Reading.pm
index a2fff66..5b11f85 100644
--- a/lib/Text/Tradition/Collation/Reading.pm
+++ b/lib/Text/Tradition/Collation/Reading.pm
@@ -1,260 +1,409 @@
 package Text::Tradition::Collation::Reading;
 
 use Moose;
-use MooseX::NonMoose;
-use Text::Tradition::Collation::Position;
+use Moose::Util::TypeConstraints;
+use JSON qw/ from_json /;
+use Module::Load;
+use Text::Tradition::Error;
+use XML::Easy::Syntax qw( $xml10_name_rx $xml10_namestartchar_rx );
+use YAML::XS;
+use overload '""' => \&_stringify, 'fallback' => 1;
 
-extends 'Graph::Easy::Node';
+subtype 'ReadingID',
+	as 'Str',
+	where { $_ =~ /\A$xml10_name_rx\z/ },
+	message { 'Reading ID must be a valid XML attribute string' };
+	
+no Moose::Util::TypeConstraints;
 
-has 'position' => (
-    is => 'rw',
-    isa => 'Text::Tradition::Collation::Position',
-    predicate => 'has_position',
+=head1 NAME
+
+Text::Tradition::Collation::Reading - represents a reading (usually a word)
+in a collation.
+
+=head1 DESCRIPTION
+
+Text::Tradition is a library for representation and analysis of collated
+texts, particularly medieval ones.  A 'reading' refers to a unit of text,
+usually a word, that appears in one or more witnesses (manuscripts) of the
+tradition; the text of a given witness is composed of a set of readings in
+a particular sequence
+
+=head1 METHODS
+
+=head2 new
+
+Creates a new reading in the given collation with the given attributes.
+Options include:
+
+=over 4
+
+=item collation - The Text::Tradition::Collation object to which this
+reading belongs.  Required.
+
+=item id - A unique identifier for this reading. Required.
+
+=item text - The word or other text of the reading.
+
+=item is_start - The reading is the starting point for the collation.
+
+=item is_end - The reading is the ending point for the collation.
+
+=item is_lacuna - The 'reading' represents a known gap in the text.
+
+=item is_ph - A temporary placeholder for apparatus parsing purposes.  Do
+not use unless you know what you are doing.
+
+=item rank - The sequence number of the reading. This should probably not
+be set manually.
+
+=back
+
+One of 'text', 'is_start', 'is_end', or 'is_lacuna' is required.
+
+=head2 collation
+
+=head2 id
+
+=head2 text
+
+=head2 is_start
+
+=head2 is_end
+
+=head2 is_lacuna
+
+=head2 rank
+
+Accessor methods for the given attributes.
+
+=cut
+
+has 'collation' => (
+	is => 'ro',
+	isa => 'Text::Tradition::Collation',
+	# required => 1,
+	weak_ref => 1,
+	);
+
+has 'id' => (
+	is => 'ro',
+	isa => 'ReadingID',
+	required => 1,
+	);
+
+has 'text' => (
+	is => 'ro',
+	isa => 'Str',
+	required => 1,
+	writer => 'alter_text',
+	);
+	
+has 'language' => (
+	is => 'ro',
+	isa => 'Str',
+	predicate => 'has_language',
+	);
+	
+has 'is_start' => (
+	is => 'ro',
+	isa => 'Bool',
+	default => undef,
+	);
+
+has 'is_end' => (
+	is => 'ro',
+	isa => 'Bool',
+	default => undef,
+	);
+    
+has 'is_lacuna' => (
+    is => 'ro',
+    isa => 'Bool',
+	default => undef,
     );
+    
+has 'is_ph' => (
+	is => 'ro',
+	isa => 'Bool',
+	default => undef,
+	);
+	
+has 'is_common' => (
+	is => 'rw',
+	isa => 'Bool',
+	default => undef,
+	);
 
-# This contains an array of reading objects; the array is a pool,
-# shared by the reading objects inside the pool.  When a reading is
-# added to the pool, all the same_as attributes should be updated.
-has 'same_as' => (
+has 'rank' => (
     is => 'rw',
-    isa => 'ArrayRef[Text::Tradition::Collation::Reading]',
+    isa => 'Int',
+    predicate => 'has_rank',
+    clearer => 'clear_rank',
     );
+    
+## For morphological analysis
 
-# Deal with the non-arg option for Graph::Easy's constructor.
-around BUILDARGS => sub {
-    my $orig = shift;
-    my $class = shift;
-
-    my %args;
-    if( @_ == 1 && ref( $_[0] ) ne 'HASH' ) {
-	return $class->$orig( 'name' => $_[0] );
-    } else {
-	return $class->$orig( @_ );
-    }
-};
+has 'grammar_invalid' => (
+	is => 'rw',
+	isa => 'Bool',
+	default => undef,
+	);
+	
+has 'is_nonsense' => (
+	is => 'rw',
+	isa => 'Bool',
+	default => undef,
+	);
+
+has 'normal_form' => (
+	is => 'rw',
+	isa => 'Str',
+	predicate => 'has_normal_form',
+	);
+
+# Holds the lexemes for the reading.
+has 'reading_lexemes' => (
+	traits => ['Array'],
+	isa => 'ArrayRef[Text::Tradition::Collation::Reading::Lexeme]',
+	handles => {
+		lexeme => 'get',
+		lexemes => 'elements',
+		has_lexemes => 'count',
+		clear_lexemes => 'clear',
+		add_lexeme => 'push',
+		},
+	default => sub { [] },
+	);
+	
+## For prefix/suffix readings
+
+has 'join_prior' => (
+	is => 'ro',
+	isa => 'Bool',
+	default => undef,
+	);
+	
+has 'join_next' => (
+	is => 'ro',
+	isa => 'Bool',
+	default => undef,
+	);
 
-# Take constructor args as well as a Position argument.
-around position => sub {
-    my $orig = shift;
-    my $self = shift;
-    return $self->$orig() unless @_;
 
-    my @args = @_;
-    unless( @_ == 1 && ref( $_[0] ) eq 'Text::Tradition::Collation::Position' ) {
-	# We have constructor arguments; pass them to Position.
-	@args = ( Text::Tradition::Collation::Position->new( @_ ) );
+around BUILDARGS => sub {
+	my $orig = shift;
+	my $class = shift;
+	my $args;
+	if( @_ == 1 ) {
+		$args = shift;
+	} else {
+		$args = { @_ };
+	}
+			
+	# If one of our special booleans is set, we change the text and the
+	# ID to match.
+	if( exists $args->{'is_lacuna'} && !exists $args->{'text'} ) {
+		$args->{'text'} = '#LACUNA#';
+	} elsif( exists $args->{'is_start'} ) {
+		$args->{'id'} = '__START__';  # Change the ID to ensure we have only one
+		$args->{'text'} = '#START#';
+		$args->{'rank'} = 0;
+	} elsif( exists $args->{'is_end'} ) {
+		$args->{'id'} = '__END__';	# Change the ID to ensure we have only one
+		$args->{'text'} = '#END#';
+	} elsif( exists $args->{'is_ph'} ) {
+		$args->{'text'} = $args->{'id'};
+	}
+	
+	# Backwards compatibility for non-XMLname IDs
+	my $rid = $args->{'id'};
+	$rid =~ s/\#/__/g;
+	$rid =~ s/[\/,]/./g;
+    if( $rid !~ /^$xml10_namestartchar_rx/ ) {
+    	$rid = 'r'.$rid;
     }
-    $self->$orig( @args );
+	$args->{'id'} = $rid;
+	
+	$class->$orig( $args );
 };
 
-# Initialize the identity pool. 
+# Look for a lexeme-string argument in the build args.
 sub BUILD {
-    my( $self, $args ) = @_;
-    $self->same_as( [ $self ] );
+	my( $self, $args ) = @_;
+	if( exists $args->{'lexemes'} ) {
+		$self->_deserialize_lexemes( $args->{'lexemes'} );
+	}
 }
 
-sub text {
-    # Wrapper function around 'label' attribute.
-    my $self = shift;
-    if( @_ ) {
-	$self->set_attribute( 'label', $_[0] );
-    }
-    return $self->get_attribute( 'label' );
-}
+=head2 is_meta
+
+A meta attribute (ha ha), which should be true if any of our 'special'
+booleans are true.  Implies that the reading does not represent a bit 
+of text found in a witness.
 
-sub merge_from {
-    my( $self, $merged_node ) = @_;
-    # Adopt the identity pool of the other node.
-    my @now_identical = grep { $_ ne $merged_node } @{$merged_node->same_as};
-    my $new_pool = _merge_array_pool( \@now_identical, $self->same_as )
-	if @now_identical;
+=cut
 
-    # TODO Adopt the relationship attributes of the other node.
+sub is_meta {
+	my $self = shift;
+	return $self->is_start || $self->is_end || $self->is_lacuna || $self->is_ph;	
 }
 
-## Dealing with transposed readings.  These methods are only really
-## applicable if we have a linear collation graph.
+=head1 Convenience methods
 
-sub set_identical {
-    my( $self, $other_node ) = @_; 
-    my $enlarged_pool = _merge_array_pool( $self->same_as, 
-					   $other_node->same_as );
-
-    # ...and set this node to point to the enlarged pool.
-    $self->same_as( $enlarged_pool );
-}   
-
-sub identical_readings {
-    my $self = shift;
-    my @same = grep { $_ ne $self } @{$self->same_as};
-    return @same;
-}
+=head2 related_readings
 
-sub _merge_array_pool {
-    my( $pool, $main_pool ) = @_;
-    my %poolhash;
-    foreach ( @$main_pool ) {
-	# Note which nodes are already in the main pool so that we
-	# don't re-add them.
-	$poolhash{$_->name} = 1;
-    }
+Calls Collation's related_readings with $self as the first argument.
 
-    foreach( @$pool ) {
-	# Add the remaining nodes to the main pool...
-	push( @$main_pool, $_ ) unless $poolhash{$_->name};
-    }
-    return $main_pool;
-}
+=cut
 
-sub has_primary {
-    my $self = shift;
-    my $pool = $self->same_as;
-    return $pool->[0]->name ne $self->name;
+sub related_readings {
+	my $self = shift;
+	return $self->collation->related_readings( $self, @_ );
 }
 
-sub primary {
-    my $self = shift;
-    return $self->same_as->[0];
-}
+=head2 witnesses 
 
-sub is_at_position {
-    my $self = shift;
-    return undef unless $self->has_position;
-    return $self->position->is_colocated( @_ );
-}
+Calls Collation's reading_witnesses with $self as the first argument.
 
-# Returns all readings that adjoin this one on any path.
-sub neighbor_readings {
-    my( $self, $direction ) = @_;
-    $direction = 'both' unless $direction;
-    my @paths = grep { $_->isa( 'Text::Tradition::Collation::Path' ) } $self->edges;
-    my %connected;
-    foreach my $p ( @paths ) {
-	if( $p->to eq $self ) {
-	    next if $direction eq 'forward';
-	    $connected{$p->from->name} = $p->from;
-	} else { # $p->from eq $self
-	    next if $direction =~ /^back/;
-	    $connected{$p->to->name} = $p->to;
-	}
-    }
-    return values( %connected );
-}
+=cut
 
-sub adjust_neighbor_position {
-    my $self = shift;
-    return unless $self->position->fixed;
-
-    # TODO This is a naive and repetitive implementation and
-    # I don't like it.
-    foreach my $neighbor ( $self->neighbor_readings('forward') ) {
-	next unless !$neighbor->is_common &&
-	    $neighbor->position->common == $self->position->common;
-	if( $neighbor->position->fixed &&
-	    $neighbor->position->min == $self->position->min ) {
-	    warn sprintf( "Readings %s and %s are at the same position!",
-			  $neighbor->name, $self->name );
-	}
-	next if $neighbor->position->fixed || $neighbor->position->matched;
-	$neighbor->position->min( $self->position->min + 1 );
-	# Recurse if necessary.
-	$neighbor->adjust_neighbor_position() 
-	    unless $neighbor->position->fixed;
-    }
-    foreach my $neighbor ( $self->neighbor_readings('back') ) {
-	next unless !$neighbor->is_common &&
-	    $neighbor->position->common == $self->position->common;
-	if( $neighbor->position->fixed &&
-	    $neighbor->position->min == $self->position->min ) {
-	    warn sprintf( "Readings %s and %s are at the same position!",
-			  $neighbor->name, $self->name );
-	}
-	next if $neighbor->position->fixed || $neighbor->position->matched;
-	$neighbor->position->max( $self->position->max - 1 );
-	# Recurse if necessary.
-	$neighbor->adjust_neighbor_position() 
-	    unless $neighbor->position->fixed;
-    }
-    return;
+sub witnesses {
+	my $self = shift;
+	return $self->collation->reading_witnesses( $self, @_ );
 }
-    
-sub match_position {
-    my( $self, $other ) = @_;
-    $DB::single = 1;
-    # Adjust the position of both these nodes to be as restrictive as possible.
-    unless( $self->position->is_colocated( $other->position ) ) {
-	warn "Cannot match positions of non-colocated readings";
-	return;
-    }
-    my $sp = $self->position;
-    my $op = $other->position;
-    my $newmin = $sp->min > $op->min ? $sp->min : $op->min;
-    my $newmax = $sp->max < $op->max ? $sp->max : $op->max;
-    my $newpos = Text::Tradition::Collation::Position->new( 
-	'common' => $sp->common,
-	'min' => $newmin,
-	'max' => $newmax,
-	'matched' => 1,
-	);
-    # We are setting the positions to be the same object.  I don't
-    # think that actually matters.  We may eventually want unique
-    # objects for each position.
-    $self->position( $newpos );
-    $other->position( $newpos );
-    $self->adjust_neighbor_position();
-    $other->adjust_neighbor_position();
+
+=head2 predecessors
+
+Returns a list of Reading objects that immediately precede $self in the collation.
+
+=cut
+
+sub predecessors {
+	my $self = shift;
+	my @pred = $self->collation->sequence->predecessors( $self->id );
+	return map { $self->collation->reading( $_ ) } @pred;
 }
 
-## Keep track of which readings are unchanged across witnesses.
+=head2 successors
 
-sub is_common {
-    my( $self ) = shift;
-    return $self->get_attribute( 'class' ) eq 'common';
+Returns a list of Reading objects that immediately follow $self in the collation.
+
+=cut
+
+sub successors {
+	my $self = shift;
+	my @succ = $self->collation->sequence->successors( $self->id );
+	return map { $self->collation->reading( $_ ) } @succ;
 }
 
-sub make_common {
-    my( $self ) = shift;
-    $self->set_attribute( 'class', 'common' );
+=head2 set_identical( $other_reading)
+
+Backwards compatibility method, to add a transposition relationship
+between $self and $other_reading.  Don't use this.
+
+=cut
+
+sub set_identical {
+	my( $self, $other ) = @_;
+	return $self->collation->add_relationship( $self, $other, 
+		{ 'type' => 'transposition' } );
 }
 
-sub make_variant {
-    my( $self ) = shift;
-    $self->set_attribute( 'class', 'variant' );
+sub _stringify {
+	my $self = shift;
+	return $self->id;
 }
 
-no Moose;
-__PACKAGE__->meta->make_immutable;
+=head1 MORPHOLOGY
 
-1;
+Methods for the morphological information (if any) attached to readings.
+A reading may be made up of multiple lexemes; the concatenated lexeme
+strings ought to match the reading's normalized form.
+ 
+See L<Text::Tradition::Collation::Reading::Lexeme> for more information
+on Lexeme objects and their attributes.
 
-######################################################
-## copied from Graph::Easy::Parser docs
-######################################################
-# when overriding nodes, we also need ::Anon
+=head2 has_lexemes
 
-package Text::Tradition::Collation::Reading::Anon;
-use Moose;
-use MooseX::NonMoose;
-extends 'Text::Tradition::Collation::Reading';
-extends 'Graph::Easy::Node::Anon';
-no Moose;
-__PACKAGE__->meta->make_immutable;
+Returns a true value if the reading has any attached lexemes.
 
-1;
-# use base qw/Text::Tradition::Collation::Reading/;
-# use base qw/Graph::Easy::Node::Anon/;
+=head2 lexemes
 
-######################################################
-# and :::Empty
+Returns the Lexeme objects (if any) attached to the reading.
+
+=head2 clear_lexemes
+
+Wipes any associated Lexeme objects out of the reading.
+
+=head2 add_lexeme( $lexobj )
+
+Adds the Lexeme in $lexobj to the list of lexemes.
+
+=head2 lemmatize
+
+If the language of the reading is set, this method will use the appropriate
+Language model to determine the lexemes that belong to this reading.  See
+L<Text::Tradition::lemmatize> if you wish to lemmatize an entire tradition.
+
+=cut
+
+sub lemmatize {
+	my $self = shift;
+	unless( $self->has_language ) {
+		warn "Please set a language to lemmatize a tradition";
+		return;
+	}
+	my $mod = "Text::Tradition::Language::" . $self->language;
+	load( $mod );
+	$mod->can( 'reading_lookup' )->( $self );
+
+}
+
+# For graph serialization. Return a JSON representation of the associated
+# reading lexemes.
+sub _serialize_lexemes {
+	my $self = shift;
+	my $json = JSON->new->allow_blessed(1)->convert_blessed(1);
+	return $json->encode( [ $self->lexemes ] );
+}
+
+# Given a JSON representation of the lexemes, instantiate them and add
+# them to the reading.
+sub _deserialize_lexemes {
+	my( $self, $json ) = @_;
+	my $data = from_json( $json );
+	return unless @$data;
+	
+	# Need to have the lexeme module in order to have lexemes.
+	eval { use Text::Tradition::Collation::Reading::Lexeme; };
+	throw( $@ ) if $@;
+	
+	# Good to go - add the lexemes.
+	my @lexemes;
+	foreach my $lexhash ( @$data ) {
+		push( @lexemes, Text::Tradition::Collation::Reading::Lexeme->new(
+			'JSON' => $lexhash ) );
+	}
+	$self->clear_lexemes;
+	$self->add_lexeme( @lexemes );
+}
+
+## Utility methods
+
+sub TO_JSON {
+	my $self = shift;
+	return $self->text;
+}
+
+sub throw {
+	Text::Tradition::Error->throw( 
+		'ident' => 'Reading error',
+		'message' => $_[0],
+		);
+}
 
-package Text::Tradition::Collation::Reading::Empty;
-use Moose;
-use MooseX::NonMoose;
-extends 'Graph::Easy::Node::Empty';
 no Moose;
 __PACKAGE__->meta->make_immutable;
 
 1;
-# use base qw/Text::Tradition::Collation::Reading/;
-
-######################################################