DAVAR :: View topic - Hebrew-French and French-Hebrew dictionary

patrick wrote:

Hi,

Thank you for your great Davar program. Razz

How to write a dictionary Hebrew-French and French-Hebrew ?
What tools i need and what is .he2 and .2he files format database ?
I would like to test.

Regards

Patrick

Thanks for your apreciative post.
You could create a new dictionary manually using Davar File -> New Dictionary/Lexicon. Or to help make it easier, if you have the data files Hebrew - French, you could send it to us and we could try to compile.

..

Right now focus is on Davar 3 that when finished will supply the easy compilers for those interested in making Dictionaries, Lexicons and Books.

Faithful regards,
-- Davar team

Ps. Davar program Help > Index > Appendices
includes the details about the File format 2he, he2 of Davar dictionaries

Quote:

Code:

The knowledge of file formats is necessary if someone is doing conversion of words from another program to Davar format. So, here it is. Please note that file formats can change in future.

+=============================================================================+
| |
| File format 2he, he2 of Davar dictionaries |
| |
| VERSION 4 (without unsorted records) |
| Last change: 28.1.2001 |
+=============================================================================+
| |
| File include: HEADER (1024 bytes) |
| SORTED DATA |
| |
+=============================================================================+
|offset | bytes | |
| 0 | 4 |Identify string "hbdi" |
| 4 | 1 |version of format: (Davar 0.1-0.3=1, 0.4+=2, 0.6+=3, 0.8+=4) |
| 5 | 1 |direction: 0=->HEB (.2he) 1=HEB-> (.he2) |
| 6 | 8 |date of change in format (YYYYMMDD), NOT USED YET! |
| 14 | 40 |Name of dictionary, filled 32 , finished 0 !! |
| 54 | 1 |width nonhebrew word, default: 30 NOTE: BOTH ARE COMMON! |
| 55 | 1 |width hebrew word, default: 30 NOTE: BOTH ARE COMMON! |
| 56 | 1 |width type of word, default:1 USER CANNOT CHANGE THAT! |
| 57 |(int)4 |Number of records in sorted area, include deleted records |
| 61 |(int)4 |Number of deleted records in sorted area |
| 65 | 4 |Charset for nonhebrew font. 0=ANSI, 238=EastEurope etc.. |
| 69 | | |
| . | | ( unused bytes filled 0) |
| . | | |
| . | | |
| 480 | 32 |256-bit area of mapping SAME WEIGHT characters. If here is 1 |
| . | |it means that NEXT character in sorting table is equivalent. |
| . | |Unused positions filled 0 |
| . | | |
| 512 | 512 |Sorting table of dictionary, always for nonhebrew language, |
| | |Hebrew sorting is fixed. Chars are in alphabet order. |
| | |Each char is in TWO bytes. For example in czech it looks: |
| | |'F'0, 'f'0, 'G'0, 'g'0, 'H'0, 'h'0, 'C''H', 'c''h', 'I'0 ... |
| | |Maximum table size is 255 chars, last two bytes MUST be 0,0 |
| | |Unused bytes filled by 0. Unused characters are ignored |
| | | |
| | | ( Unused bytes filled by 0 ) |
| | | |
|=============================================================================|
| |
|SORTED DATA: array of records. |
|.2he: order nonhebrew, hebrew, type char |
|.he2: order hebrew, nonhebrew, type char |
|Type width is one char, case sensitive. If not presented, 0 is placed there |
| |
|Both hebrew and nonhebrew strings are stored from LEFT to RIGHT |
|E.G. 66 65 64 "gimmel-bet-aleph". Unused positoions filled 0 |
|In word string, only chars 0, 32-255 are stored |
|TYPE: if no type is specified, type=0 |
| deleted record, type=1 |
| values 33-255 can be used as user-defined filter for words |
| If user enter something else, this is converted to 0 |
| |
|SORTED DATA are stored in alphabetic order (string in first part of record) |
| |
+=============================================================================+

File format for tab

Code:

Sorting tables are text files, you can create and edit them e.g. in Notepad. Some basic information about the table are in the header of each file, please read it too.

The table includes two parts:
1) Alphabet of the given language. Because languages may use two characters as if it were a single character (e.g. Czech 'ch'), two characters are reserved for one alphabet character in the table.
2) Equivalent characters. Some characters can have the same "weight" in sorting (e.g. letters with or without accents, Czech 'A','a','?','?', etc.). The third column indicates if the NEXT character is equivalent (value=1), or not (value=0).

The table length is max. 255 lines, the last (256) position must be 0, 0, 0.

Here is an example of an English sorting table file:

# Sorting order. Everything after # is ignored to the end of line (use CR-LF).
# Char '#' MUST be in the first column of line or after character codes!
# Each line describes one character. Because some languages use double chars as
# one (e.g. 'ch' in czech), there are two codes for one char (decadic). For
# one char put on second position 0.
# Third number is 'mapping' flag. If set to 1, the next char (on next line) is
# equivalent with this character. You can have max. 255 chars in order,
# last used line MUST BE 0, 0, 0
# Example:
# 65, 0, 1 #'A', 0=no double char, 1=next char is equivalent
# 97, 0, 0 #'a', 0=no double char, 0=no other char is equivalent
#
################################################
#
# E N G L I S H S O R T I N G T A B L E
#
################################################
65, 0, 1
97, 0, 0
66, 0, 1
98, 0, 0
67, 0, 1
99, 0, 0
68, 0, 1
100, 0, 0
69, 0, 1
101, 0, 0
70, 0, 1
102, 0, 0
71, 0, 1
103, 0, 0
72, 0, 1
104, 0, 0
73, 0, 1
105, 0, 0
74, 0, 1
106, 0, 0
75, 0, 1
107, 0, 0
76, 0, 1
108, 0, 0
77, 0, 1
109, 0, 0
78, 0, 1
110, 0, 0
79, 0, 1
111, 0, 0
80, 0, 1
112, 0, 0
81, 0, 1
113, 0, 0
82, 0, 1

114, 0, 0
83, 0, 1
115, 0, 0
84, 0, 1
116, 0, 0
85, 0, 1
117, 0, 0
86, 0, 1
118, 0, 0
87, 0, 1
119, 0, 0
88, 0, 1
120, 0, 0
89, 0, 1
121, 0, 0
90, 0, 1
122, 0, 0
48, 0, 0
49, 0, 0
50, 0, 0
51, 0, 0
52, 0, 0
53, 0, 0
54, 0, 0
55, 0, 0
56, 0, 0
57, 0, 0
0, 0, 0 # MUST(!) BE AT END OF TABLE