| dc.contributor.author | Bond, Francis |
| dc.contributor.author | Maziarz, Marek |
| dc.contributor.author | Rudnicka, Ewa |
| dc.date.accessioned | 2021-11-07T08:19:13Z |
| dc.date.available | 2021-11-07T08:19:13Z |
| dc.date.issued | 2020-07-28 |
| dc.identifier.uri | http://hdl.handle.net/11234/1-3796 |
| dc.description | This package contains polysemy graphs constructed on the basis of different sense chaining algorithms (representing different polysemy theories: prototype, exemplar and radial). The detailed description of all files is contained in the README.md file. |
| dc.language.iso | eng |
| dc.publisher | Wrocław University of Science and Technology, Department of Computational Intelligence |
| dc.publisher | Linguistics and Multilingual Studies, Computational Linguistics Lab |
| dc.relation.isreferencedby | https://aclanthology.org/2021.gwc-1.7/ |
| dc.rights | Creative Commons - Attribution 4.0 International (CC BY 4.0) |
| dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ |
| dc.source.uri | https://www.researchgate.net/project/Mechanisms-of-Polysemy |
| dc.subject | polysemy network |
| dc.subject | polysemy theory |
| dc.subject | polysemy |
| dc.subject | prototype |
| dc.subject | exemplar theory |
| dc.subject | radial polysemy |
| dc.subject | WordNet |
| dc.title | Polysemy networks for English homonyms mapped onto Princeton WordNet: Constructed on the basis of sense chaining algorithms |
| dc.type | lexicalConceptualResource |
| metashare.ResourceInfo#ContentInfo.mediaType | text |
| metashare.ResourceInfo#ContentInfo.detailedType | computationalLexicon |
| dc.rights.label | PUB |
| has.files | yes |
| branding | LRT + Open Submissions |
| demo.uri | https://github.com/MarekMaziarz/PolysemyTheories |
| contact.person | Marek Maziarz marek.maziarz@pwr.edu.pl Marek Maziarz |
| sponsor | National Science Centre of Poland 2018/29/B/HS2/02919 Mechanizmy polisemii w ujęciu porównawczym na podstawie analizy sieci leksykalnych nationalFunds |
| sponsor | the Polish Ministry of Education and Science Project CLARIN-PL Project CLARIN-PL nationalFunds |
| sponsor | Nanyang Technological University, Singapore NTU Digital Humanities Research Cluster NTU Digital Humanities Research Cluster Other |
| size.info | 7810911 kb |
| files.size | 7813847 |
| files.count | 2 |
Files in this item
Download all files in item (7.45 MB)This item is
Creative Commons - Attribution 4.0 International (CC BY 4.0)
Publicly Available
and licensed under:Creative Commons - Attribution 4.0 International (CC BY 4.0)
- Name
- PolysemyTheories-master.zip
- Size
- 7.45 MB
- Format
- application/zip
- Description
- PolysemyTheories
- MD5
- 71358b6ad6028697aa9bbf2999afa45f
- PolysemyTheories-master
- LEX-MW-merged-graph-distances.txt101 kB
- README.md2 kB
- mapping.zip24 kB
- POSsplit.zip3 MB
- noPOSsplit.zip3 MB
- Name
- README.txt
- Size
- 2.87 KB
- Format
- Text file
- Description
- README
- MD5
- ceaa214f8c8df3ea6840d59a7b465fb4
# PolysemyTheories
All resources are published under the CC-BY 4.0 licence (https://creativecommons.org/licenses/by/4.0/).\
Copyright (c) 2020, Francis Bond, Marek Maziarz and Ewa Rudnicka. All rights reserved.
Description of resources:
1) LEX-MW-merged-graph-distances.txt\
Description: The presented data were obtained through merging information on 25 sample words from two online English dictionaries (Lexico, www.lexico.com, and Merriam-Webster, www.merriam-webster.com). Macro- and microstructures from the dictionaries were manually transformed into graphs, then distances between pairs of WordNet senses in each graph were calculated. We present only the distance information.
Symbols:\
lemma - is a sampled word\
sense1 - first sense from a given pair\
sense2 - second sense from a given pair\
distLEX - Dijkstra's distance calculated on Lexico graph\
distMW - Dijkstra's distance calculated on Merriam-Webster graph\
distOpti - averaged distance\
syn1 - s . . .