← Back to Patent Explorer
EP0566848A2 Expired / Lapsed EP ⏱️ 0.0 years remaining

System for the automated analysis of compound words

Assignee: International Business Machines Corp
•
Filing: 1993-03-08
•
Granted: —
•
Expires: 2013-03-08
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The invention concerns a system for the automated analysis of words composed of several components. Such analyses are required, for example, for text correction or syllabification by means of a computer system. For this purpose, the computer system decomposes the compound word into its components and compares the compound word letter for letter with components stored in its memory. The memory also contains rank orders indicating a component's probability of occurrence in a compound word. If the computer finds a match between a stored component and letters of the compound word, it checks the probability of occurrence of this component within the compound word. By means of this probability information, the computer system decides whether the component is "correct" or "incorrect", i.e. whether the compound word has been correctly or incorrectly decomposed. Further information for verifying the decomposition of a compound word consists of a rank order stored in the memory of the computer system and indicating for each number of letters of a compound word the most probable number of components contained therein. Rank orders of the above-described kind are used by the computer system to decompose a compound into its components quickly and correctly.

Inventors

  • 👤 Lutz Schoenherr

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-11-01 05:32
CPC Classifications
G; G06; G06F; G06F40/00; G06F40/10; G06F40/191; G06F40/20; G06F40/253; G06F40/268; G06F40/279; G06F40/284

Claims Analysis

Total Claims: 15
Claim 1
Independent Claim 52 words
Computer system for the automated analysis of words composed of several components, comprising a memory storing the components of the compound words, characterized in that the memory stores a rank order of particular characteristics of the components, said rank order depending upon the frequency of occurrence of the respective characteristics (Fig. 5).
Claim 2
Dependent Claim 49 words
Computer system as claimed in claim 1, characterized in that the memory stores a rank order of the number of components of a compound word depending upon the number of letters of the compound word to be analyzed, said rank order depending upon the frequency of occurrence (Fig. 1).
Claim 3
Dependent Claim 23 words
Computer system as claimed in claim 1 or 2, characterized in that it is used for text processing, text translation or speech recognition.
Claim 4
Dependent Claim 63 words
Method for the automated analysis of words composed of several components with the aid of a computer system, wherein the components of the compound words are stored in a memory of the computer system, characterized in that a compound word to be analyzed is successively compared with the stored components according to a rank order of particular component characteristics stored in the memory.
Claim 5
Dependent Claim 31 words
Method as claimed in claim 4, characterized in that in the German language the compound word is intially compared with all stored components that are nouns with the connective element "s".
Claim 6
Dependent Claim 24 words
Method as claimed in claim 5, characterized in that the compound word is then compared with all stored components that are nouns occurring unchanged.
Claim 7
Dependent Claim 27 words
Method as claimed in claim 6, characterized in that the compound word is then compared with all stored components that are nouns with the connective element "es".
Claim 8
Dependent Claim 27 words
Method as claimed in claim 7, characterized in that the compound word is then compared with all stored components that are nouns with the connective element "n".
Claim 9
Dependent Claim 25 words
Method as claimed in claim 8, characterized in that the compound word is then compared with all stored components that are verbs in stem form.
Claim 10
Dependent Claim 23 words
Method as claimed in claim 9, characterized in that the compound word is then compared with all stored components that are unchanged adverbs.
Claim 11
Dependent Claim 23 words
Method as claimed in claim 10, characterized in that the compound word is then compared with all stored components that are unchanged adjectives.
Claim 12
Dependent Claim 23 words
Method as claimed in claim 11, characterized in that the compound word is then compared with all stored components that are unchanged prepositions.
Claim 13
Dependent Claim 27 words
Method as claimed in claim 12, characterized in that the compound word is then compared with all stored components that are nouns with the connective element "en".
Claim 14
Dependent Claim 51 words
Method for the automated analysis of words, composed of several components, with the aid of a computer system, characterized in that the letters of a compound word to be analyzed are counted, and that the counted number of letters is associated with a stored number of components of the compound word.
Claim 15
Dependent Claim 33 words
Method as claimed in claim 14, characterized in that according to a rank order depending upon the frequency of occurrence, the counted number of letters is successively associated with different numbers of components.

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag