_
USOO5359514A
,.
United States Patent [19]
[11] Patent Number:
Manthuruthil et al.
[45]
[54]
5,283,737 2/1994 Van Praag ................... .. 364/419.14
METHOD AND APPARATUS FOR
Date of Patent:
g?f?tnm?gjj‘fHCPE1§TP§EHENSI°N OF
.
.
[75] Inventors‘
9
Newsbytes News Network; “Japanese Ministry’s Multi
—Language Translation Sys”; Dec. 17, 1992; Tokyo,
3
N. Reddy, Colleyville, all of Tex.
[73] Assignee:
Oct. 25, 1994
OTHER PUBLICATIONS
.
gqi'lgPilllari
'
5,359,514
Japan- Abstract‘
International Business Machines
Prim”? Exami"er_]_3°nald E‘ McElheny’ Jr‘
Corporation, Armonk’ N_Y_
Attorney, Agent, or F1rm—A. Bruce Clay
[21] Appl. No.: 101,606
[57]
[22] Filed:
Tiheéaresent
ingention izinproves the comprehenlsébiiity
o a ocument eing rea onacomputer system. at er
[2;]
Aug 3, 1993
clcis """"""""""""""
£58} F.‘ 1h
1e
4159/
""" """""" "
0
than requiring a reader to stop and look up the meaning
3642415 11 419 '13
of a word, either on-line or with a printed copy, the
can """""""""" " 364/41 141 41g; 19’
present invention will automatically translate unknown
'
[56]
ABSTRACT
’
’
words into words known to the reader. By checking
References Cited
each word in a document against a known word list
U_S_ PATENT DOCUMENTS
maintained on the computer, the present invention im
4384 329 5/1983 Rosenbaum et a]
364/41913
4:456:973 6/1984 Carlgren et al. ..:..'.'.-.:-.'.-.....-. 364/4l9i13
4,773,039.
9/1988
proves the readers comprehension of a document as
Well as simph?es the reading there“ '
Zamora .................... ,. 364/419.l4
5,256,067 10/1993 Gildea et al. ................. .. 364/4l9.01
4 Claims, 5 Drawing Sheets
PROCESS BTF_WORD
78
PRINT WORD
HIGHLIGHTED
x140
l
SET AT LEAST ONE
SYNONYM FLAG = N
r142
l
READ SYNONYM SET
FOR THE WORD
162
nus WORD m
\
PVF_FILE?
r144
SET AT LEAST our
SYNONYM FLAG TO 'Y‘
CREATE A
RECORD ‘N
;
PRINT SYNONYM TO
YES
PVF FILE
BDF_FIl_-E2
/
'—>
INCREMENT NUMBER
or OCCURRENCES \164
SET TSLO = o
154
I
-
US. Patent
Oct. 25, 1994
Sheet 1 of 5
.1
3
on
5,359,514
US. Patent
Oct. 25, 1994
FIG. 2
INPUT
DOCUMENT
(BDF__FILE 1)
Sheet 2 of 5
OUTPUT
DOCUMENT
COMPREHENSION
MODULE
BDF__FILE2
gym,
READ INPUT DOCUMENT /52
I
FIG. 3
PARSE DOCUMENT
I
OBTAIN WORDS IN
DOCUMENT
I
READ COMP_NO
./ 56
/58
I
READ COMP_TSLO
PRINT WORD TO
BDF_FILE2
THIS WORD
IN WP?
PROCESS
PVF_WORD
76
IS
THIS IN
BTF?
PROCESS
BTF_WORD
HIGHLIGHT THE WORD
AND PRINT TO
BDF_FILE2
5,359,514
\.
80
US. Patent
Oct. 25, 1994
Sheet 3 of 5
FI G .
5,359,514
4
PROCESS.
PVF_WORD
,74
88
\
PRINT WORD WITH
NO HIGHLIGHTING
' TO BDF_F]LE2
SET KNOWN
FLAG = "N"
\90
J,
NUMBER OF
OCCURRENCES = 0 \92
TSLO = 0
PROCESS
BTF__WORD \96
HIGHLIGHT AND
PRINT TO
BDF_F[LE2
\98
US. Patent
Oct. 25, 1994
Sheet 4 of 5
5,359,514
FROM FIG. 4
102
COMP_TSLO
SET KNOWN_WORD _,~1()6
FLAG TO "Y"
%
NUMBER OF
OCCURRENCES
PROCESS
lS INCREMENTED
BTF_WORD
;
/
114
DELETE WORD
116/ FROM PVF FILE
PRINT WORD WITH
NO HIGHLIGHTING “110
&
HIGHLIGHT
AND PRINT
118“
FROM FIG. 5
@120
§ /
SET NUMBER OF
OCCURRENCES = 0
SET TSLO = 0
6
DELETE WORD
FROM PVF FILE \128
PROCESS BTF_WORD
/
126
4,
PRINT WORD WITH
HlGHLIGHTlNG \130
$132
r108
US. Patent
Oct. 25, 1994
Sheet 5 of 5
5,359,514
PROCESS BTF_WORD /78
T
PRINT WORD
HIGHLIGHTED
x140
J,
SET AT LEAST ONE
/142
SYNONYM FLAG = N
T
READ SYNONYM SET
FOR THE WORD
r144
146
MORE
SYNONYMS TO
PROCESS?
GET NEXT SYNONYM
156
KNOWN
SYNONYM FLAG
SET TO "Y"?
SYNONYM lN
PVF FILE?
152
/
162
THIS WORD IN
SET AT LEAST ONE
SYNONYM FLAG To "Y"
\
PVF_FlLE?
T
CREATE A
PRINT SYNONYM To
RECORD 1“
BDF_FILE2
PVF FILE
/
154
I
INCREMENT NUMBER
OF OCCURRENCES \154
SET TSLO = 0
FIG. 7
1
5,359,514
2
10 and 32, each of which preferably includes a plurality
of individual computers 12 and 30, respectively. Of
METHOD AND APPARATUS FOR FACILITATING
COMPREHENSION OF ON-LINE DOCUMENTS
course, those skilled in the art will appreciate that a
plurality of Intelligent Workstations (IWS) coupled to a
TECHNICAL FIELD OF THE INVENTION
This invention relates in general to computer soft
ware, and in particular to a method and apparatus for
facilitating comprehension of on-line documents.
BACKGROUND OF THE INVENTION
With the advent of computer on-line access to remote
databases such as libraries, as well as the use of comput
ers to review documents, it has frequently been neces
sary to resort to a dictionary and/or thesaurus to under
stand the material. Anytime it is necessary to refer to
either an on-line reference or a printed reference to
understand the meaning of words, the effort becomes
tedious. Thus, if material being read is considerably
above the reading level of the user, comprehension may
5
host processor may be utilized for each such network.
As is common in such data processing systems, each
individual computer may be coupled to a storage device
14 and/or a printer/output device 16.
The data processing system 8 may also include multi
ple mainframe computers, such as mainframe computer
18, which may be preferably coupled to LAN 10 by
means of communications link 22. The mainframe com
puter 18 may also be coupled to a storage device 20
which may serve as remote storage for LAN 10. Simi
larly, LAN 10 may be coupled via communications link
24 through a subsystem control unit/communications
suffer considerably. Thus, there is a need for a better
controller 26 and communications link 34 to a gateway
server 28. Gateway server 28 is preferably an individual
computer or IWS which serves to link LAN 32 to LAN
10.
mechanism to allow a reader to understand a document
which demands above average and/or uncommon vo
documents or resource objects may be stored within
cabulary without losing continuity.
With respect to LAN 32 and LAN 10, a plurality of
storage device 20 and controlled by mainframe com
puter 18, as resource manager or library service for the
SUMMARY OF THE INVENTION
25
resource objects thus stored. Of course, those skilled in
The present invention provides a method and appara
the art will appreciate that mainframe computer 18 may
tus for facilitating comprehension of an on-line docu
be located a great geographic distance from LAN 10
ment in a fashion which substantially reduces or elimi
and, similarly, LAN 10 may be located a substantial
nates the problems in the prior art. The present inven
distance from LAN 32. For example, LAN 32 may be
tion allows a computer system to automatically provide 30
located in California, while LAN 10 may be located
words that are known to the reader.
within Texas, and mainframe computer 18 may be lo
cated in New York.
tion, a method is provided for improving the compre
Referring to FIG. 2, a ?owchart indicates the overall
hensibility of a document on a computer system. All
concept of the present invention. At block 40, a docu
words in the document are checkedto identify a list of
ment Is input to a computer system creating a Business
unknown words. The unknown Words are determined
Document File (BDF_.FILEI). At block 42, the docu
by comparing all words to a list of known words main
ment
is processed through a comprehension module
tained on the computer system. The unknown words
signifying the present invention. In summary, the pres
are then supplemented with synonyms which are
known to the reader. The document is displayed to the 40 ent invention reviews the input document, parses the
document, eliminates stem words (i.e., the, a, and, etc.),
reader with the unknown words and the synonyms.
checks the vocabulary ?les included in the present in
It is a technical advantage of the present invention in
In accordance with one aspect of the present inven
that it is no longer necessary to utilize either a hard
copy dictionary/thesaurus or an on-line dictionary/
vention, and translates any words not known to the
user. After completing the translation process in the
thesaurus to look up unknown words. The reader of a 45 comprehension module of block 42, the document input
at block 40 is output as a Business Document File with
document is presented with a translation already done
obviating the necessity to constantly revert back and
translation (BDF_.FILE2). Thus, by utilizing the pres
forth from the document to a reference.
ent invention, a user would be able to read a document
with all words therein translated into words known and
BRIEF DESCRIPTION OF THE DRAWINGS
For a more complete understanding of the present
invention and the advantages thereof, reference is now
made to the Detailed Description taken in conjunction
with the attached Drawings, in which:
50 understood by the user without the necessity to look up
meanings of words in dictionaries.
In order to properly utilize the present invention, it is
necessary to install two databases onto the computer
system in which the present invention is used. The ?rst
FIG. 1 is a schematic illustration of a data processing 55 database is a Business Thesaurus File (BTF). The BTF
is a complete repository of terms for a speci?c business
system in accordance with the present invention;
the user is interested in. Each entry in the BTF com
FIG. 2 is a diagram illustrating the broad concept of
prises a word and a set of synonyms associated with
the present invention; and
each word.
FIGS. 3, 4, 5, 6, and 7 are ?owcharts illustrating the
In addition, it is necessary to use a Personal Vocabu
present invention.
DETAILED DESCRIPTION OF THE
lary File database (PVF). The PVF is a repository of
words that are known to or encountered by a user. The
INVENTION
PVF ?le can be managed as a text ?le which allows
manual entering and/or deletion of words. The PVF
Referring to FIG. 1, there is depicted a graphical
representation of a data processing system 8, which may 65 ?le can be initialized in several ways. Entries may be
be utilized to implement the present invention. As may
made manually into the PVF ?le either using a simple
be seen, data processing system 8 may include a plural
electronic editor/word processing software or by pro
viding an interaction panel which allows the direct
ity of networks, such as Local Area Networks (LAN)
3
5,359,514
entry of data. Alternatively, a standard business data
base of the correct pro?ciency level can be used to
initialize the PVF ?le. For example, a vocabulary data
base re?ecting a tenth grade level of pro?ciency can be
used to initialize the PVF ?le. Another alternative
would be to allow all words encountered for a prede
?ned period to be entered into the PVF ?le and then
appropriate adjustments could be made.
Referring to FIGS. 3, 4, 5, 6, and 7, ?owcharts illus
trating the present invention are shown. Referring ?rst
4
scribed at decision block 86. If it is determined at deci
sion block 86 that the TSLO is not greater than or equal
to the COMP_TSLO, the word is printed without
highlighting to the BDF_FILE2 at block 88. If it is
determined at decision block 86 that the TSLO is
greater than or equal to the COMP_TSLO, a known
word flag is set equal to N (for no) at block 90. By
setting the known flag equal to N at block 90, the word
is now indicated to be a new word not known to the
‘ user. At block 92, a number of occurrences for this
to FIG. 3, the present invention starts at 50 followed by
word Is set equal to zero (i.e., treated as a new occur
reading of the input document at block 52. The input
rence).
At decision block 94, it is then determined whether or
not this word is in the BTF_FILE. If the response to
decision block 94 is yes, the word is processed as a
invention, i.e., the present invention goes through each
BTF_WORD as will be discussed in greater detail in
word in the input document one at a time. At block 58,
reference to FIG. 7. If the response to decision block 94
a COMP_NO and at block 60 a COMP_TSLO param
is no, the word is highlighted (to indicate an unknown
eters are read. These parameters are set optionally by a
user of the system and are used to set guidelines. In
word) and printed to the BDF_FILE2 at block 98.
particular, the COMP_NO is used to tell the present 20 Subsequent to block 88, block 96, or block 98 the pres
ent invention returns to decision block 62 of FIG. 3.
invention how many occurrences of a particular word
Referring to FIG. 5, connector A from the no branch
are required before it is assumed that the user under
of decision block 82 in FIG. 4 is described in greater
stands the meaning thereof. The COMP_TSLO is used
document is then parsed at block 54. At block 56, the
words in the document are obtained by the present
to indicate (using a prede?ned period of time) how
detail. At decision block 102, it is determined whether
much time since the last occurrence of a word has oc 25 the TSLO ?eld of the PVF ?le is less than the COM
P_TSLO. If the response to decision block 102 is no,
curred. Thus, if a user has not seen a particular word in
a period of time greater than the parameter set for
COMP_TSLO it will be assumed that the user no
longer remembers the meaning of the word.
the present invention proceeds to connector B which
will be discussed in greater detail in reference to FIG. 6.
If the response to decision block 102 is yes, it is deter
It is then determined at decision block 62 whether or 30 mined at decision block 104 whether or not the number
of occurrences ?eld of the PVF ?le is less than the
not the last word in the document has been reached. If
COMP_NO parameter. If the response to decision
the response to decision block 62 is yes, the end of job
is indicated at block 64. If the response to decision block
block 104 is no, the known word ?ag is set to Y (indicat
ing that the word has met the COMP_TSLO and
62 is no, the next word is read at block 66.
At decision block 68, it is determined whether or not 35 COMP_NO parameters as set by the user). At block
108, the number of occurrences ?eld of the PVF ?le is
the next word is a stem word (i.e., a, an, and, the, etc. ).
incremented to indicate this occurrence. At block 110,
If the response to decision block 68 is yes, the word is
the word is printed with no highlighting.
printed to a BDF_FILE2 (i.e., the Business Document
File which will be presented to the user for reading
Returning to decision block 104, if the response
thereto is yes, it is determined at decision block 112
upon completion of all translations. If the response to
whether or not the word is in the BTF ?le. If the re
decision block 68 is no, it is determined at decision
sponse to decision block 112 is yes, at block 114 the
block 72 whether or not the word is in the PVF (i.e., is
word is processed as a BTF_WORD as will be dis
this a word that the user knows). If the response to
cussed with reference to FIG. 7. If the response to
decision block 72 is yes, the word is processed as a
PVF_WORD (i.e., the known word is processed to 45 decision block 112 is no, the word is deleted from the
include appropriate flag encounter settings).
PVF ?le at block 116 followed by highlighting and
printing the word at block 118. Subsequent to block
If the response to decision block 72 is no, it is deter
mined at decision block 76 whether or not the word is
110, block 114, or block 118 the present invention re
turns at 120 to decision block 62 of FIG. 3.
in the BTF. If the response to decision block 76 is yes,
Referring to FIG. 6, the connector B from the no
at block 78 the word is processed as a BTF_WORD 50
branch of decision block 102 in FIG. 5 is further dis
(i.e. the word is considered to be beyond the level of the
user and synonyms are therefore presented). If the re
cussed. At block 122, the number of occurrences ?eld of
the PVF ?le and the TSLO ?eld are both set equal to
sponse to decision block 76 is no, the word is considered
zero. It is then determined at decision block 124
to be unknown and is highlighted and printed to the
whether or not the word is in the BTF ?le. If the re
BDF__FILE2 for display upon completion of transla
sponse thereto is yes, the word is processed as a BTF
tion at block 80. Subsequent to block 70, block 74, block
word as will be subsequently described with reference
78 or block 80, the present invention returns to decision
block 62 as previously described above.
to FIG. 7. If the response to decision block 124 is no, the
word is deleted from the PVF ?le at block 128. The
Referring to FIG. 4, process PVF_WORD as shown
word is then printed with highlighting at block 130.
in block 74 of FIG. 3 is described in greater detail. At
decision block 82, it is determined whether or not the
Subsequent to block 126 or block 130, the present in
vention returns at 132 to decision block 62 of FIG. 3.
word is known to the user. If the response to decision
Referring to FIG. 7, the process BTF_WORD block
block 82 is no, the present invention proceeds to con
nector A as will be discussed in greater detail with FIG.
78 of FIG. 3 is discussed in greater detail. At block 140,
5. If the response to decision block 82 is yes, the PVF 65 the word is printed highlighted. At block 142, a syn
onym ?ag ?eld for at least one synonym of the word is
?le has a TSLO ( Time Since Last Occurrence) ?eld
updated at block 84. This TSLO ?eld is then compared
set to “N” (no). A set of synonyms is then read for the
word at block 144. At decision block 146 it is deter
to the COMP_TSLO parameter as previously de
5,359,514
5
6
mined whether or not there are more synonyms for the
their husbands to linger {TARRY} about their vil
word to be processed. If the response to decision block
[age tavern on market days . . . ”.
14615 Yes, the next Synonym is Obtained at block 148~ It
As a result of the translation process, the PVF ?le as
is then determined at decision block
whether 01' not
shown above
be modi?ed as follows;
the synonym is in the PVF ?le. If the response to deci~ 5
sion block 150 is no, the present invention returns to
decision block 146. If the response to decision block 150
Word
The
Known
Number of
is yes, at least one synonym flag ?eld is set to “Y” (yes)
#
w°'d
WW1?
TSLO
occmences
at block 152. The synonym is then printed to the
1
properly
Y
0
l
BDF_FILE2 at block 154 followed by a return to 10
2
known
Y
g
g
0
1
Returning to decision block 146, if the response
5
in
Y
0
1
thereto is no, it is determined at decision block 156
whether or not a known synonym ?eld ?ag is set to “Y”
(yes). If the response to decision block 156 is no, the 15
6
7
8
former
day
g°°d ‘
Y
Y
Y
0
0
0
1
1
1
decision block 146.
Z
present invention returns at 158 to decision block 62 of
.
.
.
.
.
FIG. 3. If the response to decision 156 is yes, it is determined at decision block 160 whether or not this word is
18
hwsewfe
11
12
husband
village
Y
country
%
0
Y
1
0
Y
Y
1
0
0
1
1
in the PVFJILE. If the response to decision block
13
market
Y
0
1
160 is no, a record of the word is created in the PVF ?le 20
i‘;
fiat“
Y
8
1
at block 162. If the response to decision block 160 is yes
16
mg
Y
0
1
or subsequent to block 162, the number of occurrences
?eld is incremented and the TSLO ?eld is set to zero at
block 164. The present invention then returns at 158 to
decision block 62 of FIG. 3.
25
17
18
19
1°
romantics
always
fall
love
Y
Y
Y
Y
0
0
0
0
0
0
0
0
As an example’ at startup of January 1 ’ 1993 ’ assume
the COMP__TSLO parameter is set equal to twelve
months and the COMP_NO parameter is set equal to
two by a user of the present invention. The user’s Per-
21
22
23
Y
Y
y
Y
N
0
0
0
24
25
cax-ldy
child
guest
last
imam?
0
O
0
0
0
1
is
fTmpenmy
mger
N
N
00
11
sonal Vocabulary File (PVF) is as follows:
Wild
and
or
1
PmPe?Y
2
‘mm
3
4
name
given
TSLO
or ‘
30
81111111161’ °f
0
0
Y
°
°
Y
Y
Continuing the above example, on Mar. 1, 1993, the
ccmmces
Y
o
0
0
0
0
following passages are input:
“ . . . Inveterate romantics are always falling in love.”
35
“
Th 1 r
r 1'
d
til 2
”
. . .
e as gues s mgere un
am.
“ . . . Children have a propensity for candy.”
5
tell
Y
0
0
g
at)?"
g
g
g
8
good
Y
O
0
9
housewife
Y
0
0
“ . . . The last guests lingered {TARRIED} until 2
10
country
Y
0
0
30m.”
1;
1351??
g
g
g
“ . . . Children have a propensity {LIKING} for
13
market
Y
o
0
14
habitual
Y
0
0
15
liking
17
18
16
Y
Y
0
0
0
romantics
al
Y
Y
0
0
0
O
As a result of translation, the following is output:
“ . . . Inveterate {HABITUAL} romantics are always
4O
in love.”
Candy”
45
As a result of the above translation, the PVF ?le is
~
0
.
modified as follows.
19
fan/gays
Y
0
0
Word
20
21
22
love
candy
Child
Y
Y
Y
Q
O
0
0
0
0
#
l
2
23
24
guest
last
Y
Y
0
0
O
0
50
The
Known
Word
properly
known
Word?
Y
Y
TSLO
2
2
Occurrences
l
1
Number of
3
4
name
given
Y
Y
2
2
1
1
Note: Multiple occurrences of the same word in the same document are treated as
5
tell
Y
2
l
a single occurrence for record keeping purposes.
6
former
Y
2
1
7
day
Y
2
l
€°°d T
Y
i
i
husband
Y
Y
2
2
1
1
55
The following indicates a portion of a passage input
3
on the startup date as a BDF_.FILE:
“ . . . properly known by the name of Tarry Town.
l0
11
The name was given, we are told, in the former days,
12
village
Y
2
l
by the good housewives of the country, by the invet- 60
13
mm
Y
2
1
erate propensity
of their
husbands to linger
about
l4
15
habitual
liking
Y
Y
22
11
their village tavern on market days . . . ”.
16
tarry
Y
2
1
17
18
romantics
always
Y
Y
0
0
1
1
After being translated by the present invention, the
following passage would be output:
6
“ . . . properly known by the name of Tarry Town. 65
is
{311
Y
g
i
The name was given, we are told, in the former days,
by the good housewives of the country, from the
inveterate {HABITUAL} propensity {LIKING} of
21
22
23
(gay
child
guest
Y
Y
Y
O
0
0
1
1
1
5,359,514
7
8
-continued
Word
#
The
Word
24
25
last
inveterate
propensity
linger
26
27
_
-continued
Known
Word?
TSLO
Number of
Occurrences
Y
N
0
0
1
2
N
N
0
0
2
2
5
_
Continuing the above example, on Apr. 1, 1993, the 10
following passage is input:
Word
#
The
Word
Known
Word?
TSLO
Number of
Occurrences
2
3
4
5
6
known
name
Y
Y
14
14
0
0
given
tell
former
Y
Y
Y
14
14
14
0
0
0
7
day
Y
14
0
3
9
good_
housewife
Y
Y
14
14
0
0
“ . . . properly known by the name of Tarry Town.
{(1)
?wsmé
:
:1
8
The name was given, we are told, in the former days,
12
V31‘;
Y
14
o
by the good housewives of the country, by the inveterate propensity of their husbands to linger about 15
13
14
market
habitual
Y
Y
14
14
0
0
their village tavern on market days . . . ”.
15
liking
Y
14
0
:3
mimics
g
104
g
18
always
Y
o
O
After translation, this passage is printed as:
“. . . properly known by the name of Tarry Town.
The name was given, we are told, 1n the former days,
19
fall
Y
0
0
by the good housewives of the country, by the invet- 20
20
love
Y
0
0
14
14
14
erate propenslty
'
' h us b an d s to 1'lnger ab out
o f t h e11‘
21
22
candy
child
Y
Y
their village tavern on market days . . . ”, i.e., no
change 15 made to the text.
23
24
guest
last
Y
Y
As a result of this passage’s input, the PVF ?le be-
25
inveterate
N
0
1
26
27
propensity
linger
N
N
14
14
0
0
comes:
25
W3“
35rd
I323?
TSLO
(1:313:23;
'
14
°0
0
0
Thus, as can be seen from the above PVF ?le, as a result
2
of the passage of time being greater than the COMP_T
;
2:335:11)’
¥
8
2
30 SLO parameter, the words in the passage which were
3
4
name
given
Y
Y
0
0
2
2
previously considered known had once again become
unknown to the user. The words were therefore trans
:
if?"
3
g
;
lated as before and the appropriate adjustments made to
7
d‘fym"
Y
o
2
3
9
good
housewife
Y
Y
0
0
2
2
the PVF ?le.
35
As a result of the present invention, a user is provided
with a constantly updated Personal Vocabulary File
1?
lclwgtrzl
z
8
i
which will allow the translation of words not known to
12
13
V31;
market
Y
Y
o
o
2
2
the user into words that are known to the user. This will
provide the user with greater ease in reading and under
14
habitual
Y
1
2
40 standing documents presented for review. The present
15
“mg
Y
2
invention eliminates or reatl reduces the need for the
1-,
romantics
12
19
always
fall
16
tarry
Y
1
Y
0
0
2
1
use of elther an on-lme dlctionary/thesaurus or a
Y
Y
0
0
1
1
printed hard copy thereof.
Although the present invention has been particularly
5(1)
Lizzy
3
g
%
22
23
24
child
guest
last
Y
Y
Y
0
0
0
1
1
1
25
inveterate
Y
0
3
is
iJ-mpensity
3
g
2
inger
.
g
y .
45 shown and described with reference to a preferred em
bodiment, it will be understood by those skilled in the
art0 that various - changes in form and detail may be made
wlthout departmg from the spirit and the scope of the
invention
50 What is claimed is
-
1. A computer implemented method of teaching a
.
.
.
speci?c individual reader and automatically improving
Thus’ It can be seen that Smce the words I? the passage
comprehensibility of a document on a computer system
as input meet the system parameters, there is no need for
for that reader Com risin the Ste 5 of,
translation as the words are assumed to be known by the
.
b ’.
ph g
?l p.
'
d .
user
55
storing ablusbmesls1 t esaurus e in a storage evice
'
.
.
access1
Conimumg the zibcfve example’ on Jun‘ 1’ 1994’ the
followmg passage 1s input;
A
“ . . . I
eterat
rom
e
y t e computer system;
storing a list of reader identi?ed known words in said
Storage device.
‘
'
'
31v f e 1 .annclsl are alwayifaumg love
.”
8 a res t O trans anon’ t e passage eC-Omes'
.
.
’
.
.
assoclatlng reader de?ned parameters with send
60
known words in order to ensure said known words
“ . . . Inveterate {HABITUAL} romantlcs are always
falling in love),
are currently known to the reader‘;
As a result of this translation, the PVF ?le has be-
autgnslzitcllczllilgggnkgags?gwaggzotfiézngg‘1311;111:511:
come:
words;
65
Word
#
l
The
Word
properly
Known
Word?
TSLO
Number of
Occurrences
Y
14
O
automatically accessing said business thesaurus ?le to
obtain a synonym for each of said unknown words,
said synonym also being on said list of known
words;
5,359,514
10
.
automatically updating said list of known words to
means for associating reader de?ned parameters with
remove words that have become not currently
known and to add words that have become our
rently known in accordance with said reader de
said known words in order to ensure said known
words are currently known to the reader;
means for automatically comparing all words in the
document to said list of known words to identify
?ned parameters; and
automatically displaying the document to the reader
with said synonym displayed adjacent each of said
unknown words;
means for automatically accessing said business the
saurus ?le to obtain a synonym for each of said
unknown words corresponding thereto, wherein
the reader learns a meaning of said unknown words
and the document is automatically more compre 10
hensible to the reader.
2. The computer implemented method of claim 1,
wherein said step of associating comprises the steps of:
words to remove words that have become not
currently known and to add words that have be
come currently known in accordance with said
reader de?ned parameters; and
means for automatically displaying the document to
the reader with said synonym displayed adjacent to
each of said unknown words corresponding
thereto, wherein the reader learns a meaning of
said unknown words and the document is automati
cally more comprehensible to the reader.
4. The computer system of claim 3, wherein said
means for associating comprises:
assigning a ?rst numerical value to said known words
to re?ect how many occurrences of a Word are
required for said word to become a known word;
and
assigning a second numerical value to said known
words to re?ect a period of time of no occurrences
after which a known word becomes an unknown
word.
3. A computer system for teaching a speci?c individ
ual reader and automatically improving comprehensi
bility of a document on the computer system for that 25
reader, comprising:
means for assigning a ?rst numerical value to re?ect
how many occurrences of a word are required for
said word to become a known word; and
means for storing a business thesaurus ?le in a storage
means for assigning a second numerical value to re
?ect a period of time of no occurrences after which
a known word becomes an unknown word.
device accessible by the computer system;
means for storing list of reader identi?ed known
words in said storage device;
unknown words, said synonym also being on said
list of known words;
means for automatically updating said list of known
30
35
45
55
60
65
*
*
*
*
*