Home
Search results “Polysemy and synonymy in text mining tokenizing”
Lecture 15 — Semantic Similarity- Synonymy and other Semantic Relations - NLP
 
14:17
. Copyright Disclaimer Under Section 107 of the Copyright Act 1976, allowance is made for "FAIR USE" for purposes such as criticism, comment, news reporting, teaching, scholarship, and research. Fair use is a use permitted by copyright statute that might otherwise be infringing. Non-profit, educational or personal use tips the balance in favor of fair use. .
PRF 4: WordNet synonyms
 
07:03
We discuss the ways in which we can extract synonyms from WordNet, and the issues we must be deal with in the process.
Views: 2348 Victor Lavrenko
GraphSearch & Text Corpus Analysis - PoolParty 5.2
 
18:44
See how PoolParty's taxonomy management methodology (https://www.poolparty.biz) is now supported even more efficiently by PoolParty's latest release. We demonstrate how PoolParty 5.2 makes use of deep text mining including corpus analysis and co-occurrence analysis. We show an example based on UNESCO world heritage sites and demonstrate how automatic classification can be extended step-by-step. An immediate feedback is given by PoolParty's faceted GraphSearch. Initial taxonomies can be built by using PoolParty's linked data harvester to fetch data from DBpedia.
Mod-01 Lec-29 Wordnet and Word Sense Disambiguation
 
46:40
Natural Language Processing by Prof. Pushpak Bhattacharyya, Department of Computer science & Engineering,IIT Bombay.For more details on NPTEL visit http://nptel.iitm.ac.in
Views: 7080 nptelhrd
Graph-based word sense disambiguation
 
01:00
An animation of the word sense disambiguation algorithm described in Navigli & Lapata (2010). The algorithm is trying to disambiguate the senses of the words in the sentence "Drink the milk." The algorithm starts off by creating two graphs: one large graph (not shown) of the entirety of WordNet, where each vertex is a synset and each edge is a semantic relation between synsets; and a "disambiguation" subgraph (depicted here) containing only the vertices for the synsets of "drink" and "milk". Then it does a depth-first search starting from each of these synsets in the original WordNet graph, looking for any of the other synsets. Once it finds them, it adds the path and the intermediate vertices to the disambiguation graph. Once the search is over, the degree of each vertex is calculated. The synsets for "drink" and "milk" with the highest degree are selected as the correct ones.
Views: 1095 Tristan Miller