Legal claims defining the scope of protection, as filed with the USPTO.
2. The system of claim 1, wherein the elimination criteria further includes removing word tokens based on a set of rules, and wherein a word token solution set is removed based on a determination that at least a number of important word tokens are not associated with the index file.
3. The system of claim 1, wherein the elimination criteria further includes removing a token solution set that does not correspond to romanizations and dictionary translations from a same character group.
4. The system of claim 1, wherein the frequency token threshold is determined using an average and a standard deviation of a set of frequency scores.
5. The system of claim 1, wherein the input symbol is a logographic language and different from a second language in the index file.
9. The method of claim 8, wherein the elimination criteria further includes removing word tokens based on a set of rules, and wherein a word token solution set is removed when at least a number of a subset of word tokens are not associated with the index file.
10. The method of claim 8, wherein the elimination criteria further includes removing a token solution set that does not correspond to romanizations and dictionary translations from a same character group.
11. The method of claim 8, wherein the frequency token threshold is determined using an average and a standard deviation of a set of frequency scores.
12. The method of claim 8, wherein the input symbol is a logographic language and different from a second language in the index file.
15. The non-transitory machine-readable medium of claim 14, wherein the elimination criteria further includes removing word tokens based on a set of rules, and wherein a word token solution set is removed based on at least a number of the group of word tokens not being associated with the index file.
16. The non-transitory machine-readable medium of claim 14, wherein the elimination criteria further includes removing a token solution set that does not correspond to romanizations and dictionary translations from a same character group.
17. The non-transitory machine-readable medium of claim 14, wherein the frequency token threshold is determined using an average and a standard deviation of a set of frequency scores.
18. The non-transitory machine-readable medium of claim 14, wherein the input symbol is a logographic language and different from a second language in the index file.
Unknown
February 27, 2024
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.