Bi-directional display

• US 7,120,900 B2
• Filed: 04/19/2001
• Issued: 10/10/2006
• Est. Priority Date: 04/19/2001
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines SA (International Business Machines Corporation)
• Inventors: Atkin, Steven Edward
• Primary Examiner(s): Dam, Tuan
• Assistant Examiner(s): Fowlkes, Andre R.
• Application Number:
  US09/838,377
• Publication Number:
  US 20030014220A1
• Time in Patent Office: 2,000 Days
• Field of Search: 717/117, 704/8
• US Class Current: 717/117
• CPC Class Codes: G06F 3/018 Input/output arrangements for oriental characters
• CPC Class Codes: G06F 3/0489 using dedicated keyboard keys or combinations thereof
• CPC Class Codes: G06F 40/10 Text processing natural language analysis G06F40/20; semantic analysis G06F40/30; processing or translation of natural language G06F40/40
• CPC Class Codes: G06F 40/129 Handling non-Latin characters, e.g. kana-to-kanji conversion

Abstract

A bidirectional text display method embodied in a functional programming language which first assigns bidirectional attributes to a logical character stream. Next, through explicit processing, level numbers are assigned, honoring any directional overrides present in the logical character stream. Subsequent weak and neutral type processing potentially causes attribute types to change based upon surrounding attribute types. Then, implicit processing assigns final level numbers to the stream which control reordering. Finally, reordering processing produces a sequence of characters in display order. By separating the facets of layout dealing with reordering from those that are concerned with rendering, such as line breaking, glyph selection, and shaping, the Haskell-based method is more discernible and comprehendable, thereby allowing it to be more useful as a model upon which others may base bidirectional implementations.

Claims

1. A method of converting a logically ordered character stream into a character stream suitable for display by a computer and comprehension by a user, said logically ordered character stream having a plurality of characters and control codes contained within it, said method comprising:

assigning bidirectional attributes to a logical character stream;

assigning initial level numbers and honoring any directional overrides by explicit processing;

changing attribute types based upon surrounding attribute types through weak and neutral processing;

associating final level numbers to the logical character stream through implicit processing; and

reordering said characters within said logical character stream according to said final level numbers such that said reordered characters form a character stream in display order wherein facets of layout relating to character reordering and facets related to character stream rendering are handled separately in a functional programming language, and said character stream is handled as sequential runs of integers during said steps of assigning attributes, level numbers, changing, attribute types, associating final level numbers, and reordering characters.

2. The method as set forth in claim 1 wherein said step of assigning bidirectional attributes further comprises obtaining said bidirectional attributes from a character database.

3. The method as set forth in claim 1 wherein said step of changing attribute types based upon surrounding attribute types through weak and neutral processing in a functional programming language comprises providing blocks of functional programming language indexed by name weak type processing, neutral type processing, and implicit level processing such that said method may be readily used as a reference.

4. The method as set forth in claim 1 wherein one or more steps are provided in Haskell functional language.

5. The method as set forth in claim 1 wherein one or more steps are provided in Erlang functional language.

6. The method as set forth in claim 1 wherein one or more steps are provided in Standard Machine Language (“

SML”

) functional language.

7. The method as set forth in claim 1 wherein one or more steps are provided in Miranda functional language.

8. The method as set forth in claim 1 wherein one or more steps are provided in Lisp functional language.

9. The method as set forth in claim 1 wherein one or more steps are provided in Scheme functional language.

10. A computer readable medium encoded with software causing a computer to perform the following actions:

receiving a logically ordered character stream;

assigning bidirectional attributes to the logical character stream;

assigning initial level numbers and honoring any directional overrides by explicit processing;

changing attribute types based upon surrounding attribute types through weak and neutral processing;

associating final level numbers to the logical character stream through implicit processing; and

reordering said characters within said logical character stream according to said final level numbers such that said reordered characters form a character stream in display order, wherein facets of layout relating to character reordering and facets related to character stream rendering are handled separately in a functional programming language, and said character stream is handled as sequential runs of integers during said steps of assigning attributes, level numbers, changing, attribute types, associating final level numbers, and reordering characters.

11. The computer readable medium as set forth in claim 10 wherein said software for performing said assignment of bidirectional attributes further comprises software for obtaining said bidirectional attributes from a character database.

12. The computer readable medium as set forth in claim 10 wherein said software for performing the action of changing attribute types based upon surrounding attribute types through weak and neutral processing in a ftmctional programming language comprises software organized into blocks of functional programming language indexed by name weak type processing, neutral type processing, and implicit level processing such that said method may be readily used as a reference.

13. The computer readable medium as set forth in claim 10 wherein said software is Haskell functional language.

14. The computer readable medium as set forth in claim 10 wherein said software is Erlang functional language.

15. The computer readable medium as set forth in claim 10 wherein said software is Standard Machine Language (“

SML”

) functional language.

16. The computer readable medium as set forth in claim 10 wherein said software is Miranda functional language.

17. The computer readable medium as set forth in claim 10 wherein said software is Lisp functional language.

18. The computer readable medium as set forth in claim 10 wherein said software is Scheme functional language.

19. A text code conversion system for converting logically ordered text streams and displaying said text streams in a display order, said system comprising:

a character stream receiver for receiving a logically ordered character stream;

a bidirectional attribute assignor realized for assigning bidirectional attributes to a received logical character stream;

an initial level assignor for assigning initial level numbers and for honoring any directional overrides by explicit processing;

an attribute type changer realized for changing attribute types based upon surrounding attribute types through weak and neutral;

a final level assignor realized for associating final level numbers to the logical character stream through implicit processing; and

a character resequencer realized for reordering said characters within said logical character stream according to said final level numbers such that said reordered characters form a character stream in display order, wherein facets of layout relating to character reordering and facets related to character stream rendering are handled separately, and said logically ordered character stream is handled as sequential runs of integers by said character stream receiver, said attribute assignor, said initial level assoignor, said type changer, said final level assignor, and said character resequencer, each of which are realized in a functional programming language.

20. The text code conversion system as set forth in claim 19 wherein said bidirectional attributes assignor is adapted to obtain said bidirectional attributes from a character database.

21. The text code conversion system as set forth in claim 19 wherein said attribute type changer attribute type changer comprises blocks of functional programming language indexed by name weak type processing, neutral type processing, and implicit level processing such that said method may be readily used as a reference.

22. The text code conversion system as set forth in claim 19 wherein said bidirectional attribute assignor, initial level assignor, attribute type changer, final level assignor, and character resequencer comprise Haskell functional language.

23. The text code conversion system as set forth in claim 19 wherein said bidirectional attribute assignor, initial level assignor, attribute type changer, final level assignor, and character resequencer comprise Erlang functional language.

24. The text code conversion system as set forth in claim 19 wherein said bidirectional attribute assignor, initial level assignor, attribute type changer, final level assignor, and character resequencer comprise Standard Machine Language (“

SML”

) functional language.

25. The text code conversion system as set forth in claim 19 wherein said bidirectional attribute assignor, initial level assignor, attribute type changer, final level assignor, and character resequencer comprise Miranda functional language.

26. The text code conversion system as set forth in claim 19 wherein said bidirectional attribute assignor, initial level assignor, attribute type changer, final level assignor, and character resequencer comprise Lisp functional language.

27. The text code conversion system as set forth in claim 19 wherein said bidirectional attribute assignor, initial level assignor, attribute type changer, final level assignor, and character resequencer comprise Scheme functional language.