WordNet

Instance Constructors

new WordNet()

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def antonyms(word: Word): List[Word]

Returns the antonym of a word
Returns the antonym of a word
word
: Word
returns
: List[Word]
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def entailments(synset: Synset): List[Synset]

Input is a synset returns a list of synsets
Input is a synset returns a list of synsets
synset
:Synset
returns
: List[Synset]
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def getAllHypernyms(synset: Synset): List[List[Synset]]

Returns list of all hypernyms of a synset
Returns list of all hypernyms of a synset
synset
:Synset
returns
: List[Synset]
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def getDict: Dictionary

Returns an instance of the WordNet dictionary used in the package
def getSynset(lemma: String, pos: POS, sid: Int): List[Synset]

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
lemma
: String
pos
: POS
sid
: Integer
returns
: List[Synset]
def getSynsets(lemma: String, pos: POS): 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
lemma
: String
pos
: POS
returns
List[Synset]
def getSynsets(lemma: String): List[Synset]

Returns a Synset belonging to a lemma String
Returns a Synset belonging to a lemma String
lemma
: String
returns
: List[Synset]
def hashCode(): Int

Definition Classes
AnyRef → Any
def hypernyms(synset: Synset): List[Synset]

Input is a synset returns a list of synsets
Input is a synset returns a list of synsets
synset
:Synset
def hyponyms(synset: Synset): List[Synset]

Input is a synset returns a list of synsets
Input is a synset returns a list of synsets
synset
:Synset
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def lemmaNames(synset: Synset): List[String]

Gets lemma name for a synset
Gets lemma name for a synset
synset
:Synset
returns
: List[String]
def lowestCommonHypernym(synset1: Synset, synset2: Synset): List[Synset]

Get lowestCommonHypernym of two Synsets
Get lowestCommonHypernym of two Synsets
synset1
: Synset
synset2
: Synset
returns
: List[Synset]
def maxDepth(synset: Synset): Int

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
: Synset
returns
: Integer
var maxDepth: Int
def memberHolonyms(synset: Synset): List[Synset]

Input is a synset returns a list of synsets
Input is a synset returns a list of synsets
synset
:Synset
returns
: List[Synset]
def minDepth(synset: Synset): Int

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
: Synset
returns
: Integer
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def partHolonyms(synset: Synset): List[Synset]

Input is a synset returns a list of synsets
Input is a synset returns a list of synsets
synset
:Synset
returns
: List[Synset]
def partMeronyms(synset: Synset): List[Synset]

Input is a synset returns a list of synsets
Input is a synset returns a list of synsets
synset
:Synset
returns
: List[Synset]
def relatedLemmas(word: Word, ptr: PointerType): List[Word]

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
: Word
ptr
: PointerType
returns
: List[Word]
def relatedSynsets(synset: Synset, ptr: PointerType): List[Synset]

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
:Synset
ptr
: PointerType
returns
: List[Synset]
def rootHypernyms(synset: Synset): List[Synset]

Returns the list of root hypernyms of a Synset
Returns the list of root hypernyms of a Synset
synset
: Synset
returns
: List[Synset]
def shortestHypernymPathLength(synset1: Synset, hypernym: Synset): Int

Get shortestPath Length to a Hypernim
Get shortestPath Length to a Hypernim
synset1
: Synset
hypernym
: Synset
returns
: Integer
def substanceHolonyms(synset: Synset): List[Synset]

Input is a synset returns a list of synsets
Input is a synset returns a list of synsets
synset
:Synset
returns
: List[Synset]
def substanceMeronyms(synset: Synset): List[Synset]

Input is a synset returns a list of synsets
Input is a synset returns a list of synsets
synset
:Synset
returns
: List[Synset]
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Docs: object WordNet | package wordnet

class WordNet extends Serializable

Instance Constructors

new WordNet()

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def antonyms(word: Word): List[Word]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def entailments(synset: Synset): List[Synset]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def getAllHypernyms(synset: Synset): List[List[Synset]]

final def getClass(): Class[_]

def getDict: Dictionary

def getSynset(lemma: String, pos: POS, sid: Int): List[Synset]

def getSynsets(lemma: String, pos: POS): List[Synset]

def getSynsets(lemma: String): List[Synset]

def hashCode(): Int

def hypernyms(synset: Synset): List[Synset]

def hyponyms(synset: Synset): List[Synset]

final def isInstanceOf[T0]: Boolean

def lemmaNames(synset: Synset): List[String]

def lowestCommonHypernym(synset1: Synset, synset2: Synset): List[Synset]

def maxDepth(synset: Synset): Int

var maxDepth: Int

def memberHolonyms(synset: Synset): List[Synset]

def minDepth(synset: Synset): Int

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def partHolonyms(synset: Synset): List[Synset]

def partMeronyms(synset: Synset): List[Synset]

def relatedLemmas(word: Word, ptr: PointerType): List[Word]

def relatedSynsets(synset: Synset, ptr: PointerType): List[Synset]

def rootHypernyms(synset: Synset): List[Synset]

def shortestHypernymPathLength(synset1: Synset, hypernym: Synset): Int

def substanceHolonyms(synset: Synset): List[Synset]

def substanceMeronyms(synset: Synset): List[Synset]

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped