com.aliasi.coref.matchers.HonorificConflictKiller Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of aliasi-lingpipe Show documentation

This is the original Lingpipe: http://alias-i.com/lingpipe/web/download.html There were not made any changes to the source code.

There is a newer version: 4.1.2-JL1.0

Show newest version

/*
 * LingPipe v. 4.1.0
 * Copyright (C) 2003-2011 Alias-i
 *
 * This program is licensed under the Alias-i Royalty Free License
 * Version 1 WITHOUT ANY WARRANTY, without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the Alias-i
 * Royalty Free License Version 1 for more details.
 * 
 * You should have received a copy of the Alias-i Royalty Free License
 * Version 1 along with this program; if not, visit
 * http://alias-i.com/lingpipe/licenses/lingpipe-license-1.txt or contact
 * Alias-i, Inc. at 181 North 11th Street, Suite 401, Brooklyn, NY 11211,
 * +1 (718) 290-9170.
 */

package com.aliasi.coref.matchers;

import com.aliasi.coref.EnglishMentionFactory;
import com.aliasi.coref.Killer;
import com.aliasi.coref.Mention;
import com.aliasi.coref.MentionChain;


import java.util.Collections;
import java.util.Set;

/**
 * Implements a killing function that defeats a match of a mention
 * against a mention chain with an incompatible honorific.
 *
 * @author  Bob Carpenter
 * @version 3.8
 * @since   LingPipe1.0
 */
public class HonorificConflictKiller implements Killer {

    /**
     * Construct a new honorific killer.
     */
    public HonorificConflictKiller() { 
        /* do nothing */
    }

    /**
     * Returns true if the specified mention
     * and mention chain have incompatible honorifics.  Honorifics
     * are determined to be honorific according to the
     */
    public boolean kill(Mention mention, MentionChain chain) {
        Set honorifics1 = mention.honorifics();
        Set honorifics2 = chain.honorifics();
        return honorifics1.size() > 0
            && honorifics2.size() > 0
            && honorificConflict(honorifics1,honorifics2);
    }

    private static boolean honorificConflict(Set honorifics1,
                                             Set honorifics2) {
        return male(honorifics1) && female(honorifics2)
            || female(honorifics1) && male(honorifics2);
    }

    private static boolean male(Set honorifics) {
        return
            !Collections.disjoint(honorifics,
                                  EnglishMentionFactory.MALE_HONORIFICS);
    }

    private static boolean female(Set honorifics) {
        return
            !Collections.disjoint(honorifics,
                                  EnglishMentionFactory.FEMALE_HONORIFICS);
    }

}