US5915259A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Document schema transformation by patterns and contextual conditions
Assignee: Xerox Corp
•
Filing: 1996-03-20
•
Granted: 1999-06-22
•
Expires: 2016-03-20
Abstract
Abstract A computer-based method for providing the generation of schemas for output documents. An output schema representing a desired output condition of a document is created from inputs comprising a tree transformation rule defined by at least a pattern, a contextual condition, an input schema, and user specified parameters. A match-identifying tree automaton is created from the one pattern, the contextual condition, and the input schema; and the match-identifying tree automaton is modified with respect to said user specified parameters.
Inventors
- 👤 Makoto Murata
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 18:17
CPC Classifications
G; G06; G06F; G06F40/00; G06F40/20; G06F40/205; G06F40/221; G06F40/10; G06F40/12; G06F40/151; G06F40/154
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
83 words
A computer-based method for transforming document schema, comprising: providing (a) an input schema to which an input document is conformable (b) a tree transformation rule defined by at least a pattern, and (c) a contextual condition; using a processor to construct a match-identifying tree automaton from said at least one pattern, said contextual condition, and said input schema; modifying said match-identifying tree automaton to create an output schema; and storing the output schema in a memory for use in conforming an output document.
Claim 2
Dependent Claim
83 words
A computer-based method for transforming document schema, comprising: providing (a) an input schema to which an input document is conformable (b) a tree transformation rule defined by at least a pattern, and (c) a contextual condition; using a processor to construct a match-identifying tree automaton from said at least one pattern, said contextual condition, and said input schema; modifying said match-identifying tree automaton to create an output schema; and storing the output schema in a memory for use in conforming an output document.
Claim 3
Dependent Claim
20 words
The computer based method of claim 1, wherein said providing step includes providing a deterministic tree automaton as a pattern.
Claim 4
Dependent Claim
27 words
The computer based method of claim 1, wherein said providing step includes providing a pointed tree language represented by a pointed tree representation as a contextual condition.
Claim 5
Dependent Claim
23 words
The computer based method of claim 1, wherein said providing step includes providing a non-deterministic or deterministic tree automaton as an input schema.
Claim 6
Dependent Claim
30 words
The computer based method of claim 1, wherein said using step includes creating a match-identifying tree automaton through a deterministic tree automaton by allowing any state as a final state.
Claim 7
Dependent Claim
37 words
The computer based method of claim 1, wherein said using step includes creating an unambiguous non-deterministic tree automaton by constructing a pseudo deterministic tree automaton, a classification function, and a deterministic string automaton from said tree automaton.
Claim 8
Dependent Claim
34 words
The computer based method of claim 6, further comprising constructing an unambiguous non-deterministic string automaton from said deterministic string automaton by first allowing any state as a final state and then reversing transition direction.
Claim 9
Dependent Claim
31 words
The computer based method of claim 7, further comprising constructing an unambiguous non-deterministic tree automaton by combining said pseudo deterministic tree automaton, said classification function, and said unambiguous non-deterministic tree automaton.
Claim 10
Dependent Claim
31 words
The computer based method of claim 8, further comprising creating a match-identifying tree automaton by creating an intersection automaton of said pseudo deterministic tree automaton and said unambiguous non-deterministic tree automaton.
Claim 11
Dependent Claim
47 words
The computer based method of claim 1, wherein said using step includes constructing a match-identifying tree automaton from an input schema, pattern and contextual condition derived from said input document whereby said match-identifying tree automaton identifies matches at schema levels while accepting trees related to matched schema.
Claim 12
Dependent Claim
21 words
The computer based method of claim 1, wherein said modifying step includes modifying said match-identifying tree automaton with operator specified parameters.
Claim 13
Dependent Claim
29 words
The computer based method of claim 11, wherein said modifying said match-identifying tree automaton with operator specified parameters includes modifying said match identifying tree automaton according to operator semantics.
References Cited (Backward Citations)
US5557720A
Cited
US5491628A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-06-21 | 2002-12-21 | 2003-06-22 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-06-21 | 2006-12-21 | 2007-06-22 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-06-21 | 2010-12-21 | 2011-06-22 | $7700.00 | Window Closed / Lapsed |