US6330530B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and system for transforming a source language linguistic structure into a target language linguistic structure based on example linguistic feature structures
Assignee: Sony Corp
•
Filing: 1999-10-18
•
Granted: 2001-12-11
•
Expires: 2019-10-18
Abstract
Abstract A system and method for transforming input source language linguistic structures (SLS) to target linguistic language linguistic structures (TLS) are described. In one embodiment, the SLS is matched to at least one existing source language example linguistic structure (SEF). The SLS is aligned with the at least one SEF, and the TLS is generated using at least one target language example linguistic structure (TEF) corresponding to the at least one SEF.
Inventors
- 👤 Keiko Horiguchi
- 👤 Alexander Franz
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-10 00:58
CPC Classifications
G; G06; G06F; G06F40/00; G06F40/20; G06F40/268; G06F40/205; G06F40/211; G06F40/40; G06F40/42; G06F40/45
Claims Analysis
Total Claims: 47
Claim 1
Independent Claim
82 words
A computerized method of transforming an input source language linguistic feature structure (SLS) representing an expression in the source language to a target language linguistic feature structure (TLS) representing the expression in the target language, comprising: matching the SLS to at least one existing source language example linguistic feature structure (SEF); aligning the SLS with the at least one SEF; and generating the TLS using at least one target language example linguistic feature structure (TEF) corresponding to the at least one SEF.
Claim 2
Dependent Claim
82 words
A computerized method of transforming an input source language linguistic feature structure (SLS) representing an expression in the source language to a target language linguistic feature structure (TLS) representing the expression in the target language, comprising: matching the SLS to at least one existing source language example linguistic feature structure (SEF); aligning the SLS with the at least one SEF; and generating the TLS using at least one target language example linguistic feature structure (TEF) corresponding to the at least one SEF.
Claim 3
Dependent Claim
23 words
The method of claim 1 wherein matching further comprises: applying transfer grammar rules to the SLS to create at least one SLS sub-structure.
Claim 4
Dependent Claim
38 words
The method of claim 2 wherein the transfer grammar rules are recursively applied to the SLS sub-structure from a top-most transfer rule until all SLS sub-structures within SLS are transferred to corresponding TEF sub-structures contained within the TEF.
Claim 5
Dependent Claim
17 words
The method of claim 2 further comprising: compiling the transfer grammar rules to generate a transfer grammar.
Claim 6
Dependent Claim
21 words
The method of claim 2 wherein matching further comprises: applying compiled context-free grammar rules to the at least one SLS sub-structure.
Claim 7
Dependent Claim
26 words
The method of claim 5 wherein the context-free grammar rules are applied recursively from specific SLS sub-structures to more general SLS sub-structures contained within the SLS.
Claim 8
Dependent Claim
20 words
The method of claim 2 wherein generating the TLS is applied recursively from larger SLS sub-structures to smaller SLS sub-structures.
Claim 9
Dependent Claim
22 words
The method of claim 2 further comprising: combining at least two SLS sub-structures to calculate a match cost with the SEF sub-structure.
Claim 10
Dependent Claim
61 words
The method of claim 2 wherein aligning further comprises: if the at least one SLS sub-structure is not aligned, performing said matching, aligning, and generating using the unaligned at least one SLS sub-structure as input until a matched, aligned sub-structure is found to produce at least one sub-TLS, and inserting the at least one resulting sub-TLS into a corresponding TEF sub-structure.
Claim 11
Dependent Claim
47 words
The method of claim 2 further comprising: if the at least one SEF sub-structure is indexed and if the at least one SEF sub-structure is not aligned, deleting the corresponding at least one TEF sub-structure if the at least one TEF sub-structure is not marked “don't delete”.
Claim 12
Dependent Claim
79 words
The method of claim 2 further comprising: if the at least one SEF sub-structure is indexed and if the at least one SEF sub-structure is aligned, if the at least one SEF sub-structure is not similar to the corresponding at least one SLS sub-structure, performing said matching, aligning, and generating using the at least one SEF sub-structure, producing at least one resulting sub-TLS, and replacing the corresponding at least one TEF sub-structure with the at least one resulting sub-TLS.
Claim 13
Dependent Claim
18 words
The method of claim 1 wherein the SEF and corresponding TEF are maintained in a bilingual example database.
Claim 14
Dependent Claim
27 words
The method of claim 1 wherein matching further comprises: if an exact match is found, transferring the matching SEF to the corresponding TEF to produce the TLS.
Claim 15
Dependent Claim
26 words
The method of claim 1 wherein matching further comprises: generating a match cost; and accepting the matching SEF if the match cost is within pre-defined limits.
Claim 16
Independent Claim
86 words
A system for transforming an input source language linguistic feature structure (SLS) representing an expression in the source language to a target language linguistic structure (TLS) representing the expression in the target language, comprising: means for matching the SLS to at least one existing source language example linguistic feature structure (SEF); means for aligning the SLS with the at least one SEF; and means for generating the TLS using at least one target language example linguistic feature structure (TEF) corresponding to the at least one SEF.
Claim 17
Independent Claim
86 words
A system for transforming an input source language linguistic feature structure (SLS) representing an expression in the source language to a target language linguistic structure (TLS) representing the expression in the target language, comprising: means for matching the SLS to at least one existing source language example linguistic feature structure (SEF); means for aligning the SLS with the at least one SEF; and means for generating the TLS using at least one target language example linguistic feature structure (TEF) corresponding to the at least one SEF.
Claim 18
Dependent Claim
94 words
A computer readable medium comprising instructions, which when executed on a processor, perform a method for transforming an input source language linguistic feature structure (SLS) representing an expression in the source language to a target language linguistic feature structure (TLS) representing the expression in the target language, comprising: matching the SLS to at least one existing source language example linguistic feature structure (SEF); aligning the SLS with the at least one SEF; and generating the TLS using at least one target language example linguistic feature structure (TEF) corresponding to the at least one SEF.
Claim 19
Dependent Claim
94 words
A computer readable medium comprising instructions, which when executed on a processor, perform a method for transforming an input source language linguistic feature structure (SLS) representing an expression in the source language to a target language linguistic feature structure (TLS) representing the expression in the target language, comprising: matching the SLS to at least one existing source language example linguistic feature structure (SEF); aligning the SLS with the at least one SEF; and generating the TLS using at least one target language example linguistic feature structure (TEF) corresponding to the at least one SEF.
Claim 20
Dependent Claim
23 words
The medium of claim 16 wherein matching further comprises: applying transfer grammar rules to the SLS to create at least one SLS sub-structure.
Claim 21
Dependent Claim
38 words
The medium of claim 17 wherein the transfer grammar rules are recursively applied to the SLS sub-structure from a top-most transfer rule until all SLS sub-structures within SLS are transferred to corresponding TEF sub-structures contained within the TEF.
Claim 22
Dependent Claim
17 words
The medium of claim 17 further comprising: compiling the transfer grammar rules to generate a transfer grammar.
Claim 23
Dependent Claim
21 words
The medium of claim 17 wherein matching further comprises: applying compiled context-free grammar rules to the at least one SLS sub-structure.
Claim 24
Dependent Claim
26 words
The medium of claim 20 wherein the context-free grammar rules are applied recursively from specific SLS sub-structures to more general SLS sub-structures contained within the SLS.
Claim 25
Dependent Claim
20 words
The medium of claim 17 wherein generating the TLS is applied recursively from larger SLS sub-structures to smaller SLS sub-structures.
Claim 26
Dependent Claim
22 words
The medium of claim 17 further comprising: combining at least two SLS sub-structures to calculate a match cost with the SEF sub-structure.
Claim 27
Dependent Claim
61 words
The medium of claim 17 wherein aligning further comprises: if the at least one SLS sub-structure is not aligned, performing said matching, aligning, and generating using the unaligned at least one SLS sub-structure as input until a matched, aligned sub-structure is found to produce at least one sub-TLS, and inserting the at least one resulting sub-TLS into a corresponding TEF sub-structure.
Claim 28
Dependent Claim
47 words
The medium of claim 17 further comprising: if the at least one SEF sub-structure is indexed and if the at least one SEF sub-structure is not aligned, deleting the corresponding at least one TEF sub-structure if the at least one TEF sub-structure is not marked “don't delete”.
Claim 29
Dependent Claim
80 words
The medium of claim 17 further comprising: if the at least one SEF sub-structure is indexed and if the at least one SEF sub-structure is aligned, if the at least one SEF sub-structure is not similar to the corresponding at least one SLS sub-structure, performing said matching, aligning, and generating using the at least one SEF sub-structure, to produce at least one resulting sub-TLS, and replacing the corresponding at least one TEF sub-structure with the at least one resulting sub-TLS.
Claim 30
Dependent Claim
18 words
The medium of claim 16 wherein the SEF and corresponding TEF are maintained in a bilingual example database.
Claim 31
Dependent Claim
27 words
The medium of claim 16 wherein matching further comprises: if an exact match is found, transferring the matching SEF to the corresponding TEF to produce the TLS.
Claim 32
Dependent Claim
26 words
The medium of claim 16 wherein matching further comprises: generating a match cost; and accepting the matched SEF if the match cost is within pre-defined limits.
Claim 33
Independent Claim
86 words
An apparatus for transforming an input source language linguistic feature structure (SLS) representing an expression in the source language to a target language linguistic feature structure (TLS) representing the expression in the target language, comprising: a transfer module configured to match the SLS to at least one existing source language example linguistic feature structure (SEF), align the SLS with the at least one SEF, and generate the TLS using at least one target language example linguistic feature structure (TEF) corresponding to the at least one SEF.
Claim 34
Independent Claim
86 words
An apparatus for transforming an input source language linguistic feature structure (SLS) representing an expression in the source language to a target language linguistic feature structure (TLS) representing the expression in the target language, comprising: a transfer module configured to match the SLS to at least one existing source language example linguistic feature structure (SEF), align the SLS with the at least one SEF, and generate the TLS using at least one target language example linguistic feature structure (TEF) corresponding to the at least one SEF.
Claim 35
Dependent Claim
27 words
The apparatus of claim 30 wherein the transfer module is further configured to: apply transfer grammar rules to the SLS to create at least one SLS sub-structure.
Claim 36
Dependent Claim
34 words
The apparatus of claim 31 wherein the transfer grammar rules are recursively applied to the SLS sub-structure from a top-most transfer rule until all SLS sub-structures within SLS are transferred to corresponding TEF sub-structures.
Claim 37
Dependent Claim
21 words
The apparatus of claim 31 further comprising: a compiler configured to compile the transfer grammar rules to generate a transfer grammar.
Claim 38
Dependent Claim
25 words
The apparatus of claim 31 wherein the transfer module is further configured to apply compiled context-free grammar rules to the at least one SLS sub-structure.
Claim 39
Dependent Claim
26 words
The apparatus of claim 34 wherein the context-free grammar rules are applied recursively from specific SLS sub-structures to more general SLS sub-structures contained within the SLS.
Claim 40
Dependent Claim
21 words
The apparatus of claim 31 wherein the generation of TLS is applied recursively from larger SLS sub-structures to smaller SLS sub-structures.
Claim 41
Dependent Claim
28 words
The apparatus of claim 31 wherein the transfer module is further configured to combine at least two SLS sub-structures to calculate a match cost with the SEF sub-structure.
Claim 42
Dependent Claim
18 words
The apparatus of claim 30 wherein the SEF and corresponding TEF are maintained in a bilingual example database.
Claim 43
Dependent Claim
31 words
The apparatus of claim 30 wherein the transfer module is further configured to: transfer the matching SEF to the corresponding TEF to produce the TLS if an exact match is found.
Claim 44
Dependent Claim
17 words
The apparatus of claim 30 further comprising: a thesaurus matching system configured to generate a match cost.
Claim 45
Dependent Claim
24 words
The apparatus of claim 40 wherein transfer module is further configured to accept the matching SEF if the match cost is within pre-defined limits.
Claim 46
Dependent Claim
91 words
A memory for storing data for access by an application program being executed on a data processing system, comprising: a data structure stored in said memory, said data structure including information resident in a database used by said application program and including: a plurality of bilingual example pairs used for the matching of data, wherein each bilingual example pair includes a source language example linguistic feature structure representing an expression in the source language, and a target language example linguistic feature structure corresponding to the source language example linguistic feature structure.
Claim 47
Dependent Claim
91 words
A memory for storing data for access by an application program being executed on a data processing system, comprising: a data structure stored in said memory, said data structure including information resident in a database used by said application program and including: a plurality of bilingual example pairs used for the matching of data, wherein each bilingual example pair includes a source language example linguistic feature structure representing an expression in the source language, and a target language example linguistic feature structure corresponding to the source language example linguistic feature structure.
References Cited (Backward Citations)
US5101349A
Cited
US5088038A
Cited
US5535120A
Cited
US5768603A
Cited
US5528491A
Cited
US5864788A
Cited
US5426583A
Cited
US5510981A
Cited
US5659765A
Cited
US5963894A
Cited
US5907821A
Cited
US5983169A
Cited
US5727222A
Cited
EP0805403A2
Cited
US6161083A
Cited
US5903860A
Cited
US5819210A
Cited
US6064953A
Cited
US6223150B1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2004-12-10 | 2005-06-11 | 2005-12-11 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2008-12-10 | 2009-06-11 | 2009-12-11 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2012-12-10 | 2013-06-11 | 2013-12-11 | $7700.00 | Window Closed / Lapsed |