双路最大匹配 bilateral matching

双路最大匹配 消除了前向与后向的差异，既可以过滤短词，也可以全部匹配实现搜索模式

这个代码太啰嗦，只是没时间整理了。其实可以短很多很多

def forwoard_slide(original,index_,max_len = 5):
    return original[index_:index_+max_len]

def forward_test_word(text,dict_):
    char_len = len(text)
    for char_index in range(char_len,0,-1):
        temp_word = text[0:char_index]
        if temp_word in dict_:
            return temp_word

def forwoard_max_matching(original,max_len,dict_):
    result = []
    dict_ = list(dictionaries)
    n = len(original)
    for i in range(n):
        temp_text = forwoard_slide(original,i,max_len)
        temp_word = forwoard_test_word(temp_text,dict_)
        if temp_word != None:
            result.append(temp_word)
    return result

def backward_slide(original,index_,max_len = 5):
    cut = index_-max_len
    if cut < 0:
        cut = 0
    return original[cut:index_]

def backward_test_word(text,dict_):
    char_len = len(text)
    for char_index in range(char_len):
        temp_word = text[char_index:char_index+char_len]
        if temp_word in dict_:
            return temp_word

def backward_max_matching(original,max_len,dict_):
    result = []
    dict_ = list(dictionaries)
    n = len(original)
    for i in range(n-1,0,-1):
        temp_text = backward_slide(original,i)
        temp_word = backward_test_word(temp_text,dict_)
        if temp_word:
            result.append(temp_word)
    return result[::-1]

def MaxMatching(original,max_len,word_dict,modeltype="search"):
    backward = backward_max_matching(sentence,max_len,word_dict)
    forwoard = forwoard_max_matching(sentence,max_len,word_dict)
    set_backward , set_forwoard = set(backward),set(forwoard)
    if modeltype == "search":
        return set_backward | set_forwoard
    elif modeltype == 'all':
        return {"backward":set_backward,"forwoard":set_forwoard}
    else:
        return set_backward & set_forwoard

axMatching(sentence,2,dictionaries,modeltype = 'all')