Abstract
The paper presents an algorithm of the automated wordnet expansion which can utilise results produced by both pattern-based and Distributional Similarity methods. It is based on the assumption that all relation extraction methods express some error, so we cannot identify the exact place (synset) for a new lemma on their bases, but an area (a wordnet subgraph). Support for a particular attachment point generated by knowledge should be expanded on the surrounding synsets. Moreover, the wordnet structure is modelled on the level of links between lexical units. Evaluation of the algorithm and comparison with top algorithm from literature in large scale experiments on Princeton WordNet is presented.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
