SD Source Model - Lexicon Suffix Derivations with Negations

I. Introduction

The negation rule can be applied in the derivation morphology to retrieve antonyms [2006 Paradis]. Suffix derivations with negation tags, e.g. “-less”, in the Lexicon are used as root to retrieve aPais candidates, such as [careful|careless|adj], [bottomed|bottmless|adj], [costly|costless|adj] and [fatty|fatless|adj].

II. Design

Two suffixD rules are used to generate aPair candidates.

• $|noun|less$|adj
• $|verb|less$|adj

Please see design documents for more details.

III. Implementation

Java source codes are implemented in the directory of Derivation:

• GetAntCandFromSuffixD.java

Input derivations:

Use the suffixD in the Lexicon as source. The suffix derivations have 9 fields:

Algorithm:

• if Type = suffixD (S)
• if Negation = negative (N)
• if derivation-1 and derivation-2 meet criteria of legal antonyms
• if same POS

• get derivations of Derivation-1
• can't be the same as Derivation-2
• convert to citation form and output to aPair candidate format

Output APairs: