[DL-Learner SVN] SF.net SVN: dl-learner:[2606] trunk

[<jen...@us...>]

Revision: 2606
          http://dl-learner.svn.sourceforge.net/dl-learner/?rev=2606&view=rev
Author:   jenslehmann
Date:     2011-01-12 13:43:38 +0000 (Wed, 12 Jan 2011)

Log Message:
-----------
namespaces in logging positive examples

Modified Paths:
--------------
    trunk/autosparql/src/test/java/org/dllearner/autosparql/server/NBRTest.java
    trunk/components-core/src/main/java/org/dllearner/utilities/Helper.java

Modified: trunk/autosparql/src/test/java/org/dllearner/autosparql/server/NBRTest.java
===================================================================
--- trunk/autosparql/src/test/java/org/dllearner/autosparql/server/NBRTest.java	2011-01-12 13:22:36 UTC (rev 2605)
+++ trunk/autosparql/src/test/java/org/dllearner/autosparql/server/NBRTest.java	2011-01-12 13:43:38 UTC (rev 2606)
@@ -5,8 +5,10 @@
 import java.net.URL;
 import java.util.ArrayList;
 import java.util.Collections;
+import java.util.HashMap;
 import java.util.HashSet;
 import java.util.List;
+import java.util.Map;
 import java.util.Set;
 import java.util.SortedSet;
 import java.util.TreeSet;
@@ -33,6 +35,7 @@
 import org.dllearner.sparqlquerygenerator.operations.nbr.strategy.GreedyNBRStrategy;
 import org.dllearner.sparqlquerygenerator.util.ModelGenerator;
 import org.dllearner.sparqlquerygenerator.util.ModelGenerator.Strategy;
+import org.dllearner.utilities.Helper;
 import org.junit.Test;
 
 import com.hp.hpl.jena.query.QuerySolution;
@@ -154,6 +157,11 @@
 	
 	@Test
 	public void optimisedTest(){
+		// basic setup
+		String baseURI = "http://dbpedia.org/resource/";
+		Map<String,String> prefixes = new HashMap<String,String>();
+		prefixes.put("dbo","http://dbpedia.org/ontology/");
+		
 		try {
 			SimpleLayout layout = new SimpleLayout();
 			ConsoleAppender consoleAppender = new ConsoleAppender(layout);
@@ -239,7 +247,7 @@
 			negTrees.add(tree);
 			
 //			logger.debug("Pos trees:\n " + printTrees(posTrees));
-			logger.info("Positive examples: " + posExamples);
+			logger.info("Positive examples: " + Helper.getAbbreviatedList(posExamples, baseURI, prefixes));
 			
 			QueryTree<String> lgg = lggGen.getLGG(posTrees);
 			
@@ -263,7 +271,7 @@
 					logger.info("Found new negative example " + uri);
 					negTrees.add(tree);
 				}
-				logger.info("Positive examples: " + posExamples);
+				logger.info("Positive examples: " + Helper.getAbbreviatedList(posExamples, baseURI, prefixes));
 //				logger.debug("Pos trees:\n " + printTrees(posTrees));
 				example = nbrGen.getQuestionOptimised(lgg, negTrees, knownResources);
 				learnedQuery = nbrGen.getQuery();

Modified: trunk/components-core/src/main/java/org/dllearner/utilities/Helper.java
===================================================================
--- trunk/components-core/src/main/java/org/dllearner/utilities/Helper.java	2011-01-12 13:22:36 UTC (rev 2605)
+++ trunk/components-core/src/main/java/org/dllearner/utilities/Helper.java	2011-01-12 13:43:38 UTC (rev 2606)
@@ -135,6 +135,30 @@
 		}
 	}
 
+	/**
+	 * Transforms a list of URIs into their abbreviated version.
+	 * @see #getAbbreviatedString(String, String, Map)
+	 * @param list List of URIs.
+	 * @param baseURI The base uri (ignored if null).
+	 * @param prefixes A prefix map (ignored if null), where each entry contains a
+	 *            short string e.g. ns1 as key and the corresponding uri as
+	 *            value.
+	 * @return A list with shortened URIs.
+	 */
+	public static String getAbbreviatedList(List<String> list, String baseURI,
+			Map<String, String> prefixes) {
+		StringBuffer str = new StringBuffer("[");
+		Iterator<String> it = list.iterator(); // easier to implement using an iterator than foreach
+		while(it.hasNext()) {
+			str.append(getAbbreviatedString(it.next(),baseURI,prefixes));
+			if(it.hasNext()) {
+				str.append(", ");
+			}
+		}
+		str.append("]");
+		return str.toString();
+	}
+	
 	public static String prettyPrintNanoSeconds(long nanoSeconds) {
 		return prettyPrintNanoSeconds(nanoSeconds, false, false);
 	}


This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.