diff --git a/src/fr/inrialpes/exmo/align/impl/method/NameAndPropertyAlignment.java b/src/fr/inrialpes/exmo/align/impl/method/NameAndPropertyAlignment.java
index 7597c50c9488b3cc9753aa127dab82accabba146..b83e37b1383efe67a4855df280f10509bfb44714 100644
--- a/src/fr/inrialpes/exmo/align/impl/method/NameAndPropertyAlignment.java
+++ b/src/fr/inrialpes/exmo/align/impl/method/NameAndPropertyAlignment.java
@@ -1,7 +1,7 @@
 /*
  * $Id$
  *
- * Copyright (C) INRIA, 2003-2004, 2007-2008
+ * Copyright (C) INRIA, 2003-2004, 2007-2009
  *
  * This program is free software; you can redistribute it and/or modify
  * it under the terms of the GNU Lesser General Public License as published by
@@ -34,6 +34,8 @@ import fr.inrialpes.exmo.align.impl.DistanceAlignment;
 import fr.inrialpes.exmo.align.onto.HeavyLoadedOntology;
 import fr.inrialpes.exmo.align.onto.OntologyFactory;
 
+import fr.inrialpes.exmo.ontosim.string.StringDistances;
+
 /** This class has been built for ISWC experiments with bibliography.
  * It implements a non iterative (one step) OLA algorithms based on
  * the name of classes and properties. It could be made iterative by
@@ -68,7 +70,7 @@ public class NameAndPropertyAlignment extends DistanceAlignment implements Align
     public void init(Object o1, Object o2, Object ontologies) throws AlignmentException {
 	super.init( o1, o2, ontologies );
 	if ( !( getOntologyObject1() instanceof HeavyLoadedOntology
-		&& getOntologyObject1() instanceof HeavyLoadedOntology ))
+		&& getOntologyObject2() instanceof HeavyLoadedOntology ))
 	    throw new AlignmentException( "NameAndPropertyAlignment requires HeavyLoadedOntology ontology loader" );
     }
 
@@ -77,6 +79,8 @@ public class NameAndPropertyAlignment extends DistanceAlignment implements Align
 	loadInit( alignment );
 	honto1 = (HeavyLoadedOntology<Object>)getOntologyObject1();
 	honto2 = (HeavyLoadedOntology<Object>)getOntologyObject2();
+	//System.err.println( honto1+" ==> "+honto1.getOntology() );
+	//System.err.println( honto2+" ==> "+honto2.getOntology() );
 	double threshold = 1.; // threshold above which distances are too high
 	int i, j = 0;     // index for onto1 and onto2 classes
 	int nbclass1 = 0; // number of classes in onto1