11. A non-transitory, machine-readable medium having stored thereon instructions that, when executed by at least one processor, cause the at least one processor to: identify a plurality of tokens in a targeted text listing; filter a first token of the plurality of tokens according to a first set of exclusion rules, whereby the first token is excluded as an instance of a similar spelling error if it satisfies any rule of the first set of exclusion rules; when the first token has not been excluded as an instance of a similar spelling error according to the first set of exclusion rules, determine whether a second token of the plurality of tokens is similar to the first token based on a predetermined number of different characters between the first token and the second token; when the first token and the second token are similar, filter the first token and the second token according to a second set of exclusion rules, whereby the first token is excluded as an instance of a similar spelling error if it satisfies any rule of the second set of exclusion rules; when the first token has not been excluded as an instance of a similar spelling error according to the second set of exclusion rules, identify the first token as an instance of a similar spelling error based on the second token; and provide the similar spelling error instance including the first token and the second token to a user interface.
11. A non-transitory, machine-readable medium having stored thereon instructions that, when executed by at least one processor, cause the at least one processor to: identify a plurality of tokens in a targeted text listing; filter a first token of the plurality of tokens according to a first set of exclusion rules, whereby the first token is excluded as an instance of a similar spelling error if it satisfies any rule of the first set of exclusion rules; when the first token has not been excluded as an instance of a similar spelling error according to the first set of exclusion rules, determine whether a second token of the plurality of tokens is similar to the first token based on a predetermined number of different characters between the first token and the second token; when the first token and the second token are similar, filter the first token and the second token according to a second set of exclusion rules, whereby the first token is excluded as an instance of a similar spelling error if it satisfies any rule of the second set of exclusion rules; when the first token has not been excluded as an instance of a similar spelling error according to the second set of exclusion rules, identify the first token as an instance of a similar spelling error based on the second token; and provide the similar spelling error instance including the first token and the second token to a user interface. 15. The machine-readable medium of claim 11 , wherein those instructions that, when executed by the at least one processor, cause the at least one processor to filter the first token according to the first set of exclusion rules are further operative to: identify a number of occurrences of each token of the plurality of tokens within the targeted text listing; and when the number of occurrences for a token of the plurality of tokens is not less than a threshold, exclude the token from being identified as an instance of a similar spelling error.