History of wordnet
The changes to the source code of this entry in the repository, newest first, each with the differences it made to the entry's files. They are also listed on GitLab.
[entries] Add the date when each entry was added, and remove icon_hash beff7c9
The dates are those of the commits that first added the entries' files (2020-08-11 for the entries of the initial commit); renamed entries keep the date of their first name. Changed: none
diff --git a/entries/wordnet/__init__.py b/entries/wordnet/__init__.py
index 3e83419..2fd6ac7 100644
--- a/entries/wordnet/__init__.py
+++ b/entries/wordnet/__init__.py
@@ -33,7 +33,7 @@ tags = ['Informational', 'Language', 'Unweighted', 'Metadata']
url = 'https://wordnet.princeton.edu/'
citation = [('G. A. Miller, "WordNet: A Lexical Database for English." Communications of the ACM 38(11), 39-41 (1995)', 'https://doi.org/10.1145/219717.219748'),
('C. Fellbaum (ed.), "WordNet: An Electronic Lexical Database." MIT Press (1998)', 'https://doi.org/10.7551/mitpress/7287.001.0001')]
-icon_hash = '5806579d8cf714f319c3be8f'
+date_added = '2020-08-11'
upstream_license = ("WordNet 3.0 license", "https://wordnet.princeton.edu/license-and-commercial-use")
upstream_prefix = 'https://wordnetcode.princeton.edu'
files = [(('wn3.1.dict.tar.gz:dict/data.noun', 'wn3.1.dict.tar.gz:dict/data.verb',
[entries] Prefix the properties in the descriptions with (Node), (Edge) or (Graph) bc3dbbd
The lists of properties at the end of the descriptions marked edge properties with "Edge" but left node properties unmarked, or grouped them in "Nodes: `a`, ...; `b`, ..." items, so the kind of a property was often unclear. Every item now starts with (Node), (Edge) or (Graph), followed by the property names, a colon and the explanation, one item per property or group of properties; qualifications (kinds of nodes, networks) follow the names in parentheses. Properties that were only named got a short explanation, and a few items that named the wrong kind of property were corrected.
diff --git a/entries/wordnet/__init__.py b/entries/wordnet/__init__.py
index f21fb15..3e83419 100644
--- a/entries/wordnet/__init__.py
+++ b/entries/wordnet/__init__.py
@@ -25,8 +25,10 @@ This network replaces an earlier version built from the RDF version of WordNet 3
The network has the following properties:
-- Nodes: `name`, the word; `pos`, the list of its parts of speech (`noun`, `verb`, `adjective`, `adverb`); `senses`, the number of synsets that contain it.
-- Edges: `relations`, the list of the relations between the two words (`synonym` for words in the same synset; otherwise the WordNet pointer types, e.g. `hypernym`, `hyponym`, `antonym`, `derivationally related form`, `similar to`, `member meronym`, `domain of synset (topic)`). Since WordNet records most relations in both directions, both a relation and its inverse (e.g. `hypernym` and `hyponym`) usually appear, and the direction of a relation is not recorded."""
+- (Node) `name`: the word.
+- (Node) `pos`: the list of its parts of speech (`noun`, `verb`, `adjective`, `adverb`).
+- (Node) `senses`: the number of synsets that contain it.
+- (Edge) `relations`: the list of the relations between the two words (`synonym` for words in the same synset; otherwise the WordNet pointer types, e.g. `hypernym`, `hyponym`, `antonym`, `derivationally related form`, `similar to`, `member meronym`, `domain of synset (topic)`). Since WordNet records most relations in both directions, both a relation and its inverse (e.g. `hypernym` and `hyponym`) usually appear, and the direction of a relation is not recorded."""
tags = ['Informational', 'Language', 'Unweighted', 'Metadata']
url = 'https://wordnet.princeton.edu/'
citation = [('G. A. Miller, "WordNet: A Lexical Database for English." Communications of the ACM 38(11), 39-41 (1995)', 'https://doi.org/10.1145/219717.219748'),
[entries] Remove unneeded code from the entries 2c69f19
Unneeded "global files" statements, unused imports and variables, f-strings without placeholders, duplicate keys in foodweb_little_rock (keeping the order and the values used), and the second definition of get_lines() in twitter_higgs. Nothing changes in the networks or descriptions. Changed: none
diff --git a/entries/wordnet/__init__.py b/entries/wordnet/__init__.py
index e29e74c..f21fb15 100644
--- a/entries/wordnet/__init__.py
+++ b/entries/wordnet/__init__.py
@@ -65,7 +65,6 @@ POINTERS = {"!": "antonym", "@": "hypernym", "@i": "instance hypernym",
@coerce_props()
@annotate()
def parse(alts=None):
- global files
name = __name__.split(".")[-1]
for fnames, alt, fmt in files:
if alts is not None and alt not in alts:
[entries] Remove the mentions of KONECT from the descriptions of edit_wikibooks, edit_wikinews, edit_wikipedia, edit_wikiquote, edit_wiktionary, linux, prosper, reactome, unicodelang, wiki_categories, wiki_link_dyn, wikipedia_link and wordnet 2216557
These entries were originally taken from KONECT and now download their data from the original sources, so their descriptions no longer refer to KONECT.
diff --git a/entries/wordnet/__init__.py b/entries/wordnet/__init__.py
index 3ed0c1b..e29e74c 100644
--- a/entries/wordnet/__init__.py
+++ b/entries/wordnet/__init__.py
@@ -21,7 +21,7 @@ from .. import *
title = "WordNet relationships (2011)"
description = r"""A network of English words and the lexical and semantic relationships between them, from WordNet 3.1 (released in 2011), the lexical database of English developed at Princeton University. WordNet groups nouns, verbs, adjectives and adverbs into sets of synonyms (synsets), each expressing a distinct concept, which are linked by semantic relations (e.g. hypernymy, meronymy or entailment); some relations (e.g. antonymy or derivation) instead link individual words of two synsets. Each node is a word (a lemma, which can be a multi-word expression such as "New York"; different capitalizations are different words), and an undirected edge connects two words if they are synonyms (members of the same synset), if their synsets are related by a semantic relation, or if they are directly related by a lexical relation. All relations of the database are included. Words that occur only in a synset of their own and without relations are not part of the network.
-This network follows the construction of KONECT, which used the RDF version of WordNet 3.1 that is no longer available; this version is built from the original WordNet 3.1 database files, and has about 2% more nodes and 5% more edges than KONECT's.
+This network replaces an earlier version built from the RDF version of WordNet 3.1, which is no longer available; this version is built in the same way from the original WordNet 3.1 database files, and has about 2% more nodes and 5% more edges than the earlier one.
The network has the following properties:
[entries] Move KONECT-derived entries to their original sources 45943ea
The entries now download the data from where KONECT obtained them (live or via the Wayback Machine), gaining the metadata KONECT dropped (names, identifiers, timestamps, attributes), with descriptions and citations rewritten from the original sources: - Ma'ayan lab collection: faa_routes, foodweb_little_rock (taxon names were assigned to the wrong nodes), interactome_pdz, interactome_figeys, interactome_stelzl, interactome_vidal - Pajek collection and primary sources: word_assoc (from the Edinburgh Associative Thesaurus; KONECT dropped all counts >= 10), foldoc, new_guinea_tribes - bitriad: elite, ceo_club (adds the CEO KONECT's copy lacked) - Lovro Subelj: cora, euroroad (adds isolated cities and parallel roads) - SNAP: elec (all votes, with elections and nominators) - Zenodo: wiki_talk (user ids and roles) - MPI-SWS: flickr_growth, facebook_wall (edges now point from poster to wall owner, as documented), wikipedia_growth (full timestamps) - Other sources: prosper, jester, reactome (the 2014 release KONECT used), unicodelang (CLDR 27), wordnet (WordNet 3.1), chicago_road (TNTP ChicagoRegional)
diff --git a/entries/wordnet/__init__.py b/entries/wordnet/__init__.py
index 00a807f..3ed0c1b 100644
--- a/entries/wordnet/__init__.py
+++ b/entries/wordnet/__init__.py
@@ -18,20 +18,49 @@
from .. import *
-title = "WordNet relationships"
-description = """A network of English words from the WordNet. Node is a word, and edge denotes relationships between words (synonymy, hyperonymy, meronymy, etc.). The date at which this network was extracted from WordNet is not unknown.[^icon]
-[^icon]: Description obtained from the [ICON](https://icon.colorado.edu) project."""
-tags = ['Informational', 'Language', 'Unweighted']
-url = 'http://konect.cc/networks/wordnet-words'
-citation = [('C. Fellbaum. "WordNet." Theory and Applications of Ontology: Computer Applications. Springer, 231-243 (2010)', 'https://doi.org/10.1007/978-90-481-8847-5_10')]
+title = "WordNet relationships (2011)"
+description = r"""A network of English words and the lexical and semantic relationships between them, from WordNet 3.1 (released in 2011), the lexical database of English developed at Princeton University. WordNet groups nouns, verbs, adjectives and adverbs into sets of synonyms (synsets), each expressing a distinct concept, which are linked by semantic relations (e.g. hypernymy, meronymy or entailment); some relations (e.g. antonymy or derivation) instead link individual words of two synsets. Each node is a word (a lemma, which can be a multi-word expression such as "New York"; different capitalizations are different words), and an undirected edge connects two words if they are synonyms (members of the same synset), if their synsets are related by a semantic relation, or if they are directly related by a lexical relation. All relations of the database are included. Words that occur only in a synset of their own and without relations are not part of the network.
+
+This network follows the construction of KONECT, which used the RDF version of WordNet 3.1 that is no longer available; this version is built from the original WordNet 3.1 database files, and has about 2% more nodes and 5% more edges than KONECT's.
+
+The network has the following properties:
+
+- Nodes: `name`, the word; `pos`, the list of its parts of speech (`noun`, `verb`, `adjective`, `adverb`); `senses`, the number of synsets that contain it.
+- Edges: `relations`, the list of the relations between the two words (`synonym` for words in the same synset; otherwise the WordNet pointer types, e.g. `hypernym`, `hyponym`, `antonym`, `derivationally related form`, `similar to`, `member meronym`, `domain of synset (topic)`). Since WordNet records most relations in both directions, both a relation and its inverse (e.g. `hypernym` and `hyponym`) usually appear, and the direction of a relation is not recorded."""
+tags = ['Informational', 'Language', 'Unweighted', 'Metadata']
+url = 'https://wordnet.princeton.edu/'
+citation = [('G. A. Miller, "WordNet: A Lexical Database for English." Communications of the ACM 38(11), 39-41 (1995)', 'https://doi.org/10.1145/219717.219748'),
+ ('C. Fellbaum (ed.), "WordNet: An Electronic Lexical Database." MIT Press (1998)', 'https://doi.org/10.7551/mitpress/7287.001.0001')]
icon_hash = '5806579d8cf714f319c3be8f'
-upstream_prefix = 'http://konect.cc/files'
-files = [('download.tsv.wordnet-words.tar.bz2', None, 'konect')]
+upstream_license = ("WordNet 3.0 license", "https://wordnet.princeton.edu/license-and-commercial-use")
+upstream_prefix = 'https://wordnetcode.princeton.edu'
+files = [(('wn3.1.dict.tar.gz:dict/data.noun', 'wn3.1.dict.tar.gz:dict/data.verb',
+ 'wn3.1.dict.tar.gz:dict/data.adj', 'wn3.1.dict.tar.gz:dict/data.adv'),
+ None, None)]
def fetch_upstream(force=False):
return fetch_upstream_files(__name__.split(".")[-1], upstream_prefix, files,
force)
+POS = {"n": "noun", "v": "verb", "a": "adjective", "r": "adverb"}
+
+# Pointer symbols (wninput(5WN))
+POINTERS = {"!": "antonym", "@": "hypernym", "@i": "instance hypernym",
+ "~": "hyponym", "~i": "instance hyponym",
+ "#m": "member holonym", "#s": "substance holonym",
+ "#p": "part holonym", "%m": "member meronym",
+ "%s": "substance meronym", "%p": "part meronym",
+ "=": "attribute", "+": "derivationally related form",
+ ";c": "domain of synset (topic)",
+ "-c": "member of domain (topic)",
+ ";r": "domain of synset (region)",
+ "-r": "member of domain (region)",
+ ";u": "domain of synset (usage)",
+ "-u": "member of domain (usage)",
+ "*": "entailment", ">": "cause", "^": "also see",
+ "$": "verb group", "&": "similar to", "<": "participle of verb",
+ "\\": "pertainym"}
+
@cache_network()
@coerce_props()
@annotate()
@@ -41,9 +70,70 @@ def parse(alts=None):
for fnames, alt, fmt in files:
if alts is not None and alt not in alts:
continue
- if isinstance(fnames, str):
- fnames = [fnames]
- with ExitStack() as stack:
- fs = [stack.enter_context(open_upstream_file(name, fn, "rb")) for fn in fnames]
- g = parse_graph(fs, fmt, directed=False)
+ synsets = {} # (pos, offset) -> list of words
+ ptrs = []
+ for fname in fnames:
+ with open_upstream_file(name, fname, "r") as f:
+ for line in f:
+ if line.startswith(" "): # licence header
+ continue
+ data = line.split(" | ")[0].split()
+ offset, ss_type, w_cnt = data[0], data[2], int(data[3], 16)
+ pos = "a" if ss_type == "s" else ss_type
+ words = []
+ i = 4
+ for k in range(w_cnt):
+ # remove the syntactic markers of adjectives
+ words.append(re.sub(r"\((a|p|ip)\)$", "", data[i]))
+ i += 2
+ key = (pos, offset)
+ synsets[key] = words
+ p_cnt = int(data[i])
+ i += 1
+ for k in range(p_cnt):
+ sym, toffset, tpos, st = data[i:i + 4]
+ i += 4
+ ptrs.append((key, sym, (tpos, toffset), st))
+
+ g = Graph(directed=False)
+ g.vp.name = g.new_vp("string")
+ g.vp.pos = g.new_vp("vector<string>")
+ g.vp.senses = g.new_vp("int")
+ vs = {}
+ wpos = defaultdict(set)
+ nsenses = defaultdict(int)
+ for (pos, offset), words in synsets.items():
+ for w in words:
+ wpos[w].add(POS[pos])
+ nsenses[w] += 1
+ rels = defaultdict(set)
+ def add(a, b, rel):
+ if a == b:
+ return
+ rels[(a, b) if a < b else (b, a)].add(rel)
+ for words in synsets.values():
+ for a in words:
+ for b in words:
+ add(a, b, "synonym")
+ for key, sym, tkey, st in ptrs:
+ A = synsets[key]
+ B = synsets[tkey]
+ rel = POINTERS[sym]
+ if st == "0000": # semantic: between all words
+ for a in A:
+ for b in B:
+ add(a, b, rel)
+ else: # lexical: between two words
+ add(A[int(st[:2], 16) - 1], B[int(st[2:], 16) - 1], rel)
+ def get(w):
+ if w not in vs:
+ v = vs[w] = g.add_vertex()
+ g.vp.name[v] = w.replace("_", " ")
+ g.vp.pos[v] = [p for p in POS.values() if p in wpos[w]]
+ g.vp.senses[v] = nsenses[w]
+ return vs[w]
+ g.ep.relations = g.new_ep("vector<string>")
+ for (a, b), rs in sorted(rels.items()):
+ e = g.add_edge(get(a), get(b))
+ g.ep.relations[e] = sorted(rs)
yield alt, g
Update copyright information 73a4f0d
diff --git a/entries/wordnet/__init__.py b/entries/wordnet/__init__.py
index 1b62e43..00a807f 100644
--- a/entries/wordnet/__init__.py
+++ b/entries/wordnet/__init__.py
@@ -1,7 +1,7 @@
#! /usr/bin/env python
# -*- coding: utf-8 -*-
#
-# Copyright (C) 2020-2024 Tiago de Paula Peixoto <tiago@skewed.de>
+# Copyright (C) 2020-2026 Tiago de Paula Peixoto <tiago@skewed.de>
#
# This program is free software: you can redistribute it and/or modify it under
# the terms of the GNU Affero General Public License as published by the Free
Update copyright information 3d288ea
diff --git a/entries/wordnet/__init__.py b/entries/wordnet/__init__.py
index 7212b30..1b62e43 100644
--- a/entries/wordnet/__init__.py
+++ b/entries/wordnet/__init__.py
@@ -1,7 +1,7 @@
#! /usr/bin/env python
# -*- coding: utf-8 -*-
#
-# Copyright (C) 2020-2023 Tiago de Paula Peixoto <tiago@skewed.de>
+# Copyright (C) 2020-2024 Tiago de Paula Peixoto <tiago@skewed.de>
#
# This program is free software: you can redistribute it and/or modify it under
# the terms of the GNU Affero General Public License as published by the Free
Update copyright information 8d005ae
diff --git a/entries/wordnet/__init__.py b/entries/wordnet/__init__.py
index a3cf160..7212b30 100644
--- a/entries/wordnet/__init__.py
+++ b/entries/wordnet/__init__.py
@@ -1,7 +1,7 @@
#! /usr/bin/env python
# -*- coding: utf-8 -*-
#
-# Copyright (C) 2021 Tiago de Paula Peixoto <tiago@skewed.de>
+# Copyright (C) 2020-2023 Tiago de Paula Peixoto <tiago@skewed.de>
#
# This program is free software: you can redistribute it and/or modify it under
# the terms of the GNU Affero General Public License as published by the Free
Update copyright info db2efcc
diff --git a/entries/wordnet/__init__.py b/entries/wordnet/__init__.py
index 3dba816..a3cf160 100644
--- a/entries/wordnet/__init__.py
+++ b/entries/wordnet/__init__.py
@@ -1,7 +1,7 @@
#! /usr/bin/env python
# -*- coding: utf-8 -*-
#
-# Copyright (C) 2020 Tiago de Paula Peixoto <tiago@skewed.de>
+# Copyright (C) 2021 Tiago de Paula Peixoto <tiago@skewed.de>
#
# This program is free software: you can redistribute it and/or modify it under
# the terms of the GNU Affero General Public License as published by the Free
Un-orphan KONECT datasets 894eba5
KONECT has been brought back from the dead for the time being.
diff --git a/entries/wordnet/__init__.py b/entries/wordnet/__init__.py
index 15cb988..3dba816 100644
--- a/entries/wordnet/__init__.py
+++ b/entries/wordnet/__init__.py
@@ -26,7 +26,6 @@ url = 'http://konect.cc/networks/wordnet-words'
citation = [('C. Fellbaum. "WordNet." Theory and Applications of Ontology: Computer Applications. Springer, 231-243 (2010)', 'https://doi.org/10.1007/978-90-481-8847-5_10')]
icon_hash = '5806579d8cf714f319c3be8f'
upstream_prefix = 'http://konect.cc/files'
-orphan = True
files = [('download.tsv.wordnet-words.tar.bz2', None, 'konect')]
def fetch_upstream(force=False):
Update citations to use DOIs e878874
diff --git a/entries/wordnet/__init__.py b/entries/wordnet/__init__.py
index fd33ab6..15cb988 100644
--- a/entries/wordnet/__init__.py
+++ b/entries/wordnet/__init__.py
@@ -23,7 +23,7 @@ description = """A network of English words from the WordNet. Node is a word, an
[^icon]: Description obtained from the [ICON](https://icon.colorado.edu) project."""
tags = ['Informational', 'Language', 'Unweighted']
url = 'http://konect.cc/networks/wordnet-words'
-citation = [('C. Fellbaum. "WordNet." Theory and Applications of Ontology: Computer Applications. Springer, 231-243 (2010)', 'http://link.springer.com/chapter/10.1007/978-90-481-8847-5_10')]
+citation = [('C. Fellbaum. "WordNet." Theory and Applications of Ontology: Computer Applications. Springer, 231-243 (2010)', 'https://doi.org/10.1007/978-90-481-8847-5_10')]
icon_hash = '5806579d8cf714f319c3be8f'
upstream_prefix = 'http://konect.cc/files'
orphan = True
Add support for 'orphan' datasets and tag konect entries e330b80
diff --git a/entries/wordnet/__init__.py b/entries/wordnet/__init__.py
index 7665e4d..fd33ab6 100644
--- a/entries/wordnet/__init__.py
+++ b/entries/wordnet/__init__.py
@@ -26,6 +26,7 @@ url = 'http://konect.cc/networks/wordnet-words'
citation = [('C. Fellbaum. "WordNet." Theory and Applications of Ontology: Computer Applications. Springer, 231-243 (2010)', 'http://link.springer.com/chapter/10.1007/978-90-481-8847-5_10')]
icon_hash = '5806579d8cf714f319c3be8f'
upstream_prefix = 'http://konect.cc/files'
+orphan = True
files = [('download.tsv.wordnet-words.tar.bz2', None, 'konect')]
def fetch_upstream(force=False):
Change license from GPLv3 to AGPLv3 d754be5
diff --git a/entries/wordnet/__init__.py b/entries/wordnet/__init__.py
index a2cc954..7665e4d 100644
--- a/entries/wordnet/__init__.py
+++ b/entries/wordnet/__init__.py
@@ -3,18 +3,18 @@
#
# Copyright (C) 2020 Tiago de Paula Peixoto <tiago@skewed.de>
#
-# This program is free software: you can redistribute it and/or modify
-# it under the terms of the GNU General Public License as published by
-# the Free Software Foundation, either version 3 of the License, or
-# (at your option) any later version.
+# This program is free software: you can redistribute it and/or modify it under
+# the terms of the GNU Affero General Public License as published by the Free
+# Software Foundation, either version 3 of the License, or (at your option) any
+# later version.
#
-# This program is distributed in the hope that it will be useful,
-# but WITHOUT ANY WARRANTY; without even the implied warranty of
-# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-# GNU General Public License for more details.
+# This program is distributed in the hope that it will be useful, but WITHOUT
+# ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
+# FOR A PARTICULAR PURPOSE. See the GNU Affero General Public License for more
+# details.
#
-# You should have received a copy of the GNU General Public License
-# along with this program. If not, see <http://www.gnu.org/licenses/>.
+# You should have received a copy of the GNU Affero General Public License along
+# with this program. If not, see <http://www.gnu.org/licenses/>.
from .. import *
Add explicit attribution to descriptions obtained from ICON 1645314
diff --git a/entries/wordnet/__init__.py b/entries/wordnet/__init__.py
index 0703725..a2cc954 100644
--- a/entries/wordnet/__init__.py
+++ b/entries/wordnet/__init__.py
@@ -19,7 +19,8 @@
from .. import *
title = "WordNet relationships"
-description = "A network of English words from the WordNet. Node is a word, and edge denotes relationships between words (synonymy, hyperonymy, meronymy, etc.). The date at which this network was extracted from WordNet is not unknown."
+description = """A network of English words from the WordNet. Node is a word, and edge denotes relationships between words (synonymy, hyperonymy, meronymy, etc.). The date at which this network was extracted from WordNet is not unknown.[^icon]
+[^icon]: Description obtained from the [ICON](https://icon.colorado.edu) project."""
tags = ['Informational', 'Language', 'Unweighted']
url = 'http://konect.cc/networks/wordnet-words'
citation = [('C. Fellbaum. "WordNet." Theory and Applications of Ontology: Computer Applications. Springer, 231-243 (2010)', 'http://link.springer.com/chapter/10.1007/978-90-481-8847-5_10')]
Initial commit cc85872
diff --git a/entries/wordnet/__init__.py b/entries/wordnet/__init__.py
new file mode 100644
index 0000000..0703725
--- /dev/null
+++ b/entries/wordnet/__init__.py
@@ -0,0 +1,48 @@
+#! /usr/bin/env python
+# -*- coding: utf-8 -*-
+#
+# Copyright (C) 2020 Tiago de Paula Peixoto <tiago@skewed.de>
+#
+# This program is free software: you can redistribute it and/or modify
+# it under the terms of the GNU General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+#
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+# GNU General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program. If not, see <http://www.gnu.org/licenses/>.
+
+from .. import *
+
+title = "WordNet relationships"
+description = "A network of English words from the WordNet. Node is a word, and edge denotes relationships between words (synonymy, hyperonymy, meronymy, etc.). The date at which this network was extracted from WordNet is not unknown."
+tags = ['Informational', 'Language', 'Unweighted']
+url = 'http://konect.cc/networks/wordnet-words'
+citation = [('C. Fellbaum. "WordNet." Theory and Applications of Ontology: Computer Applications. Springer, 231-243 (2010)', 'http://link.springer.com/chapter/10.1007/978-90-481-8847-5_10')]
+icon_hash = '5806579d8cf714f319c3be8f'
+upstream_prefix = 'http://konect.cc/files'
+files = [('download.tsv.wordnet-words.tar.bz2', None, 'konect')]
+
+def fetch_upstream(force=False):
+ return fetch_upstream_files(__name__.split(".")[-1], upstream_prefix, files,
+ force)
+
+@cache_network()
+@coerce_props()
+@annotate()
+def parse(alts=None):
+ global files
+ name = __name__.split(".")[-1]
+ for fnames, alt, fmt in files:
+ if alts is not None and alt not in alts:
+ continue
+ if isinstance(fnames, str):
+ fnames = [fnames]
+ with ExitStack() as stack:
+ fs = [stack.enter_context(open_upstream_file(name, fn, "rb")) for fn in fnames]
+ g = parse_graph(fs, fmt, directed=False)
+ yield alt, g