GB2212639A - Designating block processing in a translation machine - Google Patents

Designating block processing in a translation machine Download PDF

Info

Publication number
GB2212639A
GB2212639A GB8829890A GB8829890A GB2212639A GB 2212639 A GB2212639 A GB 2212639A GB 8829890 A GB8829890 A GB 8829890A GB 8829890 A GB8829890 A GB 8829890A GB 2212639 A GB2212639 A GB 2212639A
Authority
GB
United Kingdom
Prior art keywords
block
sentence
designated
sentences
translation
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
GB8829890A
Other versions
GB8829890D0 (en
Inventor
Takashi Matsui
Yoji Fukumochi
Shuzo Kugimiya
Ichiko Nakamura
Tokuyuki Hirai
Hitoshi Suzuki
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Sharp Corp
Original Assignee
Sharp Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Sharp Corp filed Critical Sharp Corp
Publication of GB8829890D0 publication Critical patent/GB8829890D0/en
Publication of GB2212639A publication Critical patent/GB2212639A/en
Withdrawn legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00Handling natural language data
    • G06F40/20Natural language analysis
    • G06F40/268Morphological analysis
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00Handling natural language data
    • G06F40/20Natural language analysis
    • G06F40/205Parsing
    • G06F40/211Syntactic parsing, e.g. based on context-free grammar [CFG] or unification grammars
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00Handling natural language data
    • G06F40/20Natural language analysis
    • G06F40/279Recognition of textual entities
    • G06F40/289Phrasal analysis, e.g. finite state techniques or chunking
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00Handling natural language data
    • G06F40/40Processing or translation of natural language
    • G06F40/55Rule-based translation

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Health & Medical Sciences (AREA)
  • Artificial Intelligence (AREA)
  • Audiology, Speech & Language Pathology (AREA)
  • Computational Linguistics (AREA)
  • General Health & Medical Sciences (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Machine Translation (AREA)

Abstract

A sentence processing device used in a translation machine comprises sentence number input keys by which a block containing a plurality of sentences to be processed can be designated by inputting the sentence numbers assigned respectively to the start (head) and end (bottom) sentences of the block. All of the sentences included in the block can be automatically consecutively processed, S12-S15, when it is judged, S11, that a block has been designated. <IMAGE>

Description

A A DEVICE FOR DESIGNATING A PROCESSING AREA FOR USE IN A TRANSLATION MACHINE" BACKGROUND OF THE INVENTION FIELD OF THE INVENTION The present invention relates to a designation area processing device used in an electronic translation machine in which any area or areas can be so designated that only the designated areas can be sequentially processed for printing, translation, deletion or spell check e.g..
DESCRIPTION OF THE PRIOR ART In the prior art, there is an electronic translation machine such that, a source language entered by operating keys on a key board is entered in a translation module under the control of a main central processing unit (referred to as CPU hereinafter), so that the entered source language mentioned above is translated into a target language by the translation module using a consulting dictionary (CD), grammatical rules (GR) and tree construction conversion rules (TCCR) which are stored in a memory. In the conventional translation machine as mentioned above, the area of the sentences which can be designated for performing the process of sentence such as printing, translation, deletion and spell check is limited to one sentence, entire sentences of the document or all the sentences after the cursor position.
Therefore, in case where a part of the document is to be processed, if the part includes several sentences, the operation of the sentence processing must be repeated on every sentence, otherwise, the cursor must be moved to the head position of the head sentence in the designated part so that all the sentences after the cursor position are processed and the sentence processing is interrupted at the end of the last sentence of the designated part. The operation necessary for the operator as mentioned above has been very troublesome.
SUMMARY OF THE INVENTION An essential object of the present invention is to provide a block designation deyice for use in a translation machine in which a part of a document including a plurality of source sentences can be designated so that only but the entire designated part can be consecutively processed with a simple operation.
In order to accomplish the object mentioned above, the block designation device for use in a translation machine according to the present invention comprises; block designating means for designating at least a start point and end point of a block in a source document; judging means for judging whether or not the block to be processed is already designated; and means for consecutively processing all of the sentence or sentences included in the block designated by said block designating means when said judging means judges that the block is designated.
That is, any block or blocks of the source sentences each having a sentence number to be processed are designated, so that the numbers of the head and bottom sentences of the designated blocks are entered by the block designating means in order to process the designated blocks without processing the undesignated blocks in the source document.
When it is judged by the judgment means that the block of the sentences to be processed is designated by entering the numbers of the head and bottom sentences of the block to be processed in the source document, the designating means consecutively performs the processes of the sentences in the block designated by the numbers of the head and bottom sentences of the block in the source document.
Accordingly, a plurality of designation blocks can be integrally consecutively processed in the source document without performing a process on every sentence or moving the cursor to the position of the head sentence of the designation block so as to process all the sentences after the cursor position, interrupting the process at the bottom sentence of the designation block.
BRIEF DESCRIPTION OF THE DRAWINGS Fig. 1 is a block diagram showing an embodiment of a translation machine in which a device according to the present invention is employed, Fig. 2 is a block diagram of a translation module used in the translation machine shown in Fig. 1, and Figs. 3 and 4 are flow charts showing an operation for designating a partial area of a document.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT A preferred embodiment of the present invention will be described with reference to the attached drawings.
In Fig. 1, there are shown a main CPU 1 comprising judgment means and designated block processing means, a main memory 2, a cathode ray tube (referred to as CRT hereinafter) 3, a key board 4, a translation module 5, and a memory 6 storing a consulting dictionary (CD), grammatical rules and tree construction conversion rules (TCCR).
The translation module 5 translates an input source language into an output target language. That is to say, the source language entered by operating the keys on the key board 4 is sent to the translation module 5 under the control of the main CPU 1. The translation module 5 translates the entered source language into a target language using the consulting dictionary CD, grammatical rules GR and tree construction conversion rules TCCR which are stored in the memory 6 as to be described below. The translated sentences in a target language through the process of the translation module 5 are once stored in the main memory 2 and are displayed on the CRT 3.
The operation of the translation module 5 is explained with reference to Figs. 1 and 2.
First, the entered source sentence is divided into various kinds of arrays of respective morphemes (arrays of words) by using the consulting dictionary CD in the memory 6 through a dictionary consulting morpheme analyzer 11 so as to obtain grammatical data such as parts of speech and translation word for each of the words, and furthermore, the time, person and number of the subject are analyzed. Next in a syntax analyzer 12, a syntax analyzing tree representing relations between the respective words is decided according to the consulting dictionary CD and the grammatical rules stored in the memory 6.
In a converter 13, the construction of the syntax analyzing tree for the entered source sentence is converted to a syntax analyzing tree for a translated sentence using the TCCR in the memory 6. Subsequently in a translation generator 14, joshi in Japanese (a postpositional word functioning as an auxiliary to a main word) and auxiliary verbs proper for the target language are added to the translated sentence, so that the translated sentence is generated from the translation module 5 and is stored in the main memory 2 and displayed in the CRT 3.
Next, there will be explained hereinafter the process of designation of the area for performing the document process such as the translation using the translation module 5, printing, deletion, and spell check, with reference to the flow chart shown in Fig. 3.
Before the description proceeds, it is noted that each of the source sentences in the translation machine is serially, automatically or manually numbered in the order that the number of the sentence increases as the sentence proceeds.
In the step S1, the number of the head sentence in a desired block in the source document is entered by the key board 4 which is referred to as a block designation sentence number input means, and set in the translation machine.
In the step S2, the number of the bottom sentence in the desired block in the source document is entered by the key board 4 and set in the translation machine.
By the operation in the steps S1 and S2, the desired block is designated. For example, assuming that there are sentences NO. 1 to NO. 20 in one document. If the operator wants to process the sentences NO. 5 to NO. 10, he enters the numeric number 5 and 10 as the head sentence number and the bottom sentence number, whereby a block from NO. 5 to NO. 10 can be designated.
In the step S3, a block designation flag is set "on", whereby the operation of the block designation is completed.
Next, the operation for the document processing of the designated block is explained with reference to the flow chart shown in Fig. 4.
It is judged in the step S11 whether or not the block designation flag is set "on". When the flag is set "on", the program goes to the step S12, and in case the flag is not set "on", the program goes to the step S16.
In the step S12, the number of the head sentence set in the step S1 shown in Fig. 3 is substituted for an initial value of a loop counter and the number of the bottom sentence set in the step S2 is substituted for the maximum value of the loop counter.
In the step S13, only the sentence having the same sentence number as the count value of the loop counter is processed by e.g. printing, translation, deletion and spell check.
In the step Ski4, the count value of the loop counter is increased.
In the step S15, it is judged whether or not the count value of the loop counter is smaller than the maximum value corresponding to the bottom sentence number designated in the step S12. In case the count value of the loop counter is smaller than the maximum value, the program goes back to the step S13 so as to perform the document processing for the next one sentence, and in case the count value of the loop counter is not smaller than the maximum value, the program goes to the END and the document processing of the designated block is finished.
When it is judged in the step S11 that the block designation flag is not set "on", the program goes to the step S16 and the normal document processing such as one sentence processing, entire sentence processing or after cursor position processing is performed, in turn the program goes to the END to finish the document processing of the designated block.
As described above, once one block of the containing a plurality of the source sentence is designated by the operator, all of the sentences in the designated block can be automatically processed without any further operator's instructions. Accordingly, the operability of the document processing in the electronic translation machine can be remarkably improved.

Claims (3)

CLAIMS:
1. A designated block processing device for use in a translation machine, comprising: block designating means for designating at least a start point and end point of a block in a source document; judging means for judging whether or not the block to be processed is already designated; and means for consecutively processing all of the sentence or sentences included in the block designated by said block designating means when said judging means judges that the block is designated.
2. The device according to claim 1, wherein said block designating means comprising: sentence number input means for inputting a head sentence number assigned to the source sentence situated at the beginning of the block and a bottom sentence number assigned to another source sentence situated at the end of the block.
3. The device according to claim 2, wherein said sentence judging means is a flag which is set when the head sentence is designated by said sentence number input means.
GB8829890A 1987-12-24 1988-12-22 Designating block processing in a translation machine Withdrawn GB2212639A (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP62333573A JPH01169575A (en) 1987-12-24 1987-12-24 Specified area processor for translator

Publications (2)

Publication Number Publication Date
GB8829890D0 GB8829890D0 (en) 1989-02-15
GB2212639A true GB2212639A (en) 1989-07-26

Family

ID=18267553

Family Applications (1)

Application Number Title Priority Date Filing Date
GB8829890A Withdrawn GB2212639A (en) 1987-12-24 1988-12-22 Designating block processing in a translation machine

Country Status (2)

Country Link
JP (1) JPH01169575A (en)
GB (1) GB2212639A (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0201096A2 (en) * 1985-05-08 1986-11-12 Kabushiki Kaisha Toshiba Processing method and processor for machine translation
GB2177242A (en) * 1985-05-20 1987-01-14 Sharp Kk Translation system
GB2193362A (en) * 1986-05-20 1988-02-03 Sharp Kk Machine translation
GB2193358A (en) * 1986-06-30 1988-02-03 Sharp Kk Translation machine
GB2199680A (en) * 1986-11-28 1988-07-13 Sharp Kk Translating apparatus

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS61265673A (en) * 1985-05-20 1986-11-25 Sharp Corp Translation system
JPS62203274A (en) * 1986-03-04 1987-09-07 Toshiba Corp Mechanical translation system

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0201096A2 (en) * 1985-05-08 1986-11-12 Kabushiki Kaisha Toshiba Processing method and processor for machine translation
GB2177242A (en) * 1985-05-20 1987-01-14 Sharp Kk Translation system
GB2193362A (en) * 1986-05-20 1988-02-03 Sharp Kk Machine translation
GB2193358A (en) * 1986-06-30 1988-02-03 Sharp Kk Translation machine
GB2199680A (en) * 1986-11-28 1988-07-13 Sharp Kk Translating apparatus

Also Published As

Publication number Publication date
GB8829890D0 (en) 1989-02-15
JPH01169575A (en) 1989-07-04

Similar Documents

Publication Publication Date Title
CA1251570A (en) Bilingual translation system with self intelligence
US5161105A (en) Machine translation apparatus having a process function for proper nouns with acronyms
US4814987A (en) Translation system
US4774666A (en) Translating apparatus
US5644774A (en) Machine translation system having idiom processing function
JPH05303590A (en) Automatic translating device
GB2192077A (en) A machine translation system
GB2197510A (en) Translation apparatus
US5195032A (en) Device for designating a processing area for use in a translation machine
US5132901A (en) System and method for input of target language equivalents and determination of attribute data associated therewith
US5257187A (en) Translation machine system
GB2194084A (en) Translation system
JPS5994131A (en) Word processor
GB2212639A (en) Designating block processing in a translation machine
GB2213971A (en) Output system of a dictionary name for translation machine
GB2193018A (en) Translation machine system
JPH05233600A (en) Word processor
JPH0594430A (en) Document processor
JPH01259448A (en) Kanji input system
JP2766738B2 (en) Machine translation equipment
GB2199432A (en) Translation machine
JPH06318224A (en) Machine translation device
JPH0991289A (en) Machine translation system and translation candidate display method
JPH05334339A (en) Machine translating system
JPH07182342A (en) Machine translation system

Legal Events

Date Code Title Description
WAP Application withdrawn, taken to be withdrawn or refused ** after publication under section 16(1)