zoukankan      html  css  js  c++  java
  • 退火算法

     w

    # -*- coding: utf-8 -*-
    def segment(text, segs):
        words = []
        last = 0
        for i in range(len(segs)):
            if segs[i] == '1':
                words.append(text[last:i+1])
                last = i+1
        words.append(text[last:])
        return words
    
    def evaluate(text, segs):
        words = segment(text, segs)
        print words
        text_size = len(words)
        print text_size
        lexicon_size = len(' '.join(list(set(words))))
        print set(words)
        print list(set(words))
        print ' '.join(list(set(words)))
        print lexicon_size
        size = text_size + lexicon_size
        print size
        return size
    
    text = "doyouseethekittyseethedoggydoyoulikethekittylikethedoggy"
    seg1 = "0000000000000001000000000010000000000000000100000000000"
    seg2 = "0100100100100001001001000010100100010010000100010010000"
    seg3 = "0000100100000011001000000110000100010000001100010000001"
    
    #evaluate(text, seg1)
    evaluate(text, seg2)
    #evaluate(text, seg3)
  • 相关阅读:
    poj3268(Silver Cow Party)最短路
    关于Phaser
    关于StampedLock
    关于AQS
    关于Exechanger
    关于Semaphore
    关于CyclicBarrier
    关于CountDownLatch
    关于BlockingQueue
    关于ThreandLocal
  • 原文地址:https://www.cnblogs.com/rsapaper/p/6847245.html
Copyright © 2011-2022 走看看