Returns the antonym of a word
Input is a synset returns a list of synsets
Input is a synset returns a list of synsets
:Synset
: List[Synset]
Returns list of all hypernyms of a synset
Returns list of all hypernyms of a synset
:Synset
: List[Synset]
Returns an instance of the WordNet dictionary used in the package
Returns an instance of the WordNet dictionary used in the package
Returns a Synset given a String Returns empty list if the lemma did not exist in the WordNet
Returns a Synset given a String Returns empty list if the lemma did not exist in the WordNet
: String
: POS
: Integer
: List[Synset]
Returns a Synset given a String, pos and synset id Returns empty list if the lemma did not exist in the WordNet
Returns a Synset given a String, pos and synset id Returns empty list if the lemma did not exist in the WordNet
: String
: POS
List[Synset]
Returns a Synset belonging to a lemma String
Returns a Synset belonging to a lemma String
: String
: List[Synset]
Input is a synset returns a list of synsets
Input is a synset returns a list of synsets
Gets lemma name for a synset
Get lowestCommonHypernym of two Synsets
Get lowestCommonHypernym of two Synsets
: Synset
: Synset
: List[Synset]
Returns the length of the longest hypernym path from this synset to the root Since there can be several paths to root, the minimum length is considered
Returns the length of the longest hypernym path from this synset to the root Since there can be several paths to root, the minimum length is considered
: Synset
: Integer
Input is a synset returns a list of synsets
Input is a synset returns a list of synsets
:Synset
: List[Synset]
Returns the length of the shortest hypernym path from this synset to the root Since there can be several paths to root, the minimum length is considered
Returns the length of the shortest hypernym path from this synset to the root Since there can be several paths to root, the minimum length is considered
: Synset
: Integer
Input is a synset returns a list of synsets
Input is a synset returns a list of synsets
:Synset
: List[Synset]
Input is a synset returns a list of synsets
Input is a synset returns a list of synsets
:Synset
: List[Synset]
Returns related lemmas of a word given the word and the type of relation
Returns related lemmas of a word given the word and the type of relation
: Word
: PointerType
: List[Word]
Gets related synsets per function given a pointer type from pointer class
Gets related synsets per function given a pointer type from pointer class
:Synset
: PointerType
: List[Synset]
Returns the list of root hypernyms of a Synset
Returns the list of root hypernyms of a Synset
: Synset
: List[Synset]
Get shortestPath Length to a Hypernim
Get shortestPath Length to a Hypernim
: Synset
: Synset
: Integer
Returns the distance similarity of two synsets using the shortest path linking the two synsets (if one exists)
Returns the distance similarity of two synsets using the shortest path linking the two synsets (if one exists)
: Synset
: Synset
: Double
Input is a synset returns a list of synsets
Input is a synset returns a list of synsets
:Synset
: List[Synset]
Input is a synset returns a list of synsets
Input is a synset returns a list of synsets
:Synset
: List[Synset]
Wu & Palmer (1994) method of measuring semantic relatedness based on node counting.
Wu & Palmer (1994) method of measuring semantic relatedness based on node counting. given two synsets, synset1 and synset2 returns the similarity score
:Synset
:Synset
score :Double