User interface operation based on similar spelling of tokens in text
First Claim
1. A method for operating a user interface of a machine comprising at least one processor, the method comprising:
- identifying, by the at least one processor, a plurality of tokens in a targeted text listing;
filtering, by the at least one processor, 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, determining, by the at least one processor, 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, filtering, by the at least one processor, 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, identifying, by the at least one processor, the first token as an instance of a similar spelling error based on the second token; and
providing, by the at least one processor to the user interface, the similar spelling error instance including the first token and the second token.
6 Assignments
0 Petitions
Accused Products
Abstract
Operation of a user interface includes performing token based analysis of a baseline text corpus and a targeted text listing. For a selected token in the targeted text listing, a matching baseline token in identified. From a plurality of contexts corresponding to the matching baseline token, context-matched and non-context matched usage data for the matching baseline token is identified and provided to a user interface. Similar processing may be performed on the basis of a related, but matching, baseline token. In another embodiment, instances of similar spelling errors are identified on the basis of a plurality of tokens identified in the targeted text listing.
11 Citations
15 Claims
-
1. A method for operating a user interface of a machine comprising at least one processor, the method comprising:
-
identifying, by the at least one processor, a plurality of tokens in a targeted text listing; filtering, by the at least one processor, 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, determining, by the at least one processor, 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, filtering, by the at least one processor, 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, identifying, by the at least one processor, the first token as an instance of a similar spelling error based on the second token; and providing, by the at least one processor to the user interface, the similar spelling error instance including the first token and the second token. - View Dependent Claims (2, 3, 4, 5)
-
-
6. An apparatus comprising:
-
at least one processor; a storage device operatively connected to the at least one processor and having stored thereon instructions that, when executed by the 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. - View Dependent Claims (7, 8, 9, 10)
-
-
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. - View Dependent Claims (12, 13, 14, 15)
-
Specification