| { | |
| "paper_id": "C94-1020", | |
| "header": { | |
| "generated_with": "S2ORC 1.0.0", | |
| "date_generated": "2023-01-19T12:48:37.111817Z" | |
| }, | |
| "title": "AN ENGLISH-TO-KOI~EAN MACHINE TI~ANSLATOR", | |
| "authors": [ | |
| { | |
| "first": "Es", | |
| "middle": [ | |
| "/" | |
| ], | |
| "last": "Ek", | |
| "suffix": "", | |
| "affiliation": { | |
| "laboratory": "", | |
| "institution": "Korea Advanced [nstit'td'c of Science and Technology", | |
| "location": {} | |
| }, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Star", | |
| "middle": [], | |
| "last": "Choi", | |
| "suffix": "", | |
| "affiliation": { | |
| "laboratory": "", | |
| "institution": "Korea Advanced [nstit'td'c of Science and Technology", | |
| "location": {} | |
| }, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Seungmi", | |
| "middle": [], | |
| "last": "Lee", | |
| "suffix": "", | |
| "affiliation": { | |
| "laboratory": "", | |
| "institution": "Korea Advanced [nstit'td'c of Science and Technology", | |
| "location": {} | |
| }, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Tiongun", | |
| "middle": [], | |
| "last": "Kim", | |
| "suffix": "", | |
| "affiliation": { | |
| "laboratory": "", | |
| "institution": "Korea Advanced [nstit'td'c of Science and Technology", | |
| "location": {} | |
| }, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Deok--Bong", | |
| "middle": [], | |
| "last": "Kim", | |
| "suffix": "", | |
| "affiliation": { | |
| "laboratory": "", | |
| "institution": "Korea Advanced [nstit'td'c of Science and Technology", | |
| "location": {} | |
| }, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Chcoljung", | |
| "middle": [], | |
| "last": "Kweon", | |
| "suffix": "", | |
| "affiliation": { | |
| "laboratory": "", | |
| "institution": "Korea Advanced [nstit'td'c of Science and Technology", | |
| "location": {} | |
| }, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Gilchang", | |
| "middle": [], | |
| "last": "Kim", | |
| "suffix": "", | |
| "affiliation": { | |
| "laboratory": "", | |
| "institution": "Korea Advanced [nstit'td'c of Science and Technology", | |
| "location": {} | |
| }, | |
| "email": "" | |
| } | |
| ], | |
| "year": "", | |
| "venue": null, | |
| "identifiers": {}, | |
| "abstract": "This note introduces at, English-to-Korean Machiue 'lYanslation System MA!t'ES/EK, which ha.s been developed as a research prototype and is still under upgrading in KAIST (Korea Advanced Institute of Science and Technology). MATES/EK is a transfl:r.-ba.~ed system and it has several subsystems tt, at can be used to support other MT-developments. They are grammar ar developing environment systems, dictionary developing tools, a set of angmented context free gritm Inars for English syntactic analysis, and so on.", | |
| "pdf_parse": { | |
| "paper_id": "C94-1020", | |
| "_pdf_hash": "", | |
| "abstract": [ | |
| { | |
| "text": "This note introduces at, English-to-Korean Machiue 'lYanslation System MA!t'ES/EK, which ha.s been developed as a research prototype and is still under upgrading in KAIST (Korea Advanced Institute of Science and Technology). MATES/EK is a transfl:r.-ba.~ed system and it has several subsystems tt, at can be used to support other MT-developments. They are grammar ar developing environment systems, dictionary developing tools, a set of angmented context free gritm Inars for English syntactic analysis, and so on.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Abstract", | |
| "sec_num": null | |
| } | |
| ], | |
| "body_text": [ | |
| { | |
| "text": "An ],;nglish-to-Korean mactdne translation system MATES/EK has been developed through a co-research done by KAIST and SF, RI (Systmns Engineering l{.esearch Institute) from 1988 to 1992, and is still under ewflution in KA1ST. It has several tools snpporting system dew~.lopment, such as the grammar writing language and its de veloping environment, a set of augmented context free grammar for English syntactic analysis, ;rod dictionary editor. This system has been developed for UNIX workstation.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Introduction", | |
| "sec_num": "1." | |
| }, | |
| { | |
| "text": "MATES/EK was originally developed using Common Lisp in order to test the possibility of English-to Korean machine translation, and then it has been totally reconstructed using C language.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Introduction", | |
| "sec_num": "1." | |
| }, | |
| { | |
| "text": "Its main target dmmfin is electric/electronic papers and so the dictionary ~tnd the grammars are specitically adjusted to the do-*This research is partly supported by Center for ArtiIicial Intelligence Research (CAIR) (1992). main and one of sample sentences is II\"li;F, computer m;tgazine September 1991 issue to test and ewduate the system.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Introduction", | |
| "sec_num": "1." | |
| }, | |
| { | |
| "text": "MNI'ES/EK is a typical transfi'x-based system, which does English sentence analysis, tnmsforms the result (parse tree) into an intermediate repre-. sentation, and then transRn'ms it into ~L Korean syntactic structure to construct ~t Korean sentmlce. Figure 1 de.picts the ow'.rall configuration of MNI'ES/EK, which has R)llowing features: * Morphological Analysis Using l'\u00a2-gr;ml : We resolve tile category ambiguities by combining the N-gram and the rules. (Kim, 1992) . Augmented Context Free (',ranlmars for Ellglish Syntactic An~dysis : We dew'.loped a set of augmented context free gr~mmu~r rules ['or general English synt~mtic analysis a, td the. ~malyzer is implemented using '/bnfita~ LI{. parsing algorithm (Tomita, 1987 lation between English and Korean, two languages with fairly different syntactic structures (Kweon, et M., 1990 , Kweon, 1992 ).", | |
| "cite_spans": [ | |
| { | |
| "start": 458, | |
| "end": 469, | |
| "text": "(Kim, 1992)", | |
| "ref_id": "BIBREF3" | |
| }, | |
| { | |
| "start": 716, | |
| "end": 729, | |
| "text": "(Tomita, 1987", | |
| "ref_id": "BIBREF6" | |
| }, | |
| { | |
| "start": 822, | |
| "end": 841, | |
| "text": "(Kweon, et M., 1990", | |
| "ref_id": null | |
| }, | |
| { | |
| "start": 842, | |
| "end": 855, | |
| "text": ", Kweon, 1992", | |
| "ref_id": "BIBREF5" | |
| } | |
| ], | |
| "ref_spans": [ | |
| { | |
| "start": 250, | |
| "end": 258, | |
| "text": "Figure 1", | |
| "ref_id": "FIGREF0" | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "Overview of The System", | |
| "sec_num": "2." | |
| }, | |
| { | |
| "text": "\u2022 Grammar Writing Language and Its Environment : MATES/EK runs a series of tree transformations on LSS structures from the English syntactic structure, in order to get a structure specific to Korean syntactic structure. To do this, a grammar writing language and the supporting system were developed for the tree transformations (Kweon, 1992) .", | |
| "cite_spans": [ | |
| { | |
| "start": 329, | |
| "end": 342, | |
| "text": "(Kweon, 1992)", | |
| "ref_id": "BIBREF5" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Overview of The System", | |
| "sec_num": "2." | |
| }, | |
| { | |
| "text": "The whole tree transformations are done in a single grammar processing system in which a grammar writing language is defined and a set of tools, such as the parser, the interpreter and some debugging facilities for the language, are supported. In the grammar writing language, a rule describes a tree transformation by specifying the p~ttern of an input tree, test conditions, the transformation operations, and the resultant tree structures. Figure 2 is an example of a tree transformation rule written in grammar writing language and two trees before and after its apphcation.", | |
| "cite_spans": [], | |
| "ref_spans": [ | |
| { | |
| "start": 443, | |
| "end": 451, | |
| "text": "Figure 2", | |
| "ref_id": "FIGREF2" | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "Overview of The System", | |
| "sec_num": "2." | |
| }, | |
| { | |
| "text": "MATES/EK consists of a set of dictionaries, a set of grammar rules, and the processing modules. Translation is done through a series of processes; English morphological analysis, English syntactic analysis, English semantic analysis, English-Korean lexical transfer, English-to-Korean structural transformation, Korean syntactic structure generation, and Korean morphologicM generation. Brief introductions to each processing follows. an LSS speeitic to Korean.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Overview of The System", | |
| "sec_num": "2." | |
| }, | |
| { | |
| "text": "We developed more titan 300 tree transforming rules that are written in grammar writing law guage. These grammar rules lead the English syntactic structure into a dependency structure of English. This dependency structure is relatively similar to meaning structure but it is still specitic to English, so we need more tree transformations to get a structure for Korean language.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "English Semantic Analysis", | |
| "sec_num": "3.3." | |
| }, | |
| { | |
| "text": "head in an ];',uglish dependency structure is a ]:;nglish verb word, the hexd in corresponding Korean dependency structure is Korean verb or a,djeclive word, those two words are often not mapped directly, l\"igure 3 is an example of transformation from an English syntactic structure into its English specilic dependency structures LSS for a sentence \"Pipelining increases ])erformance by ex-I)loiting instruction-level parallelism.\"", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "English Semantic Analysis", | |
| "sec_num": "3.3." | |
| }, | |
| { | |
| "text": "In this step the system looks up the English-Korean bilingual dictionary. We manage the analysis dictionary separately from the transfer dictionary so that we may use the san, e analysis dictionary to the other language pair such as Fmglish to Japanese with the other transfer dictionary. There are more than 300 lexicat specitic selection rules developed to make the lexieal selection better.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "English to Korean Transfer", | |
| "sec_num": "4." | |
| }, | |
| { | |
| "text": "Using another tree transformation grammar, the English specific dependency structure is transformed into a Korean language specific dependency structure after looking up the bilingual dictionary. The dependency structures are represented as head and dependents. Although the", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "English-Korean Structural 'lYansformation", | |
| "sec_num": "4.1." | |
| }, | |
| { | |
| "text": "In this step the system transforms further the resultant structure into a list of Korean morphemes. Since the dei)endency structure sl)eeilies no word order, we have to lind the word order of a sen tence and necessary postpositions by help of rules and lexical information (Jang, eta] ., 1991). Note that Korean has, like Japane.se, several alternative postl)ositions lbr conveying the same meaning.", | |
| "cite_spans": [ | |
| { | |
| "start": 273, | |
| "end": 284, | |
| "text": "(Jang, eta]", | |
| "ref_id": null | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Korean Syntactic Generation", | |
| "sec_num": "5.1." | |
| }, | |
| { | |
| "text": "After the whoh: tree transformation, tile resultant structure is a list of pairs of a morpheme and its category. The morphologicM generator is an automaton that does the synthesis and separatim, of morphemes according to the context and Korean morpheme combination rule. Since the Korean language has some complex morphological structure, the synthesis is a very complex process. ", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Korean Morphological Generation", | |
| "sec_num": "5.2" | |
| }, | |
| { | |
| "text": "Since after the first completion of this project, we have been trying to find and solve the problems of this system. Following list is a brief list of those problems, and they are not seem to be easy to solve in the near future.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Problems for Evolution of the System", | |
| "sec_num": "6." | |
| }, | |
| { | |
| "text": "Robust processing for ill-formed sentences : Current MATFS/EK assumes that the input sentence be a well formed English sentence. After practical test, we found the robustness for ill-formed sentences is highly required, because the papers fi'oln the IEEE computer magazine contains the non-sentential, nontext text such as braces, numeric expressions, formulas and so on.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Problems for Evolution of the System", | |
| "sec_num": "6." | |
| }, | |
| { | |
| "text": "Processing of non-continuous idiomatic expressions : In the dictionary entry specification we have a simple rule to represent the non-continuous idiomatic expressions, but it is not easy to detect those expressions from a sentence and represent the found expression in the internal structure for processing.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Problems for Evolution of the System", | |
| "sec_num": "6." | |
| }, | |
| { | |
| "text": "Selecting correct word correspondency between several alternatives : MATES/EK uses the semantic marker and a scoring of frequencies to select the word correspondeney. The system still lacks a strong strategy for the word selection.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Problems for Evolution of the System", | |
| "sec_num": "6." | |
| }, | |
| { | |
| "text": "Processing Korean Sentence Style : Koreau language has various styles of sentences(difference between normal ones from the honorific or polite expressions), which are quite difficult to catch from the English sentences. Too many ambiguities in English syntactic anMysis : Currently MATES/EK uses a set of ad hoc heuristics and lexieal semantic markers coded in the dictionary in order to solve the ambiguity resolution, such as the PP attachment. This problcm is related to the problem of selecting the right postposition of Korean.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Problems for Evolution of the System", | |
| "sec_num": "6." | |
| }, | |
| { | |
| "text": "EvMuation of an MT systeln enmrges as a critic'M issue these days, but we have not yet found a strong and objective way of evaluation. After the first completion of the project we tried though, to make an evaluation of the system.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Test and Evaluation", | |
| "sec_num": "7." | |
| }, | |
| { | |
| "text": "In order to inake the evaluation as objective as possible we prepared three factors. First, the referees of the evaluation should be those who are not the developers of the system, and they should take a training to make objective decisions. We selected randomly five master degree students as the referees. Second, the referees are given a decision criteria of four levels: best, good, poor, and fail. A sentence is 'best' translated if the resultant Korean sentence is very natural and requires no additional postediting. A sentence is 'good' translated if the result sentence is structurally correct but it has some minor lexicM selection errors. A sentence is translated 'poor' if there is structural error as well as lexical errors. By 'fail', we mean when the system produces very ill-formed translation or fails to prodnce any result at all. We took the first three levels to be 'success,' because even a sentence is translated in 'poor' degree, it is still understandable. (Even if a translation is scored to be 'fail', it could sometimes be understandable from the view point of 'mechanical translation.') Third, the test sentences should be those sentences which were never used during the development time.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Test and Evaluation", | |
| "sec_num": "7." | |
| }, | |
| { | |
| "text": "This system was tested on 1,708 sentences, whose length were less than 26 words selected from 2500 sentences in the IEEE comtmter magazine September 1991 issue. It showed about 95 percent of success rate for sentences shorter than 15 words, about 90 percent for 18 words, 80 percent for 21 words, and 75 percent for 26 words. This is a quite encouraging result since the IEEE computer magazine contains wide range of texts of wrions styles.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Test and Evaluation", | |
| "sec_num": "7." | |
| }, | |
| { | |
| "text": "Development of MATES/EK gaw; a strong motivation of attacking practically important problems, such as dictionary management, scaling up the grammar rules to the real texts, controlling the consistency of a large system.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Conclusion and Further Study", | |
| "sec_num": "8." | |
| }, | |
| { | |
| "text": "The system MATES/EK is still under growing, trying to overcmne the problems listed above, scaling up the dictionaries and the grammar rules, and doing downsizing to the PC environment. l~eferences", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Conclusion and Further Study", | |
| "sec_num": "8." | |
| } | |
| ], | |
| "back_matter": [], | |
| "bib_entries": { | |
| "BIBREF0": { | |
| "ref_id": "b0", | |
| "title": "Developing Linguistic Model and Skeleton System for Machine Translation", | |
| "authors": [ | |
| { | |
| "first": "K", | |
| "middle": [ | |
| "S" | |
| ], | |
| "last": "Choi", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1988, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Choi, K.S., (1988). Developing Linguistic Model and Skeleton System for Machine Trans- lation. KAIST TR, M20160.", | |
| "links": null | |
| }, | |
| "BIBREF1": { | |
| "ref_id": "b1", | |
| "title": "Research on English-to-Korean Transfer and Development of Machine Dictionary", | |
| "authors": [ | |
| { | |
| "first": "K", | |
| "middle": [ | |
| "S" | |
| ], | |
| "last": "Choi", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1989, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Choi, K.S., (1989). Research on English-to- Korean Transfer and Development of Machine Dictionary. KAIST TR M03330.", | |
| "links": null | |
| }, | |
| "BIBREF2": { | |
| "ref_id": "b2", | |
| "title": "Korean Generation in MATES/EK", | |
| "authors": [ | |
| { | |
| "first": "M", | |
| "middle": [ | |
| "G" | |
| ], | |
| "last": "Jang", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1991, | |
| "venue": "Proceedings of Natural Language Processing Pacific Rim Symposium (NL-PRS '9I)", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Jang, M.G., et al., (1991). Korean Generation in MATES/EK. Proceedings of Natural Lan- guage Processing Pacific Rim Symposium (NL- PRS '9I), Singapore.", | |
| "links": null | |
| }, | |
| "BIBREF3": { | |
| "ref_id": "b3", | |
| "title": "English Morphological Analyzer in English-to-Korean Machine 'lYanslation System", | |
| "authors": [ | |
| { | |
| "first": "D", | |
| "middle": [ | |
| "B" | |
| ], | |
| "last": "Kim", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "D", | |
| "middle": [ | |
| "S" | |
| ], | |
| "last": "Chang", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "K", | |
| "middle": [ | |
| "S" | |
| ], | |
| "last": "Choi", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1992, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Kim, D.B., Chang, D.S., and Choi, K.S., (1992). English Morphological Analyzer in English-to-Korean Machine 'lYanslation Sys- tem. PI~ICAI'92, Scoul.", | |
| "links": null | |
| }, | |
| "BIBREF4": { | |
| "ref_id": "b4", | |
| "title": "Grammar Writing Language (GWL) in MATES-El", | |
| "authors": [ | |
| { | |
| "first": "C", | |
| "middle": [ | |
| "J" | |
| ], | |
| "last": "Kweon", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "K", | |
| "middle": [ | |
| "S" | |
| ], | |
| "last": "Choi", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "G", | |
| "middle": [ | |
| "C" | |
| ], | |
| "last": "Kim", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1990, | |
| "venue": "Proceedings of PRICAI 1990", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Kweon, C.J., Choi, K.S., and Kim, G.C., (1990). Grammar Writing Language (GWL) in MATES-El(. Proceedings of PRICAI 1990, Nagoya, Japan, November 14th 1990.", | |
| "links": null | |
| }, | |
| "BIBREF5": { | |
| "ref_id": "b5", | |
| "title": "Grammar Writing Language : CANNA-2. KAL~T TR", | |
| "authors": [ | |
| { | |
| "first": "C", | |
| "middle": [ | |
| "J" | |
| ], | |
| "last": "Kweon", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1992, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Kweon, C.J., (1992). Grammar Writing Lan- guage : CANNA-2. KAL~T TR, M~0071.", | |
| "links": null | |
| }, | |
| "BIBREF6": { | |
| "ref_id": "b6", | |
| "title": "An efficient augmentedcontext free parsing Mgorithm. Computational Lingui,stic,s. 13 (I-2", | |
| "authors": [ | |
| { | |
| "first": "M", | |
| "middle": [], | |
| "last": "Tomita", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1987, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "1--6", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Tomita, M., (1987). An efficient augmented- context free parsing Mgorithm. Computational Lingui,stic,s. 13 (I-2), 1-6 198Z", | |
| "links": null | |
| } | |
| }, | |
| "ref_entries": { | |
| "FIGREF0": { | |
| "uris": null, | |
| "text": "ai~9\".%.':~:~:~:i~:~ .'~\" The System Configuration of MATES/EK", | |
| "num": null, | |
| "type_str": "figure" | |
| }, | |
| "FIGREF1": { | |
| "uris": null, | |
| "text": "Morphological Analysis It incorporates the method of categorial ambiguity resolution using N-gram with rule combinations, as well as the basic English word identification, such as word separation, processing of Mtixes and recognition of idiomatic phrases (Kim, et M., 1092).", | |
| "num": null, | |
| "type_str": "figure" | |
| }, | |
| "FIGREF2": { | |
| "uris": null, | |
| "text": "(ll Impl) |;; (C Imp2)) ..::~!:~:i:~:!::,-..,.. An example of grammar writing rule and the tree transformation -in the rule \"(A! (B! tmpl) (C! tmp2))\" describes that 'A' as a parent node of a pattern, '(B! trap)' and '(C! trap2)' as the first mtd second child, and each child may have zero or more children. '.lThe action part describes the necessary transformation operation.", | |
| "num": null, | |
| "type_str": "figure" | |
| }, | |
| "FIGREF3": { | |
| "uris": null, | |
| "text": "An example of English syntactic structure and the corresponding English dependency structure which is described in LSS, where; PILED (PREDicate) the head of a sentence, normMly verbs or adjectives are selected, COMN (COMplement Noun) a node that leads a noun phrase, PREA (PREdicate Adjective) corresponds to a verb or an adjective in an adjective phrase, PREB (Pll, Edicate adverB) corresponds to a verb or an adjective in an adverb phrase.", | |
| "num": null, | |
| "type_str": "figure" | |
| }, | |
| "TABREF0": { | |
| "html": null, | |
| "num": null, | |
| "text": "...... ' ...... H ...........", | |
| "type_str": "table", | |
| "content": "<table><tr><td/><td>Semanticll / IAnalysis~ 1 Trams ferI~]Generat [or <~ISyntac ic</td><td/></tr><tr><td/><td>[Grammar ~I Grammar ~LGrammar</td><td>--</td></tr><tr><td>ell-formed~ English \\ Sentence\\</td><td>V L Grammar Writing Language Environment</td><td>/ / S~nLenoe / /</td></tr><tr><td colspan=\"3\">...... ..English En $lisl. E-Lo-K :<-\" Syntax Semant l( Trano fer Syntactlc Mot r Korean , Korean Generator Generator nalyzer Analyzer Analyzel <!English orph</td></tr><tr><td/><td/><td>).</td></tr><tr><td/><td colspan=\"2\">, I,exical Semantic Structure (LSS) to repre--</td></tr><tr><td/><td colspan=\"2\">sent the intermediate representation : The</td></tr><tr><td/><td colspan=\"2\">result of the syntactic structure is trans.-</td></tr><tr><td/><td colspan=\"2\">tbrmed into an intermediate representatkm</td></tr><tr><td/><td colspan=\"2\">LSS, which is a dependency structure that</td></tr><tr><td/><td colspan=\"2\">is relatively independent to specific lan-</td></tr><tr><td/><td colspan=\"2\">guages. In I, SS, the constituents in a sen-</td></tr><tr><td/><td colspan=\"2\">tence are combined only in head-dependent</td></tr><tr><td/><td colspan=\"2\">relation based on the lexieal categories, and</td></tr><tr><td/><td colspan=\"2\">there art.' no order relatkm between the con-</td></tr><tr><td/><td colspan=\"2\">stituents. Hence LSS is desirable for trans-</td></tr></table>" | |
| }, | |
| "TABREF1": { | |
| "html": null, | |
| "num": null, | |
| "text": "3.2. English Syntactic AnalysisIt uses the gener~flized Tomita Lit parsing algorithm on augmented context free grammar. Tile grammar is inductively constructed from 3,000 e~trefully selected sentences that include various linguistic phenomena of English. Those sentences are mainly selected from the IEEE computer magazine September 1991. Other sources of the test sentences are HP issue test sentences, ~nd I,ongman English Grammar Textbook. The constructed grammar for syntax analysis consists of about 500 rules.As described above, LSg(the Lexical Semantic Structure) is description for the intermediate representation. The result of syntactic analysis is transformed into an LSS which is relatively more specific to English, and then is transformed into", | |
| "type_str": "table", | |
| "content": "<table><tr><td/><td/><td colspan=\"2\">A-samplc-trans tl)ml-!xde {</td></tr><tr><td/><td/><td colspan=\"2\">iil(id12 : 2:</td></tr><tr><td/><td/><td colspan=\"2\">(A! (1~! .-tmpl) (C! --trap2))</td></tr><tr><td/><td/><td colspan=\"2\">with {</td></tr><tr><td/><td/><td/><td>feature conditions</td></tr><tr><td/><td>,</td><td colspan=\"2\">I _var ._lre\u00a2 1), I';;</td></tr><tr><td/><td/><td colspan=\"2\">_acti()n {</td></tr><tr><td>/</td><td><~\\'\\\\</td><td/><td>actions StlC~l as</td></tr><tr><td colspan=\"2\"><2;'> 0!Z, > _ _ -A \u00a2[1</td><td>,</td><td>feature operations .....</td></tr></table>" | |
| } | |
| } | |
| } | |
| } |