当前位置: 首页>>代码示例>>Java>>正文


Java Dictionary.getSynsetIterator方法代码示例

本文整理汇总了Java中net.sf.extjwnl.dictionary.Dictionary.getSynsetIterator方法的典型用法代码示例。如果您正苦于以下问题:Java Dictionary.getSynsetIterator方法的具体用法?Java Dictionary.getSynsetIterator怎么用?Java Dictionary.getSynsetIterator使用的例子?那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在net.sf.extjwnl.dictionary.Dictionary的用法示例。


在下文中一共展示了Dictionary.getSynsetIterator方法的7个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Java代码示例。

示例1: findAdjectiveAntonyms

import net.sf.extjwnl.dictionary.Dictionary; //导入方法依赖的package包/类
private static Set<Long> findAdjectiveAntonyms(Dictionary dic) throws SMatchException {
    log.info("Creating adjective antonyms array...");
    try {
        Set<Long> keys = new HashSet<>();
        int count = 0;
        Iterator<Synset> it = dic.getSynsetIterator(POS.ADJECTIVE);
        while (it.hasNext()) {
            count++;
            if (0 == count % 1000) {
                log.debug("adjective antonyms: " + count);
            }
            Synset current = it.next();
            traverseTree(keys, PointerUtils.getExtendedAntonyms(current), current.getOffset());
            traverseListSym(keys, PointerUtils.getAntonyms(current), current.getOffset());
        }
        log.info("Adjective antonyms: " + keys.size());
        return keys;
    } catch (JWNLException e) {
        throw new SMatchException(e.getClass().getSimpleName() + ": " + e.getMessage(), e);
    }
}
 
开发者ID:s-match,项目名称:s-match-wordnet,代码行数:22,代码来源:InMemoryWordNetBinaryArray.java

示例2: findNounAntonyms

import net.sf.extjwnl.dictionary.Dictionary; //导入方法依赖的package包/类
private static Set<Long> findNounAntonyms(Dictionary dic) throws SMatchException {
    log.info("Creating noun antonyms array...");
    try {
        Set<Long> keys = new HashSet<>();
        int count = 0;
        Iterator<Synset> it = dic.getSynsetIterator(POS.NOUN);
        while (it.hasNext()) {
            count++;
            if (0 == count % 10000) {
                log.debug("noun antonyms: " + count);
            }
            Synset source = it.next();

            cartPr(keys, source.getPointers(PointerType.PART_MERONYM));
            cartPr(keys, source.getPointers(PointerType.SUBSTANCE_MERONYM));
            cartPr(keys, source.getPointers(PointerType.MEMBER_MERONYM));
        }

        log.info("Noun antonyms: " + keys.size());
        return keys;
    } catch (JWNLException e) {
        throw new SMatchException(e.getClass().getSimpleName() + ": " + e.getMessage(), e);
    }
}
 
开发者ID:s-match,项目名称:s-match-wordnet,代码行数:25,代码来源:InMemoryWordNetBinaryArray.java

示例3: findVerbHypernyms

import net.sf.extjwnl.dictionary.Dictionary; //导入方法依赖的package包/类
private static Set<Long> findVerbHypernyms(Dictionary dic) throws SMatchException {
    log.info("Creating verb hypernyms array...");
    try {
        Set<Long> keys = new HashSet<>();
        int count = 0;
        Iterator<Synset> it = dic.getSynsetIterator(POS.VERB);
        while (it.hasNext()) {
            count++;
            if (0 == count % 1000) {
                log.debug("verb hypernyms: " + count);
            }
            Synset source = it.next();
            long sourceOffset = source.getOffset();
            traverseTreeMG(keys, PointerUtils.getHypernymTree(source), sourceOffset);
        }
        log.info("Verb hypernyms: " + keys.size());
        return keys;
    } catch (JWNLException e) {
        throw new SMatchException(e.getClass().getSimpleName() + ": " + e.getMessage(), e);
    }
}
 
开发者ID:s-match,项目名称:s-match-wordnet,代码行数:22,代码来源:InMemoryWordNetBinaryArray.java

示例4: findNominalizations

import net.sf.extjwnl.dictionary.Dictionary; //导入方法依赖的package包/类
private static Set<Long> findNominalizations(Dictionary dic) throws SMatchException {
    log.info("Creating nominalizations array...");
    try {
        Set<Long> keys = new HashSet<>();
        int count = 0;
        Iterator<Synset> it = dic.getSynsetIterator(POS.VERB);
        while (it.hasNext()) {
            count++;
            if (0 == count % 1000) {
                log.debug("nominalizations: " + count);
            }
            Synset source = it.next();
            List<Pointer> pointers = source.getPointers(PointerType.DERIVATION);
            for (Pointer pointer : pointers) {
                if (POS.NOUN.equals(pointer.getTargetPOS())) {
                    long targetOffset = pointer.getTargetOffset();
                    long key = (source.getOffset() << 32) + targetOffset;
                    keys.add(key);
                }
            }
        }
        log.info("Nominalizations: " + keys.size());
        return keys;
    } catch (JWNLException e) {
        throw new SMatchException(e.getClass().getSimpleName() + ": " + e.getMessage(), e);
    }
}
 
开发者ID:s-match,项目名称:s-match-wordnet,代码行数:28,代码来源:InMemoryWordNetBinaryArray.java

示例5: findAdjectiveSynonyms

import net.sf.extjwnl.dictionary.Dictionary; //导入方法依赖的package包/类
private static Set<Long> findAdjectiveSynonyms(Dictionary dic) throws SMatchException {
    log.info("Creating adjective synonyms array...");
    try {
        Set<Long> keys = new HashSet<>();
        int count = 0;
        Iterator<Synset> it = dic.getSynsetIterator(POS.ADJECTIVE);
        while (it.hasNext()) {
            count++;
            if (0 == count % 1000) {
                log.debug("adjective synonyms: " + count);
            }
            Synset source = it.next();
            long sourceOffset = source.getOffset();
            List<Pointer> pointers = source.getPointers(PointerType.SIMILAR_TO);
            for (Pointer ptr : pointers) {
                long targetOffset = ptr.getTargetOffset();
                long key;
                if (targetOffset > sourceOffset) {
                    key = (targetOffset << 32) + sourceOffset;
                } else {
                    key = (sourceOffset << 32) + targetOffset;
                }
                keys.add(key);
            }
        }
        log.info("Adjective synonyms: " + keys.size());
        return keys;
    } catch (JWNLException e) {
        throw new SMatchException(e.getClass().getSimpleName() + ": " + e.getMessage(), e);
    }
}
 
开发者ID:s-match,项目名称:s-match-wordnet,代码行数:32,代码来源:InMemoryWordNetBinaryArray.java

示例6: findAdverbAntonyms

import net.sf.extjwnl.dictionary.Dictionary; //导入方法依赖的package包/类
private static Set<Long> findAdverbAntonyms(Dictionary dic) throws SMatchException {
    log.info("Creating adverb antonyms array...");
    try {
        Set<Long> keys = new HashSet<>();
        int count = 0;
        Iterator<Synset> it = dic.getSynsetIterator(POS.ADVERB);
        while (it.hasNext()) {
            count++;
            if (0 == count % 1000) {
                log.debug("adverb antonyms: " + count);
            }
            Synset source = it.next();
            long sourceOffset = source.getOffset();
            List<Pointer> pointers = source.getPointers(PointerType.ANTONYM);
            for (Pointer ptr : pointers) {
                long targetOffset = ptr.getTargetOffset();
                long key;
                if (targetOffset > sourceOffset) {
                    key = (targetOffset << 32) + sourceOffset;
                } else {
                    key = (sourceOffset << 32) + targetOffset;
                }
                keys.add(key);
            }
        }
        log.info("Adverbs antonyms: " + keys.size());
        return keys;
    } catch (JWNLException e) {
        throw new SMatchException(e.getClass().getSimpleName() + ": " + e.getMessage(), e);
    }
}
 
开发者ID:s-match,项目名称:s-match-wordnet,代码行数:32,代码来源:InMemoryWordNetBinaryArray.java

示例7: findNounHypernyms

import net.sf.extjwnl.dictionary.Dictionary; //导入方法依赖的package包/类
private static Set<Long> findNounHypernyms(Dictionary dic) throws SMatchException {
    log.info("Creating noun hypernyms array...");
    try {
        Set<Long> keys = new HashSet<>();
        int count = 0;
        Iterator<Synset> it = dic.getSynsetIterator(POS.NOUN);
        while (it.hasNext()) {
            count++;
            if (0 == count % 10000) {
                log.debug("noun hypernyms: " + count);
            }
            Synset source = it.next();
            long sourceOffset = source.getOffset();
            traverseTreeMG(keys, PointerUtils.getHypernymTree(source), sourceOffset);
            traverseTreeMG(keys, PointerUtils.getInheritedHolonyms(source), sourceOffset);
            traverseTreeMG(keys, PointerUtils.getInheritedMemberHolonyms(source), sourceOffset);
            traverseTreeMG(keys, PointerUtils.getInheritedPartHolonyms(source), sourceOffset);
            traverseTreeMG(keys, PointerUtils.getInheritedSubstanceHolonyms(source), sourceOffset);
            traverseListMG(keys, PointerUtils.getHolonyms(source), sourceOffset);
            traverseListMG(keys, PointerUtils.getMemberHolonyms(source), sourceOffset);
            traverseListMG(keys, PointerUtils.getPartHolonyms(source), sourceOffset);
            traverseListMG(keys, PointerUtils.getSubstanceHolonyms(source), sourceOffset);
        }
        log.info("Noun hypernyms: " + keys.size());
        return keys;
    } catch (JWNLException e) {
        throw new SMatchException(e.getClass().getSimpleName() + ": " + e.getMessage(), e);
    }
}
 
开发者ID:s-match,项目名称:s-match-wordnet,代码行数:30,代码来源:InMemoryWordNetBinaryArray.java


注:本文中的net.sf.extjwnl.dictionary.Dictionary.getSynsetIterator方法示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。