| 摘要 |
An automated method for checking patent applications or documents (1000) includes the steps of identifying subgroups of serial characters which relate to each other from within serial group of characters (200-350) and checking the subgroups for consistency of relation with regard to drafting rules (1700). Reference characters (600) are checked for consistency. A patent application is checked for all required parts (700-760). Inconsistency among elements for a selected character (600) is checked. Claim section (740), the number of claims (811) with proper dependency (920-948) are also checked. A recited hierarchical relationship is used to build a claim structure for checking antecedent basis for a family of claims (984). Elements needing antecedent basis are isolated and checked against recited potential antecedents appearing in the proper order (824-832). Claim elements lacking antecedents are reported to the user (830-834). |
