US3483527A - Efficient justification quality control - Google Patents

Efficient justification quality control Download PDF

Info

Publication number
US3483527A
US3483527A US613611A US3483527DA US3483527A US 3483527 A US3483527 A US 3483527A US 613611 A US613611 A US 613611A US 3483527D A US3483527D A US 3483527DA US 3483527 A US3483527 A US 3483527A
Authority
US
United States
Prior art keywords
text
justification
inter
line
spacing
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime
Application number
US613611A
Other languages
English (en)
Inventor
David W Terry
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
International Business Machines Corp
Original Assignee
International Business Machines Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by International Business Machines Corp filed Critical International Business Machines Corp
Application granted granted Critical
Publication of US3483527A publication Critical patent/US3483527A/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
    • B41B—MACHINES OR ACCESSORIES FOR MAKING, SETTING, OR DISTRIBUTING TYPE; TYPE; PHOTOGRAPHIC OR PHOTOELECTRIC COMPOSING DEVICES
    • B41B27/00—Control, indicating, or safety devices or systems for composing machines of various kinds or types
    • B41B27/28—Control, indicating, or safety devices for individual operations or machine elements
    • B41B27/32—Control, indicating, or safety devices for individual operations or machine elements for line-justification operations
    • B41B27/36—Control, indicating, or safety devices for individual operations or machine elements for line-justification operations using electronic devices
    • B—PERFORMING OPERATIONS; TRANSPORTING
    • B41—PRINTING; LINING MACHINES; TYPEWRITERS; STAMPS
    • B41B—MACHINES OR ACCESSORIES FOR MAKING, SETTING, OR DISTRIBUTING TYPE; TYPE; PHOTOGRAPHIC OR PHOTOELECTRIC COMPOSING DEVICES
    • B41B25/00—Apparatus specially adapted for preparation of record carriers for controlling composing machines
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00—Handling natural language data
    • G06F40/10—Text processing
    • G06F40/189—Automatic justification

Definitions

  • the characters prior to the last word are printed out with inter-word spacing as desired and with enough inter-character spacing to justify the line. If the doubled value is less than the length of the output line, the characters are not printed until a hyphen is inserted in the last word, and the portion including and before the hyphen is included in the output line. This provides an automatic and efficient check on the quality of the justified text while eliminating special controls to limit inter-character spacing amounts.
  • BACKGROUND Justification is the spacing of text so that the printed characters extend to both the left and right margins.
  • the prior art knows many techniques to justify text from records. In this regard many data processing techniques are readily adaptable by those skilled in the art.
  • the justification system use information received from records carrying raw data, that is, data in which line endings are not specified on the. data carried by the record.
  • Preparation of the records by recording on paper tape, magnetic tape, or similar records can then be done at the highest possible speed and with the use of the least possible special skills because. no thought need be given to selecting the location of line endings or of hyphens.
  • text in raw form, properly processed can be ultimately recorded at output line widths not originally known by the operator who prepared the record, and it can be ultimately recorded at more than one line. width.
  • To process raw data many data processing techniques are also readily adaptable by those skilled in the art.
  • Level of quality depends primarily upon the limitation of the maximums of various spacings in the output text while. still maintaining proper grammar, spelling, and justification. Prescribed limitations on spacing vary according to the judgment applied in view of the particular aesthetics desired for the final output, to the economic facts, and to similar factors. For example, it is generally true that greater variation between maximum and minimum interword spacing is considered acceptable in the printing of a newspaper than in the printing of a quality book memorializing a person of worth.
  • a salient feature in accordance with this invention is the elimination of the need to structure the parts to consider special cases.
  • special cases In general, when special cases must be considered, they must be considered in every inter-character operation which initially appears to call for hyphenation in order to achieve adequate justification.
  • Two common special cases, especially in newspaper composing operations, are the one Word sentence and the two word sentence. In both cases adequate quality level usually demands that the lines he justified by inter-character spacing even though the inter-character spacing is greater than that considered permissible in the usual line.
  • Another special case, desirable in many systems, is to automatically determine if an input word was received after the last one considered for justification. Such a word must have been received, of course, if the mechanisms are to achieve justification by hyphenation of that word.
  • a gross check is made which compares available data concerning the text received with the output length requirements. This makes possible an efficient and quick determination that intet character spacing subsequently computed will be within acceptable limits.
  • Usually considerable data concerning the content of a line of text received can be compiled while the line is being received since the record reader or other source of text is quite slow compared to the speed of the devices used to justify.
  • the data operated upon and the computation engaged in need not generally produce an exact determination of intercharacter size, but instead the selections are made to yield accuracy within gross limits and to be relatively efficient and fast. Since the comparisons made do not have critical limits, relatively small values could be added or subtracted to the data and factors used without impairing the basic control of quality level obtained, but this is generally unnecessary and would increase the time and structure required.
  • This number could be readily multiplied, such as by adding it itself or by a three column shift operation on a binary number, to achieve a multiplication by some factor such as eight, and the multiplied result compared with the output line length.
  • the difference between the length of received text and the output line length is generally a factor already computed and could be used instead of the output line length.
  • Inter-character spacing computation would be conducted only when that multiplied number is shown to be at least a certain size relative to the output line length or the related factor. This test is not precisely related to the exact inter-character spacing. since the width of each character in the received line is not precisely considered. However the results are within limits which would adequately control the quality of final copy.
  • a computation is made which requires for the multiplication step only the single addition of one number to itself.
  • the minimum width of a line of text entered into the justification means is accumulated up to a grammatically acceptable line ending.
  • the value of that length Prior to production of the output on the basis of the text received. the value of that length is doubled by adding it to itself once and then compared with a pre-establishcd value equal to the the total length to be occupied by the output line. If the comparison shows the minimum length to be about half as large as the output line length, then justification of that line of text up to the grammatically acceptable line ending is permitted.
  • Inter-character spacing is not limited and normally may be as great as the justification computations require, although some nonessential structural limitation in the machine may prevent exceptionally large inter-character spacing. If comparison shows the minimum width to be too small, part of the next word of text is used with a hyphen inserted in that word as required.
  • the output recorded in justified form may be printed for immediate use or stored as codes on a paper tape or similar memory.
  • the drawing is a symbolical and illustrative diagram of the preferred system in accordance with this invention.
  • the record carrying raw data may be prepared as a sequence of codes on a magnetic tape recorded by special typewriters available for this purpose or the record may be prepared by any suitable means.
  • the record tape 1 is then read by reader 3 under the control of justification computer 5.
  • Reader 3 preferably takes the form described in US. patent application Ser. No. 579,355, filed Sept. 14, 1966, entitled Record Reader With Controls, by Parker R. Blevins, Roderick S. Heard, and Louis M. Hornung, and assigned to the assignee of the present invention.
  • the justification computer 5 accumulates the weighted width values of each received character and, when a line ending condition is detected as will be described below, computes the inter-word and inter-character spacing necessary to produce a justified line of data characters.
  • the justification computer 5 can take the form of a general purpose computer programmed in a well known manner to calculate the necessary spacing or the form of a special typography computer operable in a well known manner to accept unjustified tapes and generate justified tape.
  • a control counter such as that described in US. patent application Ser. No. 578,791, filed Sept. 12, 1966, entitled Electronic Counter, by Louis Hornung, and assigned to the assignee of the present 1nvention may be utilized in a well known manner to control the sequencing of the operations performed by the justification computer and the operations performed by the remaining units of FIGURE 1.
  • the counter functions as a state counter which is advanced or permuted to a different unique state upon the completion of each operation.
  • the counter thereafter controls the operations to be performed.
  • the utilization of a state counter to control the sequencing of computational operations is well known in the art and need not be described in detail, it being kept in mind that in the following description each pulse or signal which is supplied upon the termination of an operation causes the state counter to change to a state that will initiate the next operation described.
  • the minimum length of each character of text supplied to the justification computer 5 is simply the horizontal width actually to be occupied to display that character when that character is ultimately displayed. In the preferred embodiment, in the case of symbols as distinguished from spaces, this varies between three units for a period and other smallest symbols to nine units for the letter M and other largest symbols.
  • the accumulator register 7 can be of any of the types well known in the data processing arts, examples of which may be found on pages 101 through 112 of Arithmetic Operations and Digital Computers" by R. K. Richards, copyright 1955 by D. Van Nostrand Company, Inc.
  • An input key 9 operative to pie-establish in computer 5 the minimum inter-word space desired in a given justification operation.
  • inp'ut key 9 may be manually adjusted to, for example, preestablish a value of four units for one justification operation and to pre-establish a value of five units for justification of a ditferent manuscript.
  • total input line length register 7 is increased by the pro-established minimum length of the inter-word spacing.
  • register 7 accumulates the total minimum length of text received. This continues as codes are received, but with each normal space code received a comparison is made in compare for overflow circuit 11.
  • the output line length which is the total or full length to be occupied by a line of text, has been pre-established by a manual operation of a key 13 (it could be relatively small, as for a newspaper, or wider, as desired, for a book).
  • This value for the output line length is stored in register 15.
  • This register can be of the form well known in the data processing art consisting of a plurality of binary storage elements adapted to store the binary representations of the value of the output line length.
  • circuit 11 When an overflow is found, that is, when the minimum length of text accumulated including the last normal space code exceeds the output line length, circuit 11 responds such that justification computer 5 pulses reader 3 by line 17 so that further reading of text by reader 3 is temporarily halted.
  • the compare circuit 11 can be a conventional arithmetic circuit similar to that described hereinafter with respect to the compare circuit 29.
  • register 19 computes the total input length without the last word.
  • This register can also be a conventional data processing register consisting of a plurality of binary storage elements adapted to store a representation of a value. The values accumulated are identical as above described for total input length register 7, but values for text including and immediately following the last normal space code are not accumulated into this register until the result from compare for overflow circuit 11 indicates that no overflow was caused by the values attributed to the last word received.
  • the total input without last word register 19 can be loaded with the values stored in the total input length register 7 when no overflow occurs.
  • register 19 when an overflow is sensed, register 19 contains the minimum length of all full words received from tape 1 for a given line, up to a space, which defines, of course, a grammatically proper line ending. (When overflow just occurs because of the spacing attributable to the last normal space code, this is processed as a special case. "lhe instant invention then is unnecessary for use with the line involved since the output line will inherently be justified to one of good quality.)
  • justification computer 5 The textual content of information received by justification computer 5 is stored in justification computer 5.
  • justification computer 5 When an overflowed line as above described is received. justification computer 5 then automatically calculates the inter-word spacing necessary to justify the line Without the last word. Since the line justified ends immediately before a space, it necessarily has a grammatically acceptable line ending.
  • the justification may be implemented by straight-forward division by electronic data processing means of the space to be filled by the number of. inter word spaces. Also by electronic data processing, the interword spacing computed is compared with a preestablishes first preferred maximum inter-word value inserted manually by a key 21. This value will be one selected in accordance with the quality level desired, and it may be, for example, eleven units for a newspaper application or seven units in a book application.
  • the output register 23 is a conventional data processing register consisting of a plurality of storage positions each adapted to store a data character representation or a space code representation. In this manner, an entire line of data characters can be stored in the output register 23.
  • Print out in this regard from justification computer 5 to a printer 25 is preferably as described in US. patent application Ser. No. 580,275, filed Sept. 19, 1966 entitled Variable Spacebar Mechanism for Automatically Operated Proportional Escapement Printer, by Wiliam H. Castle, John E. Jones, and Robert A. Rahenkamp, and assigned to the assignee of the present invention.
  • justification computer 5 will automatically pulse doubling circuitry 27.
  • Doubling circuitry 27 accepts from register 19 the total input length without the last word and doubles that value.
  • circuitry 29 compares the output line length from register 15 with the value from doubler 27. If circuitry 29 responds to represent that the doubled value is equal to or greater than the output line length, then justification computer 5 is pulsed by line 31 accordingly.
  • justification computer 5 automatically calculates the output by straightforward division of the number of characters less one into the space to be filled, with the assumption of an inter-word space width equal to a pre-established maximum interword spacing, which preferably is a somewhat larger inter-word spacing than the first preferred maximum interword spacing used in the first justification computation.
  • This larger spacing value, denominated maximum quad spacing is manually inserted by the machine operator with a value as desired by use of key 33 prior to use of the machine for composition of a particular piece.
  • codes representative of the next within this case codes inserted between character codes, each representative of the inter-character spacing computed, are transferred to output register 23 and ultimately to printer 25.
  • printer 25 There is no limitation placed on the amount of inter-character spacing which may be outputted when computation of inter-character spacing is conducted as just described.
  • the inter-character spacing of course, to the extent inserted is distributed substantially evenly between the various symbols and spaces in the output line.
  • the preferred printer is a unit spacing device, so completely even distribution is not always possible and in some lines some of the inter-character spaces are therefore made one unit greater than others.
  • the amount of inter-character spacing will be relatively small, and then a unit of spacing is inserted between the first characters until all of the inter-character spacing is inserted.) The previous check to assure that the doubled value is at least a certain relative magnitude is adequate to assure a good quality level.
  • circuitry 29 responds to represent that the doubled value is less than the length of the output line, then the insert hyphen structures 35 are pulsed by line 37.
  • the hyphen is inserted manually, that is, the last word received by justification computer 5 is displayed and the machine operator mentally decides where that last word should be hyphenated. Then the operator manually keys that information into the insert hyphen structures 35 using keys 39 to thereby select the position for hyphenation.
  • J ustification computer 5 calculates maximum inter-word spacing based upon the inputted text including the part of the last word before the hyphen point and including a hyphen as the last character in the line. It is preferred at every point in the processing after the first interword calculation to automatically use the maximum quad spacing, which is somewhat larger, as the maximum inter-word spacing. If in this sub sequent computation of inter-word spacing the maximum quad spacing is found not to be exceeded, then the line of text is outputted to register 23 and displayed by printer 25 in the manner previously described.
  • justification computer 5 computes the inter-character spacing to be inserted as the space between words, and the text with that inter-character and the maximum inter-word spacing inserted is outputted to register 23 and displayed by printer 25. There is then no limitation on the intercharacter spacing which may be computed and outputted.
  • reader 3 is pulsed once again on line 17, and the steps and functions described above are repeated to thereby process the next line of text. Any part of the last word received which was not outputted as part of the previous line is, of course, inserted as the first part of the next line.
  • the amount of multiplication made in accordance with this invention of the minimum length of a line of text without the last word is fundamentally a matter of choice.
  • the multiplication by two is entirely satisfactory and provides good structural efficiencies.
  • the value in register 19 is multiplied by two by simply adding that value to itself once in a conventional arithmetic circuit. (It is entirely clear, of course, that the addition by two at this particular point is merely a matter of convenience in this particular arrangement.
  • comparison circuitry 29 is implemented by simply subtracting in a conventional arithmetic circuit the output line length from the doubled value. If a highest order borrow is not produced in the subtraction, the signal described on line 31 is produced. If a highest order borrow is produced, the signal described on line 37 is produced. (A one unit difference is values at which the result of the comparison by subtraction would change would be created if the doubled value were subtracted from the line length. The high order borrow would then be used with reversed significance. This simply represents a minor change in result which is readily available if desired.)
  • the computations of this preferred embodiment require roughly one-eighth of the number of steps and yield a significant reduction in structural requirements as compared to computations in the same machine as described when more direct intercharacter spacing checks were made along with special case checks such as for one and two word lines and for the receipt of a word for use in hyphenation.
  • final control is placed with the operator since the operator may key in a signal from insert hyphen structures 35 which operates to refuse a hyphen by causing the machine to justify at maximum quad and with substantially evenly distributed spacing inter-character as needed.
  • a justification system including means to receive unjustified text symbols including character symbols and inter-word space symbols, means to accumulate data related to the length to be occupied by the text symbols in a line of text symbols received which will occupy a minimum length which is not greater than the total length to be occupied by a line of justified text symbols, the text symbols received having a grammatically acceptable line ending, actuable justification computer means'for calculating the inter-word and inter-character spacing of the line of text symbols received utilizing up to a preset maximum inter-word spacing to achieve a justified line of text characters, and means to record the received text symbols in the justified form computed wherein the improvement comprises:
  • comparison means structured to receive two numeric values and operate upon said two numeric values once to produce essentially only a first condition and a second condition, said first condition being produced when one of said two numeric values is at least a pre-established proportion of the other of said numeric values and the second condition being produced when said one numeric value is less than said preestablished proportion of said other numeric value,
  • said comparison means operates by subtracting one of said two numeric values from the other only once and said first condition and said second condition are established by whether a highest order borrow is produced.
  • said comparison means operates by subtracting one of said two numeric values from the other only once and said first condition and said second condition are established by whether a highest order borrow is produced.
  • said system as in claim 1 including means to effectively multiply by performing at least one arithmetic op eration which effectively adds the value represented by I said accumulated data to itself an integral number of times, the result of said means to effectively multiply establishing said first factor.
  • a justification system with means to receive unjustified text, justification computer mean to calculate the spacing to achieve justified lines comprising different symbols which occupy different widths, normally inoperative means toinsert hyphens selectively into received text, and means to record said text in the justified form computed wherein the improvement comprises:
  • said means to compare including means to receive a first value and a second value and means to normally produce a first result from each comparison in which said first value is significantly less than said second value and to normally produce a second result from each comparison in Ill] which said second value is significantly more than said first value, said means to compare receiving as said first value a value established by the value represented by said data accumulated and receiving as said second value a value established by said total length to be occupied by a line of text, aid first value and said second value being defined so that said first result is produced only when the minimum length to be occupied by said line of text received is in the order of magnitude of less than one-half of said total length to be occupied by a line of text, and
  • the system as in claim 7 including means to effectively multiply by performing at least one arithmetic op eration which effectively adds at least the approximate value represented by said accumulated data to itself an integral number of times, the result of said means to effectively multiply at least partially establishing at least one of said first value and said second value.
  • said means to accumulate accumulates data related at least approximately to the minimum length to be occupied by said line of text received.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Audiology, Speech & Language Pathology (AREA)
  • Health & Medical Sciences (AREA)
  • Computational Linguistics (AREA)
  • General Health & Medical Sciences (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Artificial Intelligence (AREA)
  • Document Processing Apparatus (AREA)
  • Character Spaces And Line Spaces In Printers (AREA)
  • Record Information Processing For Printing (AREA)
US613611A 1967-02-02 1967-02-02 Efficient justification quality control Expired - Lifetime US3483527A (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US61361167A 1967-02-02 1967-02-02

Publications (1)

Publication Number Publication Date
US3483527A true US3483527A (en) 1969-12-09

Family

ID=24457990

Family Applications (1)

Application Number Title Priority Date Filing Date
US613611A Expired - Lifetime US3483527A (en) 1967-02-02 1967-02-02 Efficient justification quality control

Country Status (10)

Country Link
US (1) US3483527A (en。)
JP (1) JPS5618393B1 (en。)
BE (1) BE709330A (en。)
CH (1) CH460816A (en。)
DE (1) DE1611456B2 (en。)
ES (1) ES350063A1 (en。)
FR (1) FR1554096A (en。)
GB (1) GB1195751A (en。)
NL (1) NL149111B (en。)
SE (1) SE346403B (en。)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3757921A (en) * 1970-12-23 1973-09-11 Ibm Right hand margin control system
US3895704A (en) * 1972-05-18 1975-07-22 Little Inc A Word processor with right-hand margin control
US4197584A (en) * 1978-10-23 1980-04-08 The Perkin-Elmer Corporation Optical inspection system for printing flaw detection
EP0026303A3 (en) * 1979-09-27 1983-02-16 International Business Machines Corporation Line adjustment apparatus in a text processing system
US4462701A (en) * 1982-05-11 1984-07-31 International Business Machines Corporation Printing system wherein justification determination is shared between a host processor and a printer
US5220623A (en) * 1983-11-02 1993-06-15 Canon Kabushiki Kaisha Image processing apparatus which can shift reproduction position of image areas, character train, etc.

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS631795U (en。) * 1986-06-20 1988-01-07

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US2876687A (en) * 1951-06-26 1959-03-10 Graphic Arts Res Foundation In Type composing apparatus
US3245614A (en) * 1960-08-01 1966-04-12 Photon Inc Type composing method and apparatus
US3299408A (en) * 1963-08-27 1967-01-17 Wang Laboratories Data translation system
US3307154A (en) * 1962-10-11 1967-02-28 Compugraphic Corp Data processing apparatus for line justification in type composing machines

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US2876687A (en) * 1951-06-26 1959-03-10 Graphic Arts Res Foundation In Type composing apparatus
US3245614A (en) * 1960-08-01 1966-04-12 Photon Inc Type composing method and apparatus
US3307154A (en) * 1962-10-11 1967-02-28 Compugraphic Corp Data processing apparatus for line justification in type composing machines
US3299408A (en) * 1963-08-27 1967-01-17 Wang Laboratories Data translation system
US3312953A (en) * 1963-08-27 1967-04-04 Wang Laboratories Data processing system

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3757921A (en) * 1970-12-23 1973-09-11 Ibm Right hand margin control system
US3895704A (en) * 1972-05-18 1975-07-22 Little Inc A Word processor with right-hand margin control
US4197584A (en) * 1978-10-23 1980-04-08 The Perkin-Elmer Corporation Optical inspection system for printing flaw detection
EP0026303A3 (en) * 1979-09-27 1983-02-16 International Business Machines Corporation Line adjustment apparatus in a text processing system
US4462701A (en) * 1982-05-11 1984-07-31 International Business Machines Corporation Printing system wherein justification determination is shared between a host processor and a printer
US5220623A (en) * 1983-11-02 1993-06-15 Canon Kabushiki Kaisha Image processing apparatus which can shift reproduction position of image areas, character train, etc.

Also Published As

Publication number Publication date
CH460816A (de) 1968-08-15
DE1611456C3 (en。) 1975-03-06
BE709330A (en。) 1968-05-16
DE1611456A1 (de) 1972-02-10
JPS5618393B1 (en。) 1981-04-28
SE346403B (en。) 1972-07-03
NL149111B (nl) 1976-04-15
GB1195751A (en) 1970-06-24
DE1611456B2 (de) 1974-07-18
FR1554096A (en。) 1969-01-17
ES350063A1 (es) 1969-04-16
NL6801506A (en。) 1968-08-05

Similar Documents

Publication Publication Date Title
US4225249A (en) Variable character spacing matrix for proportional spacing printing systems
US3579193A (en) Editing and revision system
US3757921A (en) Right hand margin control system
GB1296175A (en。)
GB1595932A (en) Apparatus for forming hyphenated words
US4904099A (en) Electronic typewriter
EP0052725A1 (en) Method of reducing the print element changes in a text processing system
US3760376A (en) System for controlling output lines with limited storage capacity
US5399029A (en) Method of kerning in the processing of documents written in European languages
GB1476837A (en) System for and method of printing text
US3483527A (en) Efficient justification quality control
US3999164A (en) Printing device
US4480316A (en) Ruled line print control system in a word processing apparatus
US3289176A (en) Data processing apparatus
US3529296A (en) Hyphen-based line composing apparatus and method
US2968383A (en) Method and apparatus for type composition
US4220417A (en) Apparatus for producing preliminary character printout of text and instruction codes of word processing apparatus
US4212553A (en) Tabulation control system having two electronic tab racks
US3998311A (en) Indicating entry into a variable width right margin zone
US5902051A (en) Character printing apparatus
US3577127A (en) Composer system for processing data in parallel columns
US4402058A (en) Keyboard mismatch correction
US4689764A (en) Method and apparatus for formatting a line of text containing a complex character prior to text justification
US3676853A (en) System for controlling format
KR900005238B1 (ko) 전자식 타자기의 세로쓰기 여백 설정장치