US5357430A
Expired / Lapsed
US
⏱️ 0.0 years remaining
System for text translation
Assignee: International Business Machines Corp
•
Filing: 1992-10-13
•
Granted: 1994-10-18
•
Expires: 2012-10-13
Abstract
Abstract The invention concerns a text translation system, wherein the memory of a computer system stores the word type, the semantic type, a juncture code, a position code, a transfer code, as well as the associated translation into the target language for each word of the source language. By means of the juncture code and the position code, the compounds of the source language are decomposed into the words of which they consist. For these words the associated translations into the target language are read from the memory. The translations are then compounded following standard translation rules. For this purpose, translation peculiarities of compounds are taken into account by the transfer code. The invention eliminates storing compounds in the memory of the computer system. Instead, only the individual words of which the compounds consist are stored. This greatly reduces the memory space required for storing all the words of a source language and simultaneously increases the processing speed of the text translation system.
Inventors
- 👤 Ulrike Rackow
- 👤 Ulrike Schwall
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 13:13
CPC Classifications
G; G06; G06F; G06F40/00; G06F40/20; G06F40/268; G06F40/40; G06F40/42; G06F40/47; G06F40/55
Claims Analysis
Total Claims: 19
Claim 1
Independent Claim
103 words
A computer implemented method for translating an unhyphenated compound word from a source language to a target language, said method comprising the steps of: storing in a memory a multiplicity of constituent words in the source language and translations of said constituent words into the target language; comparing the constituent words in memory to a plurality of different beginning segments of the compound word and identifying one of said constituent words which matches one of said segments; fetching from said memory and combining translations of said one constituent word and another constituent word that follows said one constituent word in said compound word.
Claim 2
Dependent Claim
103 words
A computer implemented method for translating an unhyphenated compound word from a source language to a target language, said method comprising the steps of: storing in a memory a multiplicity of constituent words in the source language and translations of said constituent words into the target language; comparing the constituent words in memory to a plurality of different beginning segments of the compound word and identifying one of said constituent words which matches one of said segments; fetching from said memory and combining translations of said one constituent word and another constituent word that follows said one constituent word in said compound word.
Claim 3
Dependent Claim
58 words
A method as set forth in claim 1 further comprising the steps of: storing in said memory an indication of which letter(s) are added to or deleted from a constituent word when the constituent word is combined with another constituent word in the compound word; and using said indication to determine which constituent words constitute the compound word.
Claim 4
Dependent Claim
81 words
A method as set forth in claim 1 further comprising the steps of: storing in said memory indications of appropriate grammatical forms for the translations of the constituent words based on a position of each of said constituent words relative to another constituent word of the same compound word or based on a grammatical form of this other constituent word of the same compound word; and using said indications to determine the translations of the constituent words of the compound word.
Claim 5
Dependent Claim
63 words
A method as set forth in claim 1 further comprising the steps of: storing in said memory indications of appropriate grammatical forms for the translation of constituent words based on a grammatical form of all of the constituent words in the compound word in the source language; and using said indications to determine the translations of the constituent words of the compound word.
Claim 6
Dependent Claim
74 words
A method as set forth in claim 4 further comprising the steps of: storing in said memory an indication that when the grammatical form of two successive constituent words of a compound word of a German source language are verb and noun, respectively then the grammatical form for the translations of the two successive constituent words is noun and noun, respectively; and using said indication to determine the translations of the two constituent words.
Claim 7
Dependent Claim
68 words
A method as set forth in claim 1 further comprising the steps of: storing in said memory more than one translation for the same constituent word; storing in said memory an indication of which translation for the same constituent word is appropriate based on a semantic type of another constituent word of the same compound word; and using said indication to determine the translation of the compound word.
Claim 8
Dependent Claim
104 words
A computer system for translating an unhyphenated compound word from a source language to a target language, said system comprising: memory means for storing a multiplicity of constituent words in said source language, and translations of said constituent words into said target language; means for comparing the constituent words in memory to a plurality of different beginning segments of the compound word and identifying one of said constituent words which matches one of said segments; and means for fetching from said memory and combining translations of said one constituent word and another constituent word which follows said one constituent word in said compound word.
Claim 9
Dependent Claim
104 words
A computer system for translating an unhyphenated compound word from a source language to a target language, said system comprising: memory means for storing a multiplicity of constituent words in said source language, and translations of said constituent words into said target language; means for comparing the constituent words in memory to a plurality of different beginning segments of the compound word and identifying one of said constituent words which matches one of said segments; and means for fetching from said memory and combining translations of said one constituent word and another constituent word which follows said one constituent word in said compound word.
Claim 10
Dependent Claim
29 words
A method as set forth in claim 1 wherein said plurality of different beginning segments comprise a beginning segment of n letters and a beginning segment of n+1 letters.
Claim 11
Dependent Claim
55 words
A method as set forth in claim 1 wherein said plurality of different beginning segments are selected by first selecting a beginning segment of n letters, then selecting a beginning segment of n+1 letter and then selecting a beginning segment of n+2 letters, etc. until one of said constituent words matches one of said segments.
Claim 12
Dependent Claim
21 words
A method as set forth in claim 1 wherein said storing, comparing, fetching and combining steps are performed by a computer.
Claim 13
Dependent Claim
102 words
A computer implemented method for translating compound words from a source language to a target language, said method comprising the steps of: storing in a memory a multiplicity of constituent words in the source language, an indication of which letter(s) are added to or deleted from a constituent word when the constituent word is combined with another constituent word in the compound word, and translations of said constituent words into the target language; using said indication, identifying from the memory the constituent words that correspond to the compound word; and fetching from said memory and combining the translations of said constituent words.
Claim 14
Dependent Claim
102 words
A computer implemented method for translating compound words from a source language to a target language, said method comprising the steps of: storing in a memory a multiplicity of constituent words in the source language, an indication of which letter(s) are added to or deleted from a constituent word when the constituent word is combined with another constituent word in the compound word, and translations of said constituent words into the target language; using said indication, identifying from the memory the constituent words that correspond to the compound word; and fetching from said memory and combining the translations of said constituent words.
Claim 15
Dependent Claim
118 words
A computer implemented method for translating compound words from a source language to a target language, said method comprising the steps of: storing in a memory a multiplicity of constituent words in the source language, translations of said constituent words into the target language, and information that when the grammatical form of two successive constituent words of a compound word of a German source language are verb and noun, respectively, then the grammatical form for the translations of the two successive constituent words is noun and noun, respectively; identifying from said memory a plurality of constituent words which form said compound word; and using said information, determining the proper grammatical form of the translations of said constituent words.
Claim 16
Dependent Claim
118 words
A computer implemented method for translating compound words from a source language to a target language, said method comprising the steps of: storing in a memory a multiplicity of constituent words in the source language, translations of said constituent words into the target language, and information that when the grammatical form of two successive constituent words of a compound word of a German source language are verb and noun, respectively, then the grammatical form for the translations of the two successive constituent words is noun and noun, respectively; identifying from said memory a plurality of constituent words which form said compound word; and using said information, determining the proper grammatical form of the translations of said constituent words.
Claim 17
Dependent Claim
124 words
A computer implemented method for translating compound words from a source language to a target language, said method comprising the steps of: storing in a memory a multiplicity of constituent words in the source language, translations of said constituent words into the target language, said translations including more than one translation for the same constituent word, and an indication which translation for the same constituent word is appropriate based on a semantic type of another constituent word of the same compound word; and identifying from said memory a plurality of constituent words which form said compound word, said plurality including the constituent word which has two translations; and using said indication to determine the proper translation for the constituent word which has two translations.
Claim 18
Dependent Claim
124 words
A computer implemented method for translating compound words from a source language to a target language, said method comprising the steps of: storing in a memory a multiplicity of constituent words in the source language, translations of said constituent words into the target language, said translations including more than one translation for the same constituent word, and an indication which translation for the same constituent word is appropriate based on a semantic type of another constituent word of the same compound word; and identifying from said memory a plurality of constituent words which form said compound word, said plurality including the constituent word which has two translations; and using said indication to determine the proper translation for the constituent word which has two translations.
Claim 19
Dependent Claim
16 words
A method as set forth in claim 13 wherein one of said semantic types is physical.
References Cited (Backward Citations)
US4672571A
Cited
EP0281742A2
Cited
US4777617A
Cited
US4873634A
Cited
US5029084A
Cited
EP0398513A2
Cited
US5065318A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-10-17 | 1998-04-18 | 1998-10-18 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-10-17 | 2002-04-18 | 2002-10-18 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-10-17 | 2006-04-18 | 2006-10-18 | $7700.00 | Window Closed / Lapsed |