Browse Prior Art Database

Paragraph Processing

IP.com Disclosure Number: IPCOM000039477D
Original Publication Date: 1987-Jun-01
Included in the Prior Art Database: 2005-Feb-01
Document File: 2 page(s) / 26K

Publishing Venue

IBM

Related People

Tsuchiya, M: AUTHOR

Abstract

The present method decides whether a sequence of characters which occurs at the last line of a paragraph of a Japanese document should be packed into the previous line in consideration of not only the number of characters of the last line but also line length of the paragraph so that the appearance of the paragraph is improved.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 96% of the total text.

Page 1 of 2

Paragraph Processing

The present method decides whether a sequence of characters which occurs at the last line of a paragraph of a Japanese document should be packed into the previous line in consideration of not only the number of characters of the last line but also line length of the paragraph so that the appearance of the paragraph is improved. In accordance with the present method, the sequence of the characters of the last line of a paragraph is a candidate for paragraph processing if the following condition is satisfied: L x F > O where L = line length of the paragraph which is the number of charac ters F = adjusting factor which is less than 1

O = the maximum number of characters that should not be left at

the last line of the paragraph And then, the characters at the last line of the paragraph is packed into the previous line when the following condition is satisfied: O >= N where O = the maximum number of characters that should not be left at the last line of the paragraph.

N = the actual number of characters of the last line It is assumed that the factor F is 0.6. In the case of Fig. 1 where L, N and O are 10, 4 and 4, respectively, the sequence of characters of the last line of the paragraph is packed into the previous line because 10 x 0.6 > 4 and 4 = 4. In the case of Fig. 2 where L, N and O are 5, 4 and 4, respectively, the sequence of characters of the last line of the paragraph is not packed into the previous line because 5 x 0.6 < 4.

1

Page 2 of...