TRANSLATING FROM JOURNALS OR MANUALS

Exercise #1
Translate this text into Indonesian
   

Failure to meet eligibility requirements

Applications were assessed against the eligibility requirements listed in the Applicant Guidelines. Applications that did not meet the eligibility requirements have been assessed as ineligible. Common reasons applications were marked ineligible:

• documentation meeting language requirements such as TOEFL/IELTS or transcript of at least one year of study in an approved country was not provided.
• an unconditional/conditional admission letter from an Australian institution for commencement during the correct year was not provided (international applicants).
• nomination from a host organisation for commencement during the correct year was not provided.
• proof of citizenship from an eligible country was not provided.
• applicant did not supply weighted academic transcripts with a score card explaining grading system.

Failure to follow the Applicant Guidelines may result in an ineligible application. It is therefore essential that applicants read all of the instructions carefully and ensure they meet all eligibility requirements prior to commencing an application.

Exercise #2

 Function Flows

The loading process begins the moment the application is started, where the program’s configuration file is referenced and any existing dictionaries cached to disk are retrieved and stored in memory.  If the configuration file indicates a dictionary not recovered from disk is needed, the new dictionary is constructed from its source files or databases and held in memory.  Once all dictionaries are assembled and accounted for, the application enters a second stage of operation in which is waits for spell check requests to process.

When a spell check request is detected, the program parses the provided search phrase using a “Formatter” into a list of one or more checkable terms (IE, words separated by spaces, the entire unaltered search phrase, etc.).  These terms are supplied to a function loop which moves through the list of spell check “Rules” (pairs of spell checking algorithms and their associated dictionaries to check against) to identify if the specified word or term exists in a dictionary (and thereby assume to be spelled correctly) or otherwise generate a list of suggested words or terms that the algorithm indicates may be related to the user-submitted search term.  The list of suggestions accumulates during this function loop, and when there are no more search terms to process, and every algorithm has been run to its completion, the resulting set of suggested words or terms is sent to the origin of the spell check request.  At this point, the program returns to its “waiting” state and lies dormant until the next search request occurs.