This is a new version of the repository. Do let us know (lindat-help at ufal.mff.cuni.cz) if you encounter any issues.
 
Please use the following text to cite this item or export to a predefined format:
Bond, Francis; Maziarz, Marek and Rudnicka, Ewa, 2020, Polysemy networks for English homonyms mapped onto Princeton WordNet: Constructed on the basis of sense chaining algorithms, LINDAT/CLARIAH-CZ digital library at the Institute of Formal and Applied Linguistics (ÚFAL), http://hdl.handle.net/11234/1-3796.
dc.contributor.authorBond, Francis
dc.contributor.authorMaziarz, Marek
dc.contributor.authorRudnicka, Ewa
dc.date.accessioned2021-11-07T08:19:13Z
dc.date.available2021-11-07T08:19:13Z
dc.date.issued2020-07-28
dc.descriptionThis 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.identifier.urihttp://hdl.handle.net/11234/1-3796
dc.language.isoeng
dc.publisherWrocław University of Science and Technology, Department of Computational Intelligence
dc.publisherLinguistics and Multilingual Studies, Computational Linguistics Lab
dc.relation.isreferencedbyhttps://aclanthology.org/2021.gwc-1.7/
dc.rightsCreative Commons - Attribution 4.0 International (CC BY 4.0)
dc.rights.labelPUB
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/
dc.source.urihttps://www.researchgate.net/project/Mechanisms-of-Polysemy
dc.subjectpolysemy network
dc.subjectpolysemy theory
dc.subjectpolysemy
dc.subjectprototype
dc.subjectexemplar theory
dc.subjectradial polysemy
dc.subjectWordNet
dc.titlePolysemy networks for English homonyms mapped onto Princeton WordNet: Constructed on the basis of sense chaining algorithms
dc.typelexicalConceptualResource
local.brandingLRT + Open Submissions
local.contact.personMarek Maziarz marek.maziarz@pwr.edu.pl Marek Maziarz
local.demo.urihttps://github.com/MarekMaziarz/PolysemyTheories
local.files.count2
local.files.size7810911
local.has.filesyes
local.language.nameEnglish
local.size.info7810911 kb
local.sponsornationalFunds 2018/29/B/HS2/02919 National Science Centre of Poland Mechanizmy polisemii w ujęciu porównawczym na podstawie analizy sieci leksykalnych
local.sponsornationalFunds Project CLARIN-PL the Polish Ministry of Education and Science Project CLARIN-PL
local.sponsorOther NTU Digital Humanities Research Cluster Nanyang Technological University, Singapore NTU Digital Humanities Research Cluster
metashare.ResourceInfo#ContentInfo.detailedTypecomputationalLexicon
metashare.ResourceInfo#ContentInfo.mediaTypetext
This item isPublicly Available
and licensed under:
 Files in this item
Name
PolysemyTheories-master.zip
Size
7.45 MB
Format
application/zip
Description
Zip
MD5
71358b6ad6028697aa9bbf2999afa45f
Preview
  File Preview
  • 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/plain
Description
Text
MD5
ceaa214f8c8df3ea6840d59a7b465fb4
Preview
  File Preview
    # 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 - synset identifier in WordNet 3.0 for the first sense\
        syn2 - synset identifier in WordNet 3.0 for the second sense
    
    
    2) Mapping files
    
        Symbols:\
        PWNsynset - mapped WordNet sense\
        choiceE - the choice of the E annotator\
        choiceM - the choice of the M annotator (they are the same after the third phase of annotation process)\
        LEXsense - a target sense from Lexico\
        MWsense - a target sense from Merriam-Webster\
        EG - an etymology group\
        sup - a superordinate sense number\
        subno - a subordinate sense number
    
    3) No POS split files
    
        File names:\
        EX - the exemplar algorithm\
        LO - the locally chaining algorithm\
        NN - the nearest-neighbor chaining algorithm\
        PP - the prototype algorithm\
        PR - the progenitor algorithm\
        RA - the random algorithm\
        "comparison" - these files contain a comparison between dictionaries and joint polysemy nets for 25 sample words\
        "joint-polysemy-nets" - these files comprise sense edges from . . .