17. A non-transitory, computer-readable medium comprising instructions which, when executed by one or more processors, causes the one or more processors to perform operations comprising: receiving a first crash dump caused by an application crash; extracting, from the first crash dump, a first function signature of a function that caused the first crash dump; searching a datastore of crash dumps for function signatures that substantially match the first function signature, wherein the searching comprises: performing an approximate string-match between each of the function signatures and the first function signature; comparing the approximate string-matches to a first threshold; performing an exact string match between each of the function signatures and the first function signature; comparing the exact string-matches to a second threshold; combining weighted results of the approximate string-match with weighted results of the exact string match to generate match scores for each of the function signatures; comparing the match scores to a third threshold; and identifying the function signatures that substantially match the first function signature based on: the comparing of the approximate string-matches to the first threshold; the comparing of the exact string-matches to the second threshold; and the comparing of the match scores to the third threshold.
17. A non-transitory, computer-readable medium comprising instructions which, when executed by one or more processors, causes the one or more processors to perform operations comprising: receiving a first crash dump caused by an application crash; extracting, from the first crash dump, a first function signature of a function that caused the first crash dump; searching a datastore of crash dumps for function signatures that substantially match the first function signature, wherein the searching comprises: performing an approximate string-match between each of the function signatures and the first function signature; comparing the approximate string-matches to a first threshold; performing an exact string match between each of the function signatures and the first function signature; comparing the exact string-matches to a second threshold; combining weighted results of the approximate string-match with weighted results of the exact string match to generate match scores for each of the function signatures; comparing the match scores to a third threshold; and identifying the function signatures that substantially match the first function signature based on: the comparing of the approximate string-matches to the first threshold; the comparing of the exact string-matches to the second threshold; and the comparing of the match scores to the third threshold. 19. T's he non-transitory computer-readable memory of claim 17 , wherein the approximate string match comprises calculating a Levenshtein score.