def anagrams_in_word(word, sowpods=False, start="<STR_LIT>", end="<STR_LIT>"):
input_letters, blanks, questions = blank_tiles(word)<EOL>for tile in start + end:<EOL><INDENT>input_letters.append(tile)<EOL><DEDENT>for word in word_list(sowpods, start, end):<EOL><INDENT>lmap = _letter_map(input_letters)<EOL>used_blanks = <NUM_LIT:0><EOL>for letter in word:<EOL><INDENT>if letter in lmap:<EOL><INDENT>lmap[letter] -= <NUM_LIT:1><EOL>if lmap[letter] < <NUM_LIT:0>:<EOL><INDENT>used_blanks += <NUM_LIT:1><EOL>if used_blanks > (blanks + questions):<EOL><INDENT>break<EOL><DEDENT><DEDENT><DEDENT>else:<EOL><INDENT>used_blanks += <NUM_LIT:1><EOL>if used_blanks > (blanks + questions):<EOL><INDENT>break<EOL><DEDENT><DEDENT><DEDENT>else:<EOL><INDENT>yield (word, word_score(word, input_letters, questions))<EOL><DEDENT><DEDENT>
Finds anagrams in word.

    Args:
        word: the string to base our search off of
        sowpods: boolean to declare TWL or SOWPODS words file
        start: a string of starting characters to find anagrams based on
        end: a string of ending characters to find anagrams based on

    Yields:
        a tuple of (word, score) that can be made with the input_word