Finding the shortest excerpt that contains all search terms
Pythonicity

Your solution feels very procedural and not really Pythonic.  I believe that this function accomplishes the same task using roughly the same approach:

from itertools import product

def answer(document, search_terms):
    words = document.split(" ")

    search_term_positions = [
        [i for i, word in enumerate(words) if word == term] 
        for term in search_terms
    ]

    combos = [sorted(combo) for combo in product(*search_term_positions)]
    if not combos:
        return None    # Could not find all search terms
    best_combo = min(combos, key=lambda combo: combo[-1] - combo[0])

    return " ".join(words[best_combo[0] : best_combo[-1] + 1])


Observations:


d is a variable name that suggests that it's a dict, but is not much more helpful than that.  Instead of d.values(), I've defined search_term_positions, which is a much more descriptive variable name.  You don't really even need a dictionary, since you only care about the values, not the keys.
You can simplify the second for loop by taking full advantage of the built-in min() function.
You wrote sum(differenceList) three times!  sum(differenceList) is just sortedList[-1] - sortedList[0], because

$$(n_1 - n_0) + (n_2 - n_1) + (n_3 - n_2) + \ldots + (n_N - n_{N - 1})$$

is a telescoping series where all of the terms cancel except \$-n_0\$ and \$n_N\$.
sortedElement[len(sortedElement)-1] can be written as sortedElement[-1].
Swallowing all exceptions with except: pass is a no-no.


Bugs

This function only recognizes words that are delimited by spaces.  Any other punctuation could cause words to fail to be recognized.

Your algorithm works based on word count rather than by character positions.  Therefore, you end up finding the excerpt with the fewest intervening words, which is not necessarily what I would consider to be the "shortest snippet".  Example:

&gt;&gt;&gt; answer('many google supercalifragilistic program to google a program', ['google', 'program'])
'google supercalifragilistic program'




I've also written a different solution to solve the same problem.  There, as here, I've made no attempt to choose a speedy algorithm, but rather aimed for clarity.