There are twelve programming exercises. The length of the report is  about half

Need help with assignments?

Our qualified writers can create original, plagiarism-free papers in any format you choose (APA, MLA, Harvard, Chicago, etc.)

Order from us for quality, customized work in due time of your choice.

Click Here To Order Now

There are twelve programming exercises. The length of the report is  about half a page for each exercise. The final frile must be written in Prolog programming language and combined with WordNet. i already have code on how to connect to wordnet.
Note: `Word-tuple` is a 3-tuple of the form `(word,POS,sense_number)`.
Note: `Synset` is the list of word-tuples of a synset.
Define a predicate offset_to_synset(+Offset,?Synset) that succeeds
if Synset is the list of all the word-tuples of Offset. (Tip: use
findall/3.)
Define a predicate
wordTuple_to_offset(?WordTuple,?Offset) that succeeds if WordTuple
belongs to the synset with offset Offset.
Define a predicate
wordTuple_to_synset(+WordTuple,?Synset) that succeeds if WordTuple
belongs to Synset. Look up a few words using your new predicate.
Define a predicate wordTuple_to_gloss(+WordTuple,-Gloss) that succeeds
is Gloss is the gloss that corresponds to WordTuple. Look up a few words
using your new predicate.
Define a predicate
synonymous(?WordTuple1,?WordTuple2) that succeeds if WordTuple1 and
WordTuple2 are distinct and synonymous word-tuples.
Define a predicate polysemous(?Word) that succeeds if Word is a polysemous word.
Compute the number of polysemous words in WordNet. (Tip: use a combination of findall/3, list_to_set/2 and length/2.)
Define a predicate meronym(?Offset1,?Offset2) that succeeds if
Offset2 is a meronym of Offset1 (note that the predicates for the three
different kinds of meronyms are spread out over three files).
Define a predicate hyponym(?Offset1,?Offset2) that succeeds if Offset1 is a direct hyponym of Offset2.
Define a predicate coordinate(?Offset1,?Offset2) that succeeds if Offset1 and Offset2 have the same hypernym.
Hypernymy is a transitive relation. Define a predicate trans_hypernym(?Offset1,?Offset2) which computes this relation.
Define a predicate trans_hypernym_path(?Offset1,?Offset2,?Path)
that succeeds if Path is is a list of offsets leading from Offset1 to
Offset2.

Need help with assignments?

Our qualified writers can create original, plagiarism-free papers in any format you choose (APA, MLA, Harvard, Chicago, etc.)

Order from us for quality, customized work in due time of your choice.

Click Here To Order Now