helpers.py

# Word cleaner
def justWord(word,invalids) :
    if word.endswith(invalids):
        return justWord(word[:len(word)-1],invalids)
    if word.startswith(invalids):
        return justWord(word[1:],invalids)
    return word

# Source: http://www.unicode.org/charts/
def isAlphabet(word):
    if len(word) == 0:
        return False
    for char in word:
        if ord(char) >= 97 and ord(char) <= 122: # English
            return True
        if ord(char) >= 2304 and ord(char) <= 2403: # Devanagiri
            return True
    return False
def isNum(word):
    if len(word) == 0:
        return False
    for char in word:
        if ord(char) >= 97 and ord(char) <= 122: # English
            return False
        if ord(char) >= 2304 and ord(char) <= 2403: # Devanagiri
            return False
    return True
def isAlphaNum(word):
    return isAlphabet(word) or isNum(word)

def merge_lists(lists):
    merged = []
    for words in lists: 
        for word in words:
            if word not in merged and len(word)>0:
                merged.append(word)
    return sorted(merged)

curr_node = lambda node,sequence: curr_node(node[sequence[0]],sequence[1:]) if len(sequence)>0 else node