Seek for .........: Term

Step 2: Fill the field with the unknown Term or Abbreviation.
Do not forget to write the query string in the correct language.
No matters if you use uppercase or lowercase characters.



Unknown word :

Step 3: Select the appropriate dictionary.

Greek to English. English to Greek.

Step 4:

Press the "Submit" button to start the search engine,
or "Reset" to clear the field and retry.

Step 5:

Be patient with the Search Engine.
It won't be late.



Help Topics

Search Engine Setup

Before pressing the Submit button, you may want to Setup the Search Engine Parameters

Allow Soft Seek : Yes. No.

Maximum Number of Matchings :

By setting the first parameter(Allow Soft Seek = Yes),the Search Engine starts
searching for terms that include the given string.
The Maximum Number of Matcings (M.N.M) tels the Search Engine to display n terms
whitch include the query string.(n=M.N.M)


Help Topics

Searching Using Special Characters.

To help you find a Term easier, the Infolex Dictionary gives you a number of
Special characters, whitch are implementing the search we call "Smart Search"

These Special Characters are:

a) The Brackets [,].
b) The Wildcard Character *.
c) The characters "greater than" and "less than ".

Help Topics

Term Search using brackets [,].

Brackets activate a special mechanism,whitch is searching for substrings.

For example,if you submit the following string :



you will get :

a) The term "daname", if exists.
b) Terms including [da] AND [name].
like "data name".

Note:The Search Engine allows the naximum number of 12 pairs of
brackets, simulateously.

Help Topics

Term Search using the wildcard character *.

The character (*), activates the wildcard Search.
With this software switch, we can replace unknown characters
inside the search string.

For example,if you submit the following string :



you will get :

a) The term "int", if exists.
b) Terms starting with the letters i,n,t.
like "integer", "integer arithmetic".

Help Topics

Term Search using the characters "greater than","less than".

Using these switches, we can find terms beggining or ending
with the specified letters

For example,if you submit the following string :



you will get :

a) The term "i",if exists.
b) Terms beggining with "i" .

If you submit the following string :