<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0"><channel><title>Recent changes to news</title><link>http://sourceforge.net/p/s-match/news/</link><description>Recent changes to news</description><language>en</language><lastBuildDate>Mon, 18 Jul 2011 20:26:55 -0000</lastBuildDate><item><title>S-Match Won ESWC 7 Years Award</title><link>http://sourceforge.net/p/s-match/news/2011/07/s-match-won-eswc-7-years-award/</link><description>&lt;div class="markdown_content"&gt;&lt;p&gt;We are happy to share with you  that S-Match seminal paper has&lt;br /&gt;
won an inaugural ESWC 7 Years Award.&lt;/p&gt;
&lt;p&gt;About Award&lt;br /&gt;
-------------&lt;br /&gt;
Grigoris Antoniou, ESWC 2011, General Chair: &lt;br /&gt;
The  idea  is  to  go  back  7  years,  and find what the most&lt;br /&gt;
influential  paper  was  that  was  presented  at  ESWC or its &lt;br /&gt;
predecessors.&lt;/p&gt;
&lt;p&gt;&lt;a href="http://semanticmatching.org/s-match-eswc-7-years-award.html" rel="nofollow"&gt;http://semanticmatching.org/s-match-eswc-7-years-award.html&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;About S-Match&lt;br /&gt;
-------------&lt;br /&gt;
S-Match is a semantic matching framework. &lt;/p&gt;
&lt;p&gt;S-Match takes any two tree like structures  (such as  database&lt;br /&gt;
schemas, classifications, lightweight ontologies)  and returns&lt;br /&gt;
a set  of  correspondences  between  those  tree  nodes  which&lt;br /&gt;
semantically correspond to one another.&lt;/p&gt;
&lt;p&gt;S-Match applies as a solution in many fields, including:&lt;br /&gt;
* information integration,&lt;br /&gt;
* ontology evolution and alignment,&lt;br /&gt;
* peer-to-peer information sharing,&lt;br /&gt;
* digital libraries integration,&lt;br /&gt;
* web service composition,&lt;br /&gt;
* agent communication, and&lt;br /&gt;
* query answering on the web.&lt;/p&gt;
&lt;p&gt;Resources&lt;br /&gt;
---------&lt;br /&gt;
Homepage:&lt;br /&gt;
&lt;a href="http://semanticmatching.org" rel="nofollow"&gt;http://semanticmatching.org&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Download:&lt;br /&gt;
&lt;a href="http://semanticmatching.org/download.html" rel="nofollow"&gt;http://semanticmatching.org/download.html&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Documentation:&lt;br /&gt;
&lt;a href="http://semanticmatching.org/documentation.html" rel="nofollow"&gt;http://semanticmatching.org/documentation.html&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Mailing Lists:&lt;br /&gt;
&lt;a href="http://lists.sourceforge.net/mailman/listinfo/s-match-announce"&gt;http://lists.sourceforge.net/mailman/listinfo/s-match-announce&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Forums:&lt;br /&gt;
&lt;a href="http://sourceforge.net/projects/s-match/forums/"&gt;http://sourceforge.net/projects/s-match/forums/&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;RSS News Feed:&lt;br /&gt;
&lt;a href="http://sourceforge.net/export/rss2_keepsake.php?group_id=288592"&gt;http://sourceforge.net/export/rss2_keepsake.php?group_id=288592&lt;/a&gt;&lt;/p&gt;&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Aliaksandr Autayeu</dc:creator><pubDate>Mon, 18 Jul 2011 20:26:55 -0000</pubDate><guid>http://sourceforge.net01eb468c337d01558ea677d2398939dc6dcd0b75</guid></item><item><title>ANN: GeoWordNet Public Dataset Updated</title><link>http://sourceforge.net/p/s-match/news/2011/04/ann-geowordnet-public-dataset-updated/</link><description>&lt;div class="markdown_content"&gt;&lt;p&gt;ANN: GeoWordNet Public Dataset Updated&lt;/p&gt;
&lt;p&gt;GeoWordNet Public Dataset is now available in WordNet and RDF formats.&lt;/p&gt;
&lt;p&gt;WordNet format allows to use GeoWordNet Public dataset via WordNet access libraries available for many  programming languages. For Java we recommend extJWNL.&lt;/p&gt;
&lt;p&gt;RDF format allows to use GeoWordNet Public dataset via all RDF-compatible software.&lt;/p&gt;
&lt;p&gt;About GeoWordNet&lt;br /&gt;
----------------&lt;br /&gt;
GeoWordNet is a semantic resource built from the full integration of WordNet, GeoNames and the Italian part of MultiWordNet.&lt;/p&gt;
&lt;p&gt;GeoWordNet Public Dataset contains&lt;br /&gt;
* 3,698,238 entities, &lt;br /&gt;
* 3,698,237 part-of relations between entities, &lt;br /&gt;
* 334 concepts, &lt;br /&gt;
* 182 relations between concepts, &lt;br /&gt;
* 3,698,238 relations between instances and concepts, and &lt;br /&gt;
* 13,562 (English and Italian) alternative entity names. &lt;/p&gt;
&lt;p&gt;The GeoWordNet Public Dataset is distributed under the Creative Commons Attribution (CC-BY) license terms and conditions. &lt;/p&gt;
&lt;p&gt;It can be freely downloaded from: &lt;br /&gt;
&lt;a href="http://geowordnet.semanticmatching.org" rel="nofollow"&gt;http://geowordnet.semanticmatching.org&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Subscribe to S-Match low traffic mailing list or RSS news feed to receive further announcements.&lt;/p&gt;
&lt;p&gt;Resources&lt;br /&gt;
---------&lt;br /&gt;
Homepage:&lt;br /&gt;
&lt;a href="http://geowordnet.semanticmatching.org" rel="nofollow"&gt;http://geowordnet.semanticmatching.org&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Documentation:&lt;br /&gt;
&lt;a href="http://semanticmatching.org/documentation.html" rel="nofollow"&gt;http://semanticmatching.org/documentation.html&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Download:&lt;br /&gt;
&lt;a href="http://geowordnet.semanticmatching.org" rel="nofollow"&gt;http://geowordnet.semanticmatching.org&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Mailing Lists:&lt;br /&gt;
&lt;a href="http://lists.sourceforge.net/mailman/listinfo/s-match-announce"&gt;http://lists.sourceforge.net/mailman/listinfo/s-match-announce&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Forums:&lt;br /&gt;
&lt;a href="http://sourceforge.net/projects/s-match/forums/"&gt;http://sourceforge.net/projects/s-match/forums/&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;RSS News Feed:&lt;br /&gt;
&lt;a href="http://sourceforge.net/export/rss2_keepsake.php?group_id=2885921"&gt;http://sourceforge.net/export/rss2_keepsake.php?group_id=2885921&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;extJWNL:&lt;br /&gt;
&lt;a href="http://extjwnl.sourceforge.net"&gt;http://extjwnl.sourceforge.net&lt;/a&gt;&lt;/p&gt;&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Aliaksandr Autayeu</dc:creator><pubDate>Mon, 04 Apr 2011 20:28:05 -0000</pubDate><guid>http://sourceforge.nete3a42a56a631949a5dbfb3ddc9444030a015c7f1</guid></item><item><title>ANN: S-Match Open Source Updated</title><link>http://sourceforge.net/p/s-match/news/2010/09/ann-s-match-open-source-updated/</link><description>&lt;div class="markdown_content"&gt;&lt;p&gt;ANNOUNCING S-Match Open Source, new release.&lt;/p&gt;
&lt;p&gt;About S-Match&lt;br /&gt;
-------------&lt;br /&gt;
S-Match is a semantic matching framework. &lt;/p&gt;
&lt;p&gt;S-Match takes any two tree like structures  (such as  database&lt;br /&gt;
schemas, classifications, lightweight ontologies)  and returns&lt;br /&gt;
a set  of  correspondences  between  those  tree  nodes  which&lt;br /&gt;
semantically correspond to one another.&lt;/p&gt;
&lt;p&gt;S-Match applies as a solution in many fields, including:&lt;br /&gt;
* information integration,&lt;br /&gt;
* ontology evolution and alignment,&lt;br /&gt;
* peer-to-peer information sharing,&lt;br /&gt;
* digital libraries integration,&lt;br /&gt;
* web service composition,&lt;br /&gt;
* agent communication, and&lt;br /&gt;
* query answering on the web.&lt;/p&gt;
&lt;p&gt;About Current Release&lt;br /&gt;
---------------------&lt;/p&gt;
&lt;p&gt;The release of 2010.09.18 contains these improvements:&lt;br /&gt;
* new GUI with edit and advanced navigation facilities&lt;br /&gt;
* SPSM integrated&lt;br /&gt;
* additional knowledge bases&lt;br /&gt;
* additional renderer&lt;br /&gt;
* precision and recall calculation filters&lt;/p&gt;
&lt;p&gt;Resources&lt;br /&gt;
---------&lt;br /&gt;
Homepage:&lt;br /&gt;
&lt;a href="http://semanticmatching.org" rel="nofollow"&gt;http://semanticmatching.org&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Download:&lt;br /&gt;
&lt;a href="http://semanticmatching.org/download.html" rel="nofollow"&gt;http://semanticmatching.org/download.html&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Documentation:&lt;br /&gt;
&lt;a href="http://semanticmatching.org/documentation.html" rel="nofollow"&gt;http://semanticmatching.org/documentation.html&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Mailing Lists:&lt;br /&gt;
&lt;a href="http://lists.sourceforge.net/mailman/listinfo/s-match-announce"&gt;http://lists.sourceforge.net/mailman/listinfo/s-match-announce&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Forums:&lt;br /&gt;
&lt;a href="http://sourceforge.net/projects/s-match/forums/"&gt;http://sourceforge.net/projects/s-match/forums/&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;RSS News Feed:&lt;br /&gt;
&lt;a href="http://sourceforge.net/export/rss2_keepsake.php?group_id=288592"&gt;http://sourceforge.net/export/rss2_keepsake.php?group_id=288592&lt;/a&gt;&lt;/p&gt;&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Aliaksandr Autayeu</dc:creator><pubDate>Tue, 21 Sep 2010 21:16:12 -0000</pubDate><guid>http://sourceforge.net0d25451fb592a01bc2ddcc0c75ea6d9694c3509f</guid></item><item><title>ANN: GeoWordNet Public Dataset Released</title><link>http://sourceforge.net/p/s-match/news/2010/08/ann-geowordnet-public-dataset-released/</link><description>&lt;div class="markdown_content"&gt;&lt;p&gt;==================================&lt;br /&gt;
GeoWordNet Public Dataset Released&lt;br /&gt;
==================================&lt;/p&gt;
&lt;p&gt;ANNOUNCING GeoWordNet Public Dataset, the first release.&lt;/p&gt;
&lt;p&gt;About GeoWordNet&lt;br /&gt;
----------------&lt;br /&gt;
GeoWordNet  is  a  semantic  resource  built  from  the   full &lt;br /&gt;
integration of  WordNet,  GeoNames  and  the  Italian  part of &lt;br /&gt;
MultiWordNet.&lt;/p&gt;
&lt;p&gt;GeoWordNet Public Dataset contains&lt;br /&gt;
* 3,698,238 entities, &lt;br /&gt;
* 3,698,237 part-of relations between entities, &lt;br /&gt;
* 334 concepts, &lt;br /&gt;
* 182 relations between concepts, &lt;br /&gt;
* 3,698,238 relations between instances and concepts, and &lt;br /&gt;
* 13,562 (English and Italian) alternative entity names. &lt;/p&gt;
&lt;p&gt;The GeoWordNet Public Dataset is distributed under the Creative&lt;br /&gt;
Commons Attribution (CC-BY) license terms and conditions. &lt;/p&gt;
&lt;p&gt;It can be freely downloaded from: &lt;a href="http://semanticmatching.org/" rel="nofollow"&gt;http://semanticmatching.org/&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Subscribe to S-Match low traffic mailing list or RSS news feed&lt;br /&gt;
to receive further announcements.&lt;/p&gt;
&lt;p&gt;Resources&lt;br /&gt;
---------&lt;br /&gt;
Homepage:&lt;br /&gt;
&lt;a href="http://semanticmatching.org" rel="nofollow"&gt;http://semanticmatching.org&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Documentation:&lt;br /&gt;
&lt;a href="http://semanticmatching.org/documentation.html" rel="nofollow"&gt;http://semanticmatching.org/documentation.html&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Download:&lt;br /&gt;
&lt;a href="http://semanticmatching.org/download.html" rel="nofollow"&gt;http://semanticmatching.org/download.html&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Mailing Lists:&lt;br /&gt;
&lt;a href="http://lists.sourceforge.net/mailman/listinfo/s-match-announce"&gt;http://lists.sourceforge.net/mailman/listinfo/s-match-announce&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Forums:&lt;br /&gt;
&lt;a href="http://sourceforge.net/projects/s-match/forums/"&gt;http://sourceforge.net/projects/s-match/forums/&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;RSS News Feed:&lt;br /&gt;
&lt;a href="http://sourceforge.net/export/rss2_keepsake.php?group_id=288592"&gt;http://sourceforge.net/export/rss2_keepsake.php?group_id=288592&lt;/a&gt;&lt;/p&gt;&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Aliaksandr Autayeu</dc:creator><pubDate>Mon, 09 Aug 2010 17:34:58 -0000</pubDate><guid>http://sourceforge.net1980e3a8f94b09fc7e5cb8cf8adbf9755927b86b</guid></item><item><title>ANN: S-Match Open Source Updated</title><link>http://sourceforge.net/p/s-match/news/2010/06/ann-s-match-open-source-updated/</link><description>&lt;div class="markdown_content"&gt;&lt;p&gt;===============================================================&lt;br /&gt;
S-Match Open Source Updated&lt;br /&gt;
===============================================================&lt;/p&gt;
&lt;p&gt;ANNOUNCING S-Match Open Source, new release.&lt;/p&gt;
&lt;p&gt;About S-Match&lt;br /&gt;
-------------&lt;br /&gt;
S-Match is a semantic matching framework. &lt;/p&gt;
&lt;p&gt;S-Match takes any two tree like structures  (such as  database&lt;br /&gt;
schemas, classifications, lightweight ontologies)  and returns&lt;br /&gt;
a set  of  correspondences  between  those  tree  nodes  which&lt;br /&gt;
semantically correspond to one another.&lt;/p&gt;
&lt;p&gt;S-Match applies as a solution in many fields, including:&lt;br /&gt;
* information integration,&lt;br /&gt;
* ontology evolution and alignment,&lt;br /&gt;
* peer-to-peer information sharing,&lt;br /&gt;
* digital libraries integration,&lt;br /&gt;
* web service composition,&lt;br /&gt;
* agent communication, and&lt;br /&gt;
* query answering on the web.&lt;/p&gt;
&lt;p&gt;About Current Release&lt;br /&gt;
---------------------&lt;/p&gt;
&lt;p&gt;The release of 2010.06.16 contains these improvements:&lt;br /&gt;
* improved CLI &amp;amp; API&lt;br /&gt;
* added API demos&lt;br /&gt;
* added AlignAPI integration&lt;br /&gt;
* refactored configuration to be component-based&lt;br /&gt;
* refactored datastructures for iterator-style access&lt;br /&gt;
(for example, loading from a database) &lt;br /&gt;
* refactored datastructures for sparse mappings&lt;br /&gt;
* improved speed&lt;br /&gt;
* updated third-party libraries&lt;br /&gt;
* refactored match manager for easier integration&lt;br /&gt;
* added simple XML loaders and savers&lt;br /&gt;
* improved code comments&lt;/p&gt;
&lt;p&gt;Resources&lt;br /&gt;
---------&lt;br /&gt;
Homepage:&lt;br /&gt;
&lt;a href="http://semanticmatching.org" rel="nofollow"&gt;http://semanticmatching.org&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Download:&lt;br /&gt;
&lt;a href="http://semanticmatching.org/download.html" rel="nofollow"&gt;http://semanticmatching.org/download.html&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Documentation:&lt;br /&gt;
&lt;a href="http://semanticmatching.org/documentation.html" rel="nofollow"&gt;http://semanticmatching.org/documentation.html&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Mailing Lists:&lt;br /&gt;
&lt;a href="http://lists.sourceforge.net/mailman/listinfo/s-match-announce"&gt;http://lists.sourceforge.net/mailman/listinfo/s-match-announce&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Forums:&lt;br /&gt;
&lt;a href="http://sourceforge.net/projects/s-match/forums/"&gt;http://sourceforge.net/projects/s-match/forums/&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;RSS News Feed:&lt;br /&gt;
&lt;a href="http://sourceforge.net/export/rss2_keepsake.php?group_id=288592"&gt;http://sourceforge.net/export/rss2_keepsake.php?group_id=288592&lt;/a&gt;&lt;/p&gt;&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Aliaksandr Autayeu</dc:creator><pubDate>Thu, 17 Jun 2010 19:10:44 -0000</pubDate><guid>http://sourceforge.net0d2eccace9fc5c66c6166a24e3bad6d115b79bb6</guid></item><item><title>ANN: S-Match Open Source, the first release</title><link>http://sourceforge.net/p/s-match/news/2010/03/ann-s-match-open-source-the-first-release/</link><description>&lt;div class="markdown_content"&gt;&lt;p&gt;=======================================================&lt;br /&gt;
S-Match Open Source Released&lt;br /&gt;
=======================================================&lt;/p&gt;
&lt;p&gt;ANNOUNCING S-Match Open Source, the first release.&lt;/p&gt;
&lt;p&gt;About S-Match&lt;br /&gt;
--------------&lt;br /&gt;
S-Match is a semantic matching framework. &lt;/p&gt;
&lt;p&gt;S-Match takes any two tree like structures  (such as  database&lt;br /&gt;
schemas, classifications, lightweight ontologies)  and returns&lt;br /&gt;
a set  of  correspondences  between  those  tree  nodes  which&lt;br /&gt;
semantically correspond to one another.&lt;/p&gt;
&lt;p&gt;S-Match  contains  implementations  of  the semantic matching,&lt;br /&gt;
minimal semantic matching  and structure  preserving semantic&lt;br /&gt;
matching algorithms.&lt;/p&gt;
&lt;p&gt;S-Match applies as a solution in many fields, including:&lt;br /&gt;
* information integration,&lt;br /&gt;
* ontology evolution and alignment,&lt;br /&gt;
* peer-to-peer information sharing,&lt;br /&gt;
* digital libraries integration,&lt;br /&gt;
* web service composition,&lt;br /&gt;
* agent communication, and&lt;br /&gt;
* query answering on the web.&lt;/p&gt;
&lt;p&gt;S-Match is extendable to host new algorithms.&lt;/p&gt;
&lt;p&gt;Subscribe to S-Match low traffic mailing list or RSS news feed&lt;br /&gt;
to receive further announcements.&lt;/p&gt;
&lt;p&gt;Resources&lt;br /&gt;
---------&lt;br /&gt;
Homepage:&lt;br /&gt;
&lt;a href="http://semanticmatching.org" rel="nofollow"&gt;http://semanticmatching.org&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Documentation:&lt;br /&gt;
&lt;a href="http://semanticmatching.org/documentation.html" rel="nofollow"&gt;http://semanticmatching.org/documentation.html&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Download:&lt;br /&gt;
&lt;a href="http://semanticmatching.org/download.html" rel="nofollow"&gt;http://semanticmatching.org/download.html&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Bug Tracker:&lt;br /&gt;
&lt;a href="http://sourceforge.net/apps/trac/s-match/"&gt;http://sourceforge.net/apps/trac/s-match/&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Mailing Lists:&lt;br /&gt;
&lt;a href="http://lists.sourceforge.net/mailman/listinfo/s-match-announce"&gt;http://lists.sourceforge.net/mailman/listinfo/s-match-announce&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Forums:&lt;br /&gt;
&lt;a href="http://sourceforge.net/projects/s-match/forums/"&gt;http://sourceforge.net/projects/s-match/forums/&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;RSS News Feed:&lt;br /&gt;
&lt;a href="http://sourceforge.net/export/rss2_keepsake.php?group_id=288592"&gt;http://sourceforge.net/export/rss2_keepsake.php?group_id=288592&lt;/a&gt;&lt;/p&gt;&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Aliaksandr Autayeu</dc:creator><pubDate>Mon, 08 Mar 2010 23:28:03 -0000</pubDate><guid>http://sourceforge.net5b3398b7762a7d8ef056b82c4f7e6769c87c7477</guid></item></channel></rss>