Claims
- 1. A method for analyzing text in a natural language, the method comprising:
constructing a hierarchical tree representing a text in a natural language; and applying a reduce rule to the hierarchical tree, the rule applicable only to an instance of a predetermined sub-hierarchy of the hierarchical tree.
- 2. The method of claim 1, wherein the step of applying comprises
specifying the predetermined sub-hierarchy as a path through the hierarchical tree.
- 3. The method of claim 2, wherein the step of applying further comprises
specifying the predetermined sub-hierarchy as a path through the hierarchical tree, the path a sequence of nodes starting at the root of the hierarchical tree.
- 4. The method of claim 2, wherein the step of applying further comprises
specifying the predetermined sub-hierarchy as a path through the hierarchical tree, the path a sequence of nodes starting at an instance of a node other than the root of the hierarchical free.
- 5. A method for constructing a text analyzer, the method comprising:
enabling a user to specify reduce rules for a hierarchical tree representing text in a natural language; and enabling the user to specify a rule applicable only to an instance of a predetermined sub-hierarchy of the hierarchical tree.
- 6. A data store wherein is located a computer program for constructing a text analyzer by:
enabling a user to specify reduce rules for a hierarchical tree representing text in a natural language; and enabling the user to specify a rule applicable only to an instance of a predetermined sub-hierarchy of the hierarchical tree.
- 7. A computer system for creating a text analyzer, the computer system comprising:
the data store of claim 6; and a CPU, communicatively coupled to the data store and for executing the computer program in the data store.
- 8. A method for analyzing text in a natural language, the method comprising:
constructing a hierarchical tree representing a text in a natural language; applying rules to nodes of the hierarchical tree to transform the tree, the rules having elements and suggested nodes; and associating data with a node that matches an element of a rule.
- 9. A method for analyzing text in a natural language, the method comprising:
constructing a hierarchical tree representing a text in a natural language; applying rules to nodes of the hierarchical tree to transform the tree, a rule having an element and a suggested node; and associating data with a node that matches a suggested node of a rule.
- 10. A method for analyzing text in a natural language, the method comprising:
constructing a hierarchical tree representing a text in a natural language; applying rules to nodes of the hierarchical tree to transform the tree, a rule having a context that is an instance of a predetermined sub-hierarchy of the hierarchical tree; and associating data with a node that matches the context of a rule.
BENEFIT APPLICATIONS
[0001] This application claims the benefit of the following application:
[0002] U.S. Provisional Patent Application No. 60/241,099, entitled, “Computer Programming Language, System and Method for Building Text Analyzers,” filed Oct. 16, 2001, naming Amnon Meyers and David S. de Hilster as inventors, with Attorney Docket No. P-69927 and under an obligation of assignment to Text Analysis International, Inc. of Sunnyvale, Calif.
[0003] U.S. Provisional Patent Applications No. 60/241,099 is incorporated by reference herein.
[0004] This application is related to the following application:
[0005] U.S. patent application Ser. No. 09/604,836, entitled, “Automated Generation of Text Analysis Systems,” filed Jun. 27, 2000, naming Amnon Meyers and David S. de Hilster as inventors, with Attorney Docket No. A-68807/AJT/JWC and assigned to Text Analysis International, Inc. of Sunnyvale, Calif.
Provisional Applications (1)
|
Number |
Date |
Country |
|
60241099 |
Oct 2000 |
US |