Colexification graphs extracted from Wiktionary.
A colexification graph is an undirected graph.
- Nodes represent concepts/sense-annotated words.
- The weight of an edge between two nodes is the number of languages where the same word is used for both concepts.
The graphs are available in TSV and JSON formats.
TSV columns:
- node 1 ID
- node 1 word
- node 1 sense
- node 2 ID
- node 2 word
- node 2 sense
- weight of edge between node 1 and node 2
The JSON file is compatible with Cytoscape.js.
Copyright 2023 Levi Gruspe
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 https://www.gnu.org/licenses/.
Copyright 2023 Levi Gruspe
The published colexification graphs are made available under the Creative Commons Attribution-ShareAlike License. This work is derived from Wiktionary. The copyright of the original work belongs to Wiktionary's editors and contributors.