| { |
| "paper_id": "W97-0125", |
| "header": { |
| "generated_with": "S2ORC 1.0.0", |
| "date_generated": "2023-01-19T04:35:29.742758Z" |
| }, |
| "title": "A Local Grammar-based Approach to Recognizing of Proper Names in Korean Texts", |
| "authors": [ |
| { |
| "first": "Jee-Sun", |
| "middle": [], |
| "last": "Nam", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "KAIST", |
| "location": { |
| "country": "Korea" |
| } |
| }, |
| "email": "nam@worldkaist.ac.kr" |
| }, |
| { |
| "first": "Key-Sun", |
| "middle": [], |
| "last": "Choi", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "KAIST", |
| "location": { |
| "country": "Korea" |
| } |
| }, |
| "email": "kschoi@worldkaist.ac.kr" |
| } |
| ], |
| "year": "", |
| "venue": null, |
| "identifiers": {}, |
| "abstract": "We present an LO-based approach to recognizing of Proper Names in Korean texts. Local grammars (LGs) are constructed by examining specific syntactic contexts of lexical elements, given that the general syntactic rules, independent from lexical items, cannot provide accurate analyses. The LGs will be represented under the form of Finite State Automata (FSA) in our system. So far as we do not have a dictionary which would provide all proper names, we need auxiliary tools to analyze them. We will examine contexts where strings containing proper names occur. Our approach consists in building an electronic lexicon of PNs in a way more satisfactory than other existing methods, such as their recognition in texts by means of statistical approaches or by rule-based methods.", |
| "pdf_parse": { |
| "paper_id": "W97-0125", |
| "_pdf_hash": "", |
| "abstract": [ |
| { |
| "text": "We present an LO-based approach to recognizing of Proper Names in Korean texts. Local grammars (LGs) are constructed by examining specific syntactic contexts of lexical elements, given that the general syntactic rules, independent from lexical items, cannot provide accurate analyses. The LGs will be represented under the form of Finite State Automata (FSA) in our system. So far as we do not have a dictionary which would provide all proper names, we need auxiliary tools to analyze them. We will examine contexts where strings containing proper names occur. Our approach consists in building an electronic lexicon of PNs in a way more satisfactory than other existing methods, such as their recognition in texts by means of statistical approaches or by rule-based methods.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Abstract", |
| "sec_num": null |
| } |
| ], |
| "body_text": [ |
| { |
| "text": "In this paper, we present a description of the typology of nominal phrases containing Proper Names (IN) and the local grammars [GrogT] , [Moh94] constructed on the basis of this description. The goal is to implement a system which detects automatically PNs in a given text, allowing the construction of an electronic lexicon of PNs.", |
| "cite_spans": [ |
| { |
| "start": 127, |
| "end": 134, |
| "text": "[GrogT]", |
| "ref_id": null |
| }, |
| { |
| "start": 137, |
| "end": 144, |
| "text": "[Moh94]", |
| "ref_id": "BIBREF12" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1." |
| }, |
| { |
| "text": "The definition of Proper Nouns, as opposed to that of Common Nouns, is often a problematic issue in linguistic descriptions [Gar91] . PNs are understood in general as phonic sequences associated with one referent, without any intrinsic meanings, such as Socrates, Bach or Paris. They usually are characterized by nominal determination, the upper case marker, prohibition of pluralizing procedure, or non-translativity [Wi191]. However, semantic or syntactic criteria do not allow to distinguish these two categories in an operational way. For example, nouns such as sun, earth or moon, semantically appropriate to the definition of proper nouns such as Mars or Jupiter, do not have to be written with the upper case initial: hence, they are not considered as proper nouns. On the contrary, some proper nouns such as Baudelaire or Napoleon can be used as well as common nouns in contexts where they occur in metonymic or metaphorical relations with common nouns like:", |
| "cite_spans": [ |
| { |
| "start": 124, |
| "end": 131, |
| "text": "[Gar91]", |
| "ref_id": "BIBREF6" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1." |
| }, |
| { |
| "text": "I read some (Baudelaire + poems of Baudelaire) He is a real (Napoleon + general) Moreover, they often allow, like common nouns, the derivation of adjectives: e.g. Socratic, Napoleonic or Parisian. These are also written with initial upper case, differently from usual adjectives.", |
| "cite_spans": [ |
| { |
| "start": 60, |
| "end": 80, |
| "text": "(Napoleon + general)", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1." |
| }, |
| { |
| "text": "The situation concerning French is similar to that. Let us consider [Gar91] :", |
| "cite_spans": [ |
| { |
| "start": 68, |
| "end": 75, |
| "text": "[Gar91]", |
| "ref_id": "BIBREF6" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1." |
| }, |
| { |
| "text": "J'ai dcoutd (du Bach + ,~e la musique) J' ai bu (du Champagne + du vin rouge)", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1." |
| }, |
| { |
| "text": "Derivational productivity is also underlined: socratique, parisien or newyorkais, which however do not begin in the upper case.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1." |
| }, |
| { |
| "text": "In the case of Engli,;h or French, one could delimit formally the category proper nouns by means of the upper case, even though this criterion does not correspond entirely to our intuition about proper nouns. However, in Korean, there are no typographical markers such as upper case vs. lower case, while one assumes that the nouns such as in (1) could be semantically and syntactically different from those of(2):", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1." |
| }, |
| { |
| "text": "(1) ~ ~--$-, z-l~. _=~", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1." |
| }, |
| { |
| "text": "(2) ~}, -~:, q-~ namja [rnan] , sudo [capital] , nala [country] This situation makes more difficult the distinction between proper nouns and common nouns than in the case of French or English, when the former appears in the same grammatical positions as the latter like:", |
| "cite_spans": [ |
| { |
| "start": 23, |
| "end": 29, |
| "text": "[rnan]", |
| "ref_id": null |
| }, |
| { |
| "start": 37, |
| "end": 46, |
| "text": "[capital]", |
| "ref_id": null |
| }, |
| { |
| "start": 54, |
| "end": 63, |
| "text": "[country]", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Kim Minu, Seoul, France", |
| "sec_num": null |
| }, |
| { |
| "text": "( In fact, the distinction between these two categories might be arbitrary. We should perhaps consider a continuum of the noun system: a thesaurus of nouns constituted of the most generic nouns to the most specific nouns (which we call proper nouns). The following example shows a part of a noun hierarchy ( Figure 1 ):", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 308, |
| "end": 316, |
| "text": "Figure 1", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Kim Minu, Seoul, France", |
| "sec_num": null |
| }, |
| { |
| "text": "All Physical~ ~ Abstract Animate Non-Animate \",,ffi Person Animal (not-human) \".ffi Korean American ... a / Kim MinU Park JungHee ... Figure 1", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Kim Minu, Seoul, France", |
| "sec_num": null |
| }, |
| { |
| "text": "Therefore, in the automatic analyses of texts written in Korean, we intend to consider the definition problem of proper nouns from a different view point: whatever the given definition of proper nouns is, once a complete list of them is available, we presumably do not need any longer this particular distinction between proper and common nouns. All nouns have some semantic and syntactic properties, which lead to group them into several classes, not by binary distinctions. Nevertherless, it seems still hard to establish an exhaustive list of what we call proper nouns. Actually, proper nouns, important in number and in frequency, are one of the most problematic units for all automatic analyzers of natural language texts.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Kim Minu, Seoul, France", |
| "sec_num": null |
| }, |
| { |
| "text": "In this study, we will focus on the problems of recognition of proper names. We do not try to characterize them as an axiomatic class, but attach to them a formal definition to determine explicitly the object of our study. Here is our formal criterion:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Kim Minu, Seoul, France", |
| "sec_num": null |
| }, |
| { |
| "text": "That is, proper names are determined by the fact that they do not exist in our lexicon of Korean common nouns (DECOS-NS/V01) [Nam94] , and by their correspondence with the interrogative pronoun '-~5 z nugu? [who?]'. The nouns considered as proper names according to these conditions do not always correspond to our semantic intuition. Nevertheless, they usually do not have intrinsic meanings; and they do not have explicitly distinct referents. Given that a lexicon of Korean common nouns (DECOS-NS) has already been built ['Nam94] , the ambiguity across the category of common nouns and that of proper ones will be settled only in one of these two lexicons by looking up DECOS-NS: if they already are included in this lexicon, we do not consider them in the lexicon of proper nouns, without questioning their linguistic status. Remember that our goal is not to discuss the nature of this noun class, but to complete the lexicon of Korean Nouns in NLP systems. In order to handle them in an NLP system, given that we do not have yet a dictionary which provides all proper nouns, auxiliary methods are required, such as syntactic information or local grammars that allow to analyze them. In the following sections, we will classify in five types the contexts where Proper Names can appear, and describe their characteristics in detail.", |
| "cite_spans": [ |
| { |
| "start": 125, |
| "end": 132, |
| "text": "[Nam94]", |
| "ref_id": "BIBREF13" |
| }, |
| { |
| "start": 524, |
| "end": 532, |
| "text": "['Nam94]", |
| "ref_id": "BIBREF13" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Hu[x~~raon nouns [DECOS-NS]", |
| "sec_num": null |
| }, |
| { |
| "text": "This type of noun phrases is without any particular characteristics inherent to Proper Names The noun phrase in subject position: 'K/m MinU bagsaneun\" is composed of three strings. However, in Korean, typographical constraint is not a reliable criterion, since we cannot prohibit writing this phrase in other ways like:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Type I < PN-(Postposition + E) >", |
| "sec_num": "2.1." |
| }, |
| { |
| "text": "(2a) ~% ~,]--~ (2b) ~] ~ ~,~", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Type I < PN-(Postposition + E) >", |
| "sec_num": "2.1." |
| }, |
| { |
| "text": "When proper names occur as attached to other elements of noun phrases, their analysis becomes more complicated. Therefore, a local grammar recognizing PTs such as ( Figure 3 ): The Specs are appropriate to PTs: we observe nouns designating scientific domains such as 'physics', \"biology', \"mathematics', or 'literature' for the PTs like 'doctor', whereas we find another set of Specs for the PT'minister': ' education', 'culture ', or 'Wansfortation' for example.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 165, |
| "end": 173, |
| "text": "Figure 3", |
| "ref_id": "FIGREF2" |
| } |
| ], |
| "eq_spans": [], |
| "section": "KimMinU_ bagsaneun KimMinUbagsaneun", |
| "sec_num": null |
| }, |
| { |
| "text": "Notice that PTs can also appear without PNs: Thus, in order to analyze the strin~ followed by a PT in contexts such as (5), the system should first look up a lexicon of Common Nouns (and eventually a lexicon of Determiners), and if the search fails, one could suppose that we found a proper name: ; the element followed by \"bagsa [doctor]' in (5c) will not be matched with any entries of the lexicon of common nouns: only this string will then be recognized as a proper name. The local grammar proposed so far should be completed by the description of the following transformation. Let us compare (4) with (6): These nouns have a strong possibility to occur with a proper name, as shown in the following sentence: The string '~71. bag-ga' will not be recognized as one of these cases, even though there exists a simple noun \"bag [pumpkin]' in the dictionary of common nouns, since the postposition required by this noun is not '71-ga', but 'ol r. Therefore, bag-ga will be analyzed as a proper name bag (family name alone) followed by an INga. ", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "KimMinU_ bagsaneun KimMinUbagsaneun", |
| "sec_num": null |
| }, |
| { |
| "text": "(bebhag + E) bagsa-ga jeil senmangbad-neun sahoijeg fiwijung-eui hana-i-da (A doctor (of Law + E)", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "KimMinU_ bagsaneun KimMinUbagsaneun", |
| "sec_num": null |
| }, |
| { |
| "text": "(", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "KimMinU_ bagsaneun KimMinUbagsaneun", |
| "sec_num": null |
| }, |
| { |
| "text": "bebhag", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "KimMinU_ bagsaneun KimMinUbagsaneun", |
| "sec_num": null |
| }, |
| { |
| "text": "These five contexts are represented in Figure 10 : Notice that when we recognize Incomplete Nouns (i.e. ~ ssi, ~ yang, 7} ga, ~d nim, :~ gun, ong), the occurrence of proper names is guaranteed, since _/Ns cannot occur without PNs. Nevertheless, as mentioned above, serious ambiguity problems appear in the distinction of/Ns from their homographs, we here propose two complex local grammars in order to increase the ratio of identification of/Ns.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 39, |
| "end": 48, |
| "text": "Figure 10", |
| "ref_id": "FIGREF7" |
| } |
| ], |
| "eq_spans": [], |
| "section": "<PN-Postp> <PN-(Spec)-PT-Postp> <PN-Gen-FR-Postp> < PN-VT-P ostp> <PN-1N-Postp>", |
| "sec_num": null |
| }, |
| { |
| "text": "There are specific items appropriate to human nouns: we name them .PostHN. They do not constitute autonomous units, but are attached to human nouns at the syntactic level. Thus, they appear even after the plural marker ~ deul ", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Use of PostHN appropriate to Human Nouns", |
| "sec_num": "3.1." |
| }, |
| { |
| "text": "In French, we observe a preposition similar to this PostHN: ehez ('s family/house), a locative preposition, as at one ~ in English, which selects only human nouns: fly a eu un feu chez M. Pierre Piton There was afire at M. Pierre Picon Therefore, when we encounter a sequence that ends with an IN-PostHN-Poalp, the possibility to find a PN is increased. For example, the following string: ~o~ 7~ !=~]-~. jang-ga-nei-neun can be analyzed in 510 ways (i.e. (7 x 7 x 5 x 2) + (2 x 5 x 2) = 510) after a simple matching of the words of this string with their lexicon entries (Figure 11) ", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 571, |
| "end": 582, |
| "text": "(Figure 11)", |
| "ref_id": "FIGREF9" |
| } |
| ], |
| "eq_spans": [], |
| "section": "bul-i na-ssda", |
| "sec_num": null |
| }, |
| { |
| "text": "Let us examine the following sentences: we can eliminate these interpretations, since these forms precede the complex sequence that requires necessarily a PN.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Snperposition of contexts for PNs", |
| "sec_num": "3.2." |
| }, |
| { |
| "text": "Kim-ssi-", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Snperposition of contexts for PNs", |
| "sec_num": "3.2." |
| }, |
| { |
| "text": "i So far, we have examined contexts where we expect to encounter Proper Names (PAr). In order to recognize automatically PNs on a large scale in texts in the absence of a complete lexicon of PNs, the description of noun phrases containing PNs should be necessary. We constructed local grammars based upon our description of the types of nominal phrases containing proper names. I", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Experimental results", |
| "sec_num": "4." |
| }, |
| { |
| "text": "Notice that implementing such a system requires the use of the relation between Recall and Precision. In general, it is understood that Recall is the ratio of relevant documents retrieved for a given query over the number of relevant documents for that query in a database, and Precision is the I ratio of the number of relevant documents retrieved over the total number of documents retrieved [Fra92] . However, Recall-Precision plots show that Recall and Precision arc inversely related. That is, I", |
| "cite_spans": [ |
| { |
| "start": 394, |
| "end": 401, |
| "text": "[Fra92]", |
| "ref_id": "BIBREF5" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Experimental results", |
| "sec_num": "4." |
| }, |
| { |
| "text": "when Precision goes up, Recall typically goes down and vice-versa. If we want to recognize automatically PNs in a given text in order to construct an electronic lexicon of PNs, Recall, that is the ratio of PNs retrieved for a given grammar over the number of PNs in the text, should certainly be higher than Precision. I Let consider results of In the contexts of i.e. <PN us some experimental our study. Type V, Incomplete Noun-(Postposition + E)>, the Incomplete Noun (/N) '~] ssi [Mr./Miss./Mrs.]' can appear with a family name alone, a given name alone, or a full name (of. 2.5. Figure 7) . Remember I that, in Korean, a typographical unit delimited by blanks cannot directly be taken as a basic element for morphological analysis [Nam97] : we should then analyze the strings occurring with a blank on the leit side of/Ns as well as the strings stuck to 1Ns in order to examine the context Type V. Thus, I", |
| "cite_spans": [ |
| { |
| "start": 735, |
| "end": 742, |
| "text": "[Nam97]", |
| "ref_id": "BIBREF19" |
| } |
| ], |
| "ref_spans": [ |
| { |
| "start": 583, |
| "end": 592, |
| "text": "Figure 7)", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Experimental results", |
| "sec_num": "4." |
| }, |
| { |
| "text": "the local grammar of Type V for '~q ssr is the following graph ( Figure 13 ):", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 65, |
| "end": 74, |
| "text": "Figure 13", |
| "ref_id": "FIGREF2" |
| } |
| ], |
| "eq_spans": [], |
| "section": "Experimental results", |
| "sec_num": "4." |
| }, |
| { |
| "text": "! Figure 13", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Experimental results", |
| "sec_num": "4." |
| }, |
| { |
| "text": "Our first text was composed of characters [Cho96] , we located 22 sequences containing ssi, 20 of which are PNs (Figure 14) :", |
| "cite_spans": [ |
| { |
| "start": 42, |
| "end": 49, |
| "text": "[Cho96]", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [ |
| { |
| "start": 112, |
| "end": 123, |
| "text": "(Figure 14)", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Experimental results", |
| "sec_num": "4." |
| }, |
| { |
| "text": "Figure 14", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Experimental results", |
| "sec_num": "4." |
| }, |
| { |
| "text": "In the second text, composed of 30869 characters, 69 occmrences of \"X-ssi\" are observed. All \"Full name-ssi\" sequences here appear attached, whereas, in the preceding text, they all appear with a blank (i.e. 7(-#-ssi'). Here is the result (Figure 15) The 9 sequences 'non-PNs\" are as followings: To guarantee that all occurrences of PNs are covered by local grammars, it would be necessary to consider a great part of the contexts where common nouns appear.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 239, |
| "end": 250, |
| "text": "(Figure 15)", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Experimental results", |
| "sec_num": "4." |
| }, |
| { |
| "text": "In this paper, we have described the contexts where proper names can occur, but the complete lists of the nouns requiring PNs have not been done. We are sure that these lists are not illimited \u2022 ones, they will be presented in further studies. Notice that these studies are deeply related to the syntax of nouns, especially that of human nouns. In this sense, human noun, a semantic concept, can nonetheless become an operational term in the formal description of natural languages, indispensable many procedures of Natural Language Processing CNLP) systems. I I I I I I I I i I I i I I I ", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 559, |
| "end": 602, |
| "text": "I I I I I I I I i I I i I I I", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Experimental results", |
| "sec_num": "4." |
| }, |
| { |
| "text": "!", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| } |
| ], |
| "back_matter": [], |
| "bib_entries": { |
| "BIBREF0": { |
| "ref_id": "b0", |
| "title": "Corpus-based Adaptation Mechanisms for Chinese Homophone Disambiguation", |
| "authors": [ |
| { |
| "first": "Chao-Huang", |
| "middle": [], |
| "last": "Chang", |
| "suffix": "" |
| } |
| ], |
| "year": 1993, |
| "venue": "Proceedings of the Workshop on Very Large Corpora", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Chang, Chao-Huang, 1993, Corpus-based Adaptation Mechanisms for Chinese Homophone Disambiguation, Proceedings of the Workshop on Very Large Corpora, Ohio State University, USA.", |
| "links": null |
| }, |
| "BIBREF1": { |
| "ref_id": "b1", |
| "title": "A Two-Level Morphological Analysis of Korean", |
| "authors": [ |
| { |
| "first": "", |
| "middle": [], |
| "last": "Choi", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Key-Sun", |
| "suffix": "" |
| } |
| ], |
| "year": 1994, |
| "venue": "Proceedings of the 15th International Conf. on Computational Linguistics (COLING '94)", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Choi, Key-Sun et al, 1994, A Two-Level Morphological Analysis of Korean, Proceedings of the 15th International Conf. on Computational Linguistics (COLING '94), Kyoto, Japan.", |
| "links": null |
| }, |
| "BIBREF3": { |
| "ref_id": "b3", |
| "title": "Dictionnaire 61ectronique du LADL pour les mots simples du fran~ais (DELAS)", |
| "authors": [ |
| { |
| "first": "Blandine", |
| "middle": [], |
| "last": "Courtois", |
| "suffix": "" |
| } |
| ], |
| "year": 1987, |
| "venue": "", |
| "volume": "17", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Courtois, Blandine, 1987, Dictionnaire 61ectronique du LADL pour les mots simples du fran~ais (DELAS), Rapport Technique du LADL, N \u00b0 17, University Paris 7.", |
| "links": null |
| }, |
| "BIBREF4": { |
| "ref_id": "b4", |
| "title": "Dictionnaire universel des noms propres", |
| "authors": [], |
| "year": 1974, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Dictionnaire universel des noms propres (Petit Robert 2), 1974, ed. Le Robert, Paris, 1st edition.", |
| "links": null |
| }, |
| "BIBREF5": { |
| "ref_id": "b5", |
| "title": "Information Retrieval: Data Structures and Algorithms", |
| "authors": [ |
| { |
| "first": "William", |
| "middle": [ |
| "B" |
| ], |
| "last": "Frakes", |
| "suffix": "" |
| }, |
| { |
| "first": "Ricardo", |
| "middle": [], |
| "last": "Baeza-Yates", |
| "suffix": "" |
| } |
| ], |
| "year": 1992, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Frakes, William B.; Ricardo Baeza-Yates, 1992, Information Retrieval: Data Structures and Algorithms, Prentice Hall, Englewood Cliffs, New Jersey 07632.", |
| "links": null |
| }, |
| "BIBREF6": { |
| "ref_id": "b6", |
| "title": "Le nora propre constitue-t-il ,me cat4gorie linguistique?", |
| "authors": [ |
| { |
| "first": "Marie-Noelle", |
| "middle": [], |
| "last": "Gary-Prieur", |
| "suffix": "" |
| } |
| ], |
| "year": 1991, |
| "venue": "Langue fran~aise N-92", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Gary-Prieur, Marie-Noelle, 1991, Le nora propre constitue-t-il ,me cat4gorie linguistique?, Langue fran~aise N-92, Paris: Larousse.", |
| "links": null |
| }, |
| "BIBREF7": { |
| "ref_id": "b7", |
| "title": "The use of finite automata in the lexical representation of natural language", |
| "authors": [ |
| { |
| "first": "Maurice", |
| "middle": [], |
| "last": "Gross", |
| "suffix": "" |
| } |
| ], |
| "year": 1987, |
| "venue": "Lecture Notes in Computer Science", |
| "volume": "377", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Gross, Maurice, 1987, The use of finite automata in the lexical representation of natural language, Lecture Notes in Computer Science 377, Springer-Verlag.", |
| "links": null |
| }, |
| "BIBREF8": { |
| "ref_id": "b8", |
| "title": "La construction de dictiounaires 61ectroniques", |
| "authors": [ |
| { |
| "first": "Maurice", |
| "middle": [], |
| "last": "Gross", |
| "suffix": "" |
| } |
| ], |
| "year": 1989, |
| "venue": "Annales des T%l~ommunications, tome 44 N \u00b0", |
| "volume": "1", |
| "issue": "2", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Gross, Maurice, 1989, La construction de dictiounaires 61ectroniques, Annales des T%l~ommunications, tome 44 N \u00b0 1:2, Issy-les-Moulineaux-Lannion: CNET.", |
| "links": null |
| }, |
| "BIBREF9": { |
| "ref_id": "b9", |
| "title": "Lexicon Based Algorithms for the Automatic Analysis of Natural Language", |
| "authors": [ |
| { |
| "first": "Maurice", |
| "middle": [], |
| "last": "Gross", |
| "suffix": "" |
| } |
| ], |
| "year": 1993, |
| "venue": "Theorie und Praxis des Lexikons", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Gross, Maurice, 1993, Lexicon Based Algorithms for the Automatic Analysis of Natural Language, in Theorie und Praxis des Lexikons, Walter de Gruyter: Berlin.", |
| "links": null |
| }, |
| "BIBREF10": { |
| "ref_id": "b10", |
| "title": "A probabilistic Context-free Grammar for Disambiguation in Morphological Parsing", |
| "authors": [ |
| { |
| "first": "Josee", |
| "middle": [ |
| "S" |
| ], |
| "last": "Heemskerk", |
| "suffix": "" |
| } |
| ], |
| "year": 1993, |
| "venue": "Proceedings of the 6th Conference of the European Chapter of the Association for Computational Linguistics", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Heemskerk, Josee S., 1993, A probabilistic Context-free Grammar for Disambiguation in Morphological Parsing, Proceedings of the 6th Conference of the European Chapter of the Association for Computational Linguistics, Utrecht, The Netherlands.", |
| "links": null |
| }, |
| "BIBREF11": { |
| "ref_id": "b11", |
| "title": "Context-free parsing with finite-state transducers, RT-IGM 96-13", |
| "authors": [ |
| { |
| "first": "Eric", |
| "middle": [], |
| "last": "Laporte", |
| "suffix": "" |
| } |
| ], |
| "year": 1996, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Laporte, Eric, 1996, Context-free parsing with finite-state transducers, RT-IGM 96-13, University of Marne-la-Vall6e.", |
| "links": null |
| }, |
| "BIBREF12": { |
| "ref_id": "b12", |
| "title": "Application of Local Grammars Automata: an Efficient Algorithm, RT-IGM 94-16", |
| "authors": [ |
| { |
| "first": "Mehryar", |
| "middle": [], |
| "last": "Mohri", |
| "suffix": "" |
| } |
| ], |
| "year": 1994, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Mohri, Mehryar, 1994, Application of Local Grammars Automata: an Efficient Algorithm, RT-IGM 94-16, University of Marne-la-Vall6e.", |
| "links": null |
| }, |
| "BIBREF13": { |
| "ref_id": "b13", |
| "title": "Dictionnaire des noms simples du cor~en", |
| "authors": [ |
| { |
| "first": "Jee-Sun", |
| "middle": [], |
| "last": "Nam", |
| "suffix": "" |
| } |
| ], |
| "year": 1994, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Nam, Jee-Sun, 1994, Dictionnaire des noms simples du cor~en, RT N \u00b0 46, Laboratoire d'Automatique Documentalre et Linguistique, University Paris 7.", |
| "links": null |
| }, |
| "BIBREF14": { |
| "ref_id": "b14", |
| "title": "Constitution d'un lexique 61ectronique des noms simples en cor6en", |
| "authors": [ |
| { |
| "first": "Jee-Sun", |
| "middle": [], |
| "last": "Nam", |
| "suffix": "" |
| } |
| ], |
| "year": 1995, |
| "venue": "Acres du LGC-1995 : Lexique-grammaires compar6s et traitements automatiques, University of Qu4bec a Monu'6al", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Nam, Jee-Sun, 1995, Constitution d'un lexique 61ectronique des noms simples en cor6en, Acres du LGC-1995 : Lexique-grammaires compar6s et traitements automatiques, University of Qu4bec a Monu'6al, Canada.", |
| "links": null |
| }, |
| "BIBREF15": { |
| "ref_id": "b15", |
| "title": "Dictionary of Korean simple verbs: DECOS-VS/01, RT N-49", |
| "authors": [ |
| { |
| "first": "Jee-Sun", |
| "middle": [], |
| "last": "Nam", |
| "suffix": "" |
| } |
| ], |
| "year": 1996, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Nam, Jee-Sun, 1996a, Dictionary of Korean simple verbs: DECOS-VS/01, RT N-49, LADL, University Paris 7.", |
| "links": null |
| }, |
| "BIBREF16": { |
| "ref_id": "b16", |
| "title": "Dictionary of Noun-Postpositions and Predicate-Postpositions in Korean", |
| "authors": [ |
| { |
| "first": "Jee-Sun", |
| "middle": [], |
| "last": "Nam", |
| "suffix": "" |
| } |
| ], |
| "year": 1996, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Nam, Jee-Sun, 1996b, Dictionary of Noun-Postpositions and Predicate-Postpositions in Korean: DECOS-PostN / DECOS-PostA / DECOS-PostV, RT N-5 l, LADL, University Paris 7.", |
| "links": null |
| }, |
| "BIBREF17": { |
| "ref_id": "b17", |
| "title": "Construction of Korean electronic lexical system DECO", |
| "authors": [ |
| { |
| "first": "Jee-Sun", |
| "middle": [], |
| "last": "Nam", |
| "suffix": "" |
| } |
| ], |
| "year": 1996, |
| "venue": "Papers in Computational Lexicography Complex '96", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Nam, Jee-Sun, 1996c, Construction of Korean electronic lexical system DECO, Papers in Computational Lexicography Complex '96, ed. by Ferenc Kiefer, Gabor Kiss et Julia Pajzs, Budapest : Linguistics Institute, Hungarian Academy of Sciences.", |
| "links": null |
| }, |
| "BIBREF18": { |
| "ref_id": "b18", |
| "title": "Classification syntaxique des constructions adjectivales en cor~en", |
| "authors": [ |
| { |
| "first": "Jee-Sun", |
| "middle": [], |
| "last": "Nam", |
| "suffix": "" |
| } |
| ], |
| "year": 1996, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Nam, Jee-Sun, 1996d, Classification syntaxique des constructions adjectivales en cor~en, Amsterdam-Philadelphia: John Benjarnins Publishing Company.", |
| "links": null |
| }, |
| "BIBREF19": { |
| "ref_id": "b19", |
| "title": "Lexique-Grammaire des adjecfifs cor~ens et analyses syntaxiques automatiques", |
| "authors": [ |
| { |
| "first": "Jee-Sun", |
| "middle": [], |
| "last": "Nam", |
| "suffix": "" |
| } |
| ], |
| "year": 1997, |
| "venue": "", |
| "volume": "124", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Nam, Jee-Sun, 1997, Lexique-Grammaire des adjecfifs cor~ens et analyses syntaxiques automatiques, Langages N\u00b0124, Paris : Larousse.", |
| "links": null |
| }, |
| "BIBREF20": { |
| "ref_id": "b20", |
| "title": "On Abstract Finite-State Morphology", |
| "authors": [ |
| { |
| "first": "~", |
| "middle": [], |
| "last": "", |
| "suffix": "" |
| }, |
| { |
| "first": "Tar93", |
| "middle": [ |
| "]" |
| ], |
| "last": "Narayanan", |
| "suffix": "" |
| }, |
| { |
| "first": "Ajit; Lama", |
| "middle": [], |
| "last": "Hashem", |
| "suffix": "" |
| } |
| ], |
| "year": 1993, |
| "venue": "Proceedings of the 6th Conference of the European Chapter of the Association for Computational Linguistics", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "~,Tar93]Narayanan, Ajit; Lama Hashem, 1993, On Abstract Finite-State Morphology, Proceedings of the 6th Conference of the European Chapter of the Association for Computational Linguistics, Utrecht, The Netherlands.", |
| "links": null |
| }, |
| "BIBREF22": { |
| "ref_id": "b22", |
| "title": "Simple Word Strings as Compound Keywords: An Indexing and Ranking Method for Japanese Texts", |
| "authors": [ |
| { |
| "first": "M", |
| "middle": [], |
| "last": "Hirose", |
| "suffix": "" |
| } |
| ], |
| "year": 1993, |
| "venue": "Proceedings of the 16th Annual International ACM SIGIR", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "M.Hirose, 1993, Simple Word Strings as Compound Keywords: An Indexing and Ranking Method for Japanese Texts, Proceedings of the 16th Annual International ACM SIGIR, Pittsburgh, USA.", |
| "links": null |
| }, |
| "BIBREF23": { |
| "ref_id": "b23", |
| "title": "An Implementation of an Automatic Keyword Extraction System", |
| "authors": [ |
| { |
| "first": "Se-Young", |
| "middle": [], |
| "last": "Park", |
| "suffix": "" |
| } |
| ], |
| "year": 1994, |
| "venue": "Proceedings of Pacfic Rim International Conference on Artificial Intelligence '94", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Park, Se-Young et al., 1994, An Implementation of an Automatic Keyword Extraction System, Proceedings of Pacfic Rim International Conference on Artificial Intelligence '94, Beijing, Chine.", |
| "links": null |
| }, |
| "BIBREF24": { |
| "ref_id": "b24", |
| "title": "Korean Corpus-based on News papers", |
| "authors": [ |
| { |
| "first": "Se-Young", |
| "middle": [], |
| "last": "Park", |
| "suffix": "" |
| } |
| ], |
| "year": 1996, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Park, Se-Young et al, 1996, Korean Corpus-based on News papers, ETRI.", |
| "links": null |
| }, |
| "BIBREF25": { |
| "ref_id": "b25", |
| "title": "Automates et algorithmes sur les mo.ts, Annales des T~l~communi-cations", |
| "authors": [ |
| { |
| "first": "Dominique", |
| "middle": [], |
| "last": "Perrin", |
| "suffix": "" |
| } |
| ], |
| "year": 1989, |
| "venue": "", |
| "volume": "1", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Perrin, Dominique, 1989, Automates et algorithmes sur les mo.ts, Annales des T~l~communi- cations, tome 4.4 N 1:2, Issy-les-Moulineaux-Lannion: CNET.", |
| "links": null |
| }, |
| "BIBREF27": { |
| "ref_id": "b27", |
| "title": "Dictionnaires ~lectro-niques et analyse automatique de textes", |
| "authors": [ |
| { |
| "first": "Max", |
| "middle": [], |
| "last": "Silberztein", |
| "suffix": "" |
| } |
| ], |
| "year": 1993, |
| "venue": "Le syst~me INTEX", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Silberztein, Max, 1993, Dictionnaires ~lectro-niques et analyse automatique de textes, Le syst~me INTEX, Paris: Masson.", |
| "links": null |
| }, |
| "BIBREF28": { |
| "ref_id": "b28", |
| "title": "Example-Based Sense Tagging of Running Chinese Text", |
| "authors": [ |
| { |
| "first": "Xiang; Chang-Ning", |
| "middle": [], |
| "last": "Tong", |
| "suffix": "" |
| }, |
| { |
| "first": ";", |
| "middle": [], |
| "last": "Huang", |
| "suffix": "" |
| }, |
| { |
| "first": "Guo", |
| "middle": [], |
| "last": "Cheng-Ming", |
| "suffix": "" |
| } |
| ], |
| "year": 1993, |
| "venue": "Proceedings of the Workshop on Very Large Corpora", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Tong, Xiang; Chang-ning Huang; Cheng-ming Guo, 1993, Example-Based Sense Tagging of Running Chinese Text, Proceedings of the Workshop on Very Large Corpora, Ohio State University, USA.", |
| "links": null |
| }, |
| "BIBREF29": { |
| "ref_id": "b29", |
| "title": "Nom propre et ambiguit~, Langue fran~aise N \u00b0 92", |
| "authors": [ |
| { |
| "first": "Marc", |
| "middle": [], |
| "last": "Wilmet", |
| "suffix": "" |
| } |
| ], |
| "year": 1991, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Wilmet, Marc, 1991, Nom propre et ambiguit~, Langue fran~aise N \u00b0 92, Paris: Larousse.", |
| "links": null |
| } |
| }, |
| "ref_entries": { |
| "FIGREF0": { |
| "type_str": "figure", |
| "text": "I listened to (Masart + classic misic) all day) -,-~ (~_~2~ + ~. ~y_~).~ ~ (He only drinks (Bordeaux + red wine)) The derivation of some other categories from PNs is also observed: ~;~ ~ -~ [in Park JungHee's manner] ~z~.. =~-[France style] ~-. ~-o~ [Chinese (language)]", |
| "num": null, |
| "uris": null |
| }, |
| "FIGREF1": { |
| "type_str": "figure", |
| "text": "PLY). They actually occur in the positions of common nouns, as shown in the following graph (Figure 2): Figure 2. Type I of Nominal Phrases containing PArs Postpositions observed on the right side of nouns (proper or common ones) indicate grammatical functions of the attached noun. When they appear in this context, there are no ways to sort out proper names, only by analyzing their syntactic structures. Let us consider: ~ol \"~\u00b0--1 ~l~1.olr-.1-", |
| "num": null, |
| "uris": null |
| }, |
| "FIGREF2": { |
| "type_str": "figure", |
| "text": "Local grammar of Type II will reduce numerous mismatchings between the strings like (2b) and the combination of the items found in a dictionary.Since a family name alone can precede PTs, the grammar above should be refined (Figure 4):Figure 4. A more detailed Local grammar of Type II Thus we observe (3) instead of(l): (3) ~ ~ =1~,~t 5~ o=~r~ Kim bagsa-neun migug-eise 5 nyengan gongbuha-essda (Dr. Kim has studied in the U.S.A. during 5 years) while a given name alone hardly appears with PTs: .~.~-?-~'~,~--b ~1~1~t 5~Z~ ~ ??MinU bagsa-neun migug-eise 5 nyengan gongbuha-essda (Dr. Min U has studied in U.S.A. during 5 years) When we list the nouns of professional title, the number of PNs recognized by the local grammar presented in Figure 4 will be increased. Nevertheless, listing these nouns up does not guarantee automatically to recognize PArs, since we can come across specific nouns (Spec) inside of these sequences: (4) ,~ ~--mu'~\" u_.~,~]._~. =1~011~ 5~z~ o~-V~Ir~ Kim MinU bebhag bagsa-neun migug-eise 5nyengan gongbuha-essda (Dr. of Laws Kim MinU has studied in U.S.A. during 5 years)", |
| "num": null, |
| "uris": null |
| }, |
| "FIGREF3": { |
| "type_str": "figure", |
| "text": "is one of the most envied social titles) -' (~'+E) ~1--~ ~'~ ~-~'-~ ~t~ geu ('bebhag + E)bagsa-neun iljfig hangug-eul ddena-ssda (This doctor (of Law + E) left Korea early)", |
| "num": null, |
| "uris": null |
| }, |
| "FIGREF4": { |
| "type_str": "figure", |
| "text": "bagsa Kim MinU-neun migug-eise 5 nyengan gongbuha-essda (Kim MinU, Dr. of Laws, has studied in U.S.A during 5 years) The sentence (6) can still be transformed into: ~ ~l~oll,~-I ~ ~ ~ ~,q-olr--l-Kim MinU-neun migug-eise 5 nyengan gongbuha-n bebhag bagsa-ida (Kim MinU is a doctor of Laws who has studied in U.S.A. during 5 years) In fact, the sequence containing PTs corresponds to a simple sentence: PN W-Professional Title W-Professional Title PN S: PN be a W-Professional Title (7a) ~ ~q-~ ~x~ (Tb)ffi ~ed ~x~ ~ ~-(7\u00a2)= z~ ~-~ ~ ~1-x].olr_. t.", |
| "num": null, |
| "uris": null |
| }, |
| "FIGREF5": { |
| "type_str": "figure", |
| "text": "~o_.] o~ .~ 20~olr-l-Kim Min U-eui adeul-eun olhai 20sal-ida PN<Kim Min U>-Gen son-Postp this year 20 years old-be (Kim Min U's son is 20 years-old this year) The Genitive Postposition '\u00b0-4 eui ['s/of]' can be omitted: \u2022 ~ ~ o].~.~-.~.~ 20 ~olr-4\" Kim MinU adeul--eun olhai 20 sal-ida (Kim Min U son [--'s son] is 20 years-old this year) The structure can be formalized in the following graph (Figure 5): Figure 5. Type III of norm phrases containing PNs The strings \"N-(Gen+E) FR\" do not automatically guarantee existence of proper names, since common nouns that have a human feather can also appear with a FR like: (~'~ ~gd + ~:~ ~xl-)-(~ +E) oI-'~'~ -~'~ 20~\u00b01~ (bbang/ib juin+yepfib namja)-(eui+ E) adeul-eun olhai 20 sal-ida ((The baker + The neighbor)'s son is 20 years-old this year)", |
| "num": null, |
| "uris": null |
| }, |
| "FIGREF6": { |
| "type_str": "figure", |
| "text": "Homograph types of'ga' The following sentence illustrates this ambiguity problem: (]) ~71-~3~-~-~ -?-~ 71-~ 71-~71-~-~tl ~--?-~7l-,:,.II x.~ ~ 71-~ ~_ _v_ ~ ~, ~ oo~71-~,~", |
| "num": null, |
| "uris": null |
| }, |
| "FIGREF7": { |
| "type_str": "figure", |
| "text": "Local grammar of PNs", |
| "num": null, |
| "uris": null |
| }, |
| "FIGREF8": { |
| "type_str": "figure", |
| "text": "[/s/]. For example, in the following sentences, a PostHN %il nei ['s family/house]' appears with a PN alone, or with a PN followed by an/N (here, ~1 ssi [Mr.]): ~417} el =]--~*tlxt ~ql~ ~xl~'rq\" MinU-nei-ga imaeul-eise jeiil bujilenha-da PN<MinU>-PostHN[farnily]-Postp this village-Postp most diligent-St (MinU's family is most diligent in this village) 7,~..9_a]~lo~lx t -~o1 ~rq-GangGinO-ssi-nei-eise PN<Kang GinO>-IS[Mr.]-PostHN[house]-Postp fire-Postp occur-Past (There was a fire in Mr. Kang GinO's house)", |
| "num": null, |
| "uris": null |
| }, |
| "FIGREF9": { |
| "type_str": "figure", |
| "text": "510 analyses of\" ~' 7]-~-' 1] ~ jang-ga-nei-neun\" According to the local grammars we have constructed, we get the following result for this string (Figure 12): <PN.f.name> <IN:Mr.> <PostHN:family> <PosT:subject> Figure 12. Accurate analysis of the string inFigure 11", |
| "num": null, |
| "uris": null |
| }, |
| "FIGREF10": { |
| "type_str": "figure", |
| "text": "[1 ] ~ ~q 7] eg-ssi-gi [6] o]-7].~], aga-ssi, [2] \u00b0~]---~--a\" ib-ssi-leumeul [7] :z]]~]y~ jei-ssi-doineun [3] o]-7}~ ~ aga-ssi-lan [8] ~ ~ ~ nal-ssi-yessda [4] o].y].~]~ aga-ssi-du [9] ~Y~ nal-ssi-ga [5] o].y~ ~ aga-ssi-la Looking up our dictionaries of Korean Simple Nouns (DECOS-NSN01) [Nam94], and of Korean Postpositions (DECOS-POST/V01) [Nam96b] eliminate [2], [3], [4], [5], [6], [8], [9], which are the sequences composed of a common noun and a postposition (or a typographical separator such as a comma). Because [1] is a dialectal adverb, and [7] a 'Noun-Verb' string, they were not detected in our system.The third text composed of 33982 characters contains 10 occurrences of ~'-ssi\" one of which is a nonPN ('.~-01 peulo ssi-leumi [N/N/Postp]') (Figure 16): Figure 16 This nonPNwas eliminated after looking up the dictionary of Postpositions: there is no postposition '~o] leumi'. The analysis of the text above on the basis of the local grammar presented in Figure 3 (Type II <PN Spec-PT-(Posq~ + E)> ) in 2.2. allows to recognize PNs in a more satisfactory way. Besides ~-ssi\" strings, with two PTs: '~-~-~ daitonglyeng [the President]' and '~ susa~g [the prime minister]', we could recognize 73 % of PNs, that is, 49 occurrences of 67 (i.e. Recall is 0.73). However, use of the local grammars of Figure 13 and Figure 3 (only with these two PTs above) leaves some nonPNs: Precision is 0.7 (49 strings of 70 which occurred with these/N and PTs are PNs). Since our goal is to recognize most contexts where PNs can occur, in order to consn'uct a lexicon of FNs as complete as possible, Recall should be more important than Precision in our system. By adding a few more PTs (cf. Type II) such as '~--~ janggun [general]', '~ sensu [player]', FRs (cf. Type III) such as '~l.~ bunye [father-daughter]', or/Ns (cf. Type V) such as '\u00b0o z yang [Miss.]' in the lexicon on the basis of which our local grammars are constructed, we could obtain a more reliable result as shown in the following table (Figure 17): increases: 0.88, whereas Precision goes down: 0.66. The 8 PNs that are not retrieved by our local grammars are given below. Actually, their contexts are hard to determine, since they are syntactically identical with contexts where common \u2022nouns can appear: [2] \"\u00a2 ot-~\"l'\u00b0A [3] '~s~l'\u00a2 [4] ~q~ ~x~]e.]-", |
| "num": null, |
| "uris": null |
| }, |
| "TABREF1": { |
| "html": null, |
| "content": "<table><tr><td>Sa)ol~ ~,1-71-~71~ -~r~</td></tr><tr><td>igonggyei bagsa-ga ingi-ga nop-da (Doctors of Natural Science are highly requested)</td></tr><tr><td>(Sb)o I ~ ~x~7~ ~71~ ~</td></tr></table>", |
| "type_str": "table", |
| "text": "(Sc)ol ~ ~'l'~ ~ 21 21-~r4iminu bagsa-ga ingi-ga nop-da (Doctor Lee MinU is highly requested) In (Sa), the string found with 'bagsa [doctor]' is a simple noun 'igonggyei [natural science]'; the sequence that precedes 'bagsa [doctor]' in (5b) is a phrase composed of a determiner 'i [this]' and a common noun 'gonghag [science]'", |
| "num": null |
| }, |
| "TABREF2": { |
| "html": null, |
| "content": "<table><tr><td/><td/><td>Kim MinU-neun bebhag bagsa-ida</td></tr><tr><td/><td/><td>[KimMinU is a Dr. of Law]</td></tr><tr><td colspan=\"3\">2.3. Type HI <PN-(Gen+E) Family Relation-(Postposition+E) ></td></tr><tr><td colspan=\"3\">This type of phrases contains nouns designating a family relation (FR) such as:</td></tr><tr><td>o)~</td><td>adeul</td><td>[son]</td></tr><tr><td>o~x]</td><td>~eji</td><td>[father]</td></tr><tr><td>~</td><td>che</td><td>[wife]</td></tr><tr><td>;~</td><td>sonja</td><td>[~andchild]</td></tr><tr><td>~ ~</td><td>myenegli</td><td>[daughter-in-law]</td></tr></table>", |
| "type_str": "table", |
| "text": "Kdm MinU bebhag bagsa [Dr. of Law Kim MinU] bebhag bagsa Kim MinU [KJm MinU, Dr. of Law,]", |
| "num": null |
| }, |
| "TABREF3": { |
| "html": null, |
| "content": "<table><tr><td>I</td><td/><td/><td/><td/><td>II</td></tr><tr><td>I !</td><td>?*~@ l ?*~d'-vd -! ~] ssi \u00b0o~ yang 7]-ga ~d nim</td><td colspan=\"3\">?*gyosu ! ?*/anggwan ! [Minister !] [Professor !] [Mr. / Miss. / Mrs.] Suffix2 value [Miss.] [Mr. <pejorative>] Suffix3 family Suffix4 music [Mr. / Miss. / Mrs. <respectful>] Suff'tx5 person</td><td>71. -8-~ ~1\" ~& T]-</td><td>I I</td></tr><tr><td/><td>-~ gun</td><td colspan=\"2\">[Mr.<young boy>] Suffix6</td><td>boundary</td><td>~T1-</td></tr><tr><td>I</td><td colspan=\"4\">gyosu-nira!/Kim MinU gyosu! janggwan-niml/Kim janggwan! [Mr. <old man>] Suffix7 area Verb go Let us consider: ong Pos~position Nominative</td><td>~ ~-71. ,~ q.71. ~ ~ ~ ~ 71.</td><td>I</td></tr><tr><td>I l</td><td colspan=\"5\">~\u00b0~o1 lz'l~r--1-PN<Kim> -IN[Miss.] -Postp leave-Past Kim-yang-i ddena-ssda Notice that PNs vary according to/Ns. The following table represents different types (Figure 7): (Miss. Kim left) :. Name G. Name Full Nam, ' ~1 ssi f \" \u00b0o~ yang + + .4-+ + \u00f7 Semantically, *ProperName FamilyName ! PN<Kim MinU> -IN[Mr.] -Postp come-Past (Mr. Kim MinU came) ~7]-~rff KimMinU-ssi-ga wa-ssda Terminal Sfx Interrogation ~ ~ ~ 7]-?</td><td>I I I</td></tr><tr><td/><td colspan=\"2\">,~ z~ ! e~ ~d ! senbainim ! yenggam ! ~ ! nuna ! ,L1 q ! enni ! such as: (1)*~ ~--?-o'l-~lal ! 7~ ga , ~nim -~ gun \u2022 Wo.]~q q ! ! @ong</td><td colspan=\"2\">[Sir !] [Senior !] [Elder sister ! (for a boy)] [Elder sister ! (for a girl)] + ---+ + + \u00b0</td><td>+ + +</td><td>l I</td></tr><tr><td/><td colspan=\"5\">! .9.~. ! names. Compare (I) with: hyeng ! (2)zd~@~ ! KimMinUhyeng! [VT:BrotherKimMinU!] [Elder brother ! (for a boy)] ~ ! Park hyeng ! [VT: Colleague Park !] ~o~ ~ ! Park yenggam [VT: Sir Park !] @ ~. ~ ! Minu obba ! [VT: Brother MinU [] 8): obba Kim MinU Wenjangnim ! [PT: Professor Kim !] [PT: Director Kim MinU !] o~ z] ! abeji ! [FR: Father I] o~ ~ q ! emeni ! [FR: Mother !] :.name alone G.name alone Full name , ~1 hyengl [ -\u00f7 \"4-2 hyeng2 + -.p..m]-obba [ + + o~ :~ yenggam [ + -+ \u00f7 .4-+ Figure 6. Some FTs with their associated PNtypes ~d~ senbai [ 2.5. Type V <PN Incomplete Noun-(Postposition+E)> Figure 8. FSA of PN-IN These nouns (/Fype Part of Speech Meaning \" Examph Incomplete N. Mr.</td><td>with proper ; i I s</td><td>I II ! l II i .11</td></tr><tr><td/><td/><td>Simple Noun Prefix 1 Prefix2</td><td/><td>grade dance provisory</td><td>--~@=] \u00b0~7} 7}-~ 7}4 ~o ~</td><td>I</td></tr><tr><td/><td/><td>Suffixl</td><td/><td>[ letter</td><td>~ 71.</td><td>I!</td></tr><tr><td/><td/><td/><td/><td/><td>!</td></tr></table>", |
| "type_str": "table", |
| "text": "Then, one should either attach to them a vocative suffix such as '~d him', or adjoin them to proper names: PTs designate professions, the list of which we can determine a priori, while ITs are more vague and non-predictable without examining pragmatic situations: the latter are closer to the nouns of Family Relation (FR), since, as mentioned above, they imply familial or social relations between a speaker and his interlocutor(s).\u2022 4. Difference between FT and FRWhat we call nouns of Family Relation (FR) cannot appear with a proper name when they are used in the vocative case. Thus, is not allowed the internal structure:This type of Noun Phrase is similar to the preceding one: what we call Incomplete Nouns (IN) is also used for social appellation. However, they are different from the preceding ones by the fact that they do not have syntactic autonomy, and therefore they never can appear alone in any positions of a sentence. Here is their list: Ns), syntactically and semantically incomplete, always require proper names to their left side. In this sense, this type of contexts is appropriate to PNs: if an 1N is recognized, we can be assured to fred a PN near to it. In spite of this strong constraint, since all/Ns are mono-syllabic, ambiguity problems are often hard to handle. For example, the 1N '71. ga [Mr.]' is an homograph of several items. Let us consider some of them (Figure 9):", |
| "num": null |
| }, |
| "TABREF5": { |
| "html": null, |
| "content": "<table><tr><td/><td>I</td></tr><tr><td>Type I. Noun Position :</td><td>I</td></tr><tr><td>\u2022 ~</td><td/></tr><tr><td/><td>I</td></tr><tr><td/><td>I</td></tr><tr><td/><td>I</td></tr><tr><td/><td>I</td></tr><tr><td>'-,'. I</td><td>I</td></tr><tr><td>i</td><td>i</td></tr><tr><td>!</td><td>I</td></tr><tr><td>I</td><td>I</td></tr><tr><td>!</td><td>I</td></tr><tr><td>I</td><td>I</td></tr><tr><td>!</td><td/></tr><tr><td>!</td><td>I</td></tr><tr><td>!</td><td>i</td></tr><tr><td>|</td><td>I</td></tr><tr><td>!</td><td>I</td></tr><tr><td>!</td><td>I</td></tr><tr><td>!</td><td/></tr></table>", |
| "type_str": "table", |
| "text": "Type II. With Professional Title(PT) : ,\u00a2. Type III. With Family Relation (FR) : Type IV. With Vocative Term (VT) : \u2022 ~. Type V. With Incomplete Noun (IN) :", |
| "num": null |
| }, |
| "TABREF7": { |
| "html": null, |
| "content": "<table><tr><td>II</td><td/><td/><td/><td>!1</td></tr><tr><td>I</td><td/><td/><td/><td>I</td></tr><tr><td>I</td><td colspan=\"3\">(2a) PN-<Type I/> -<Type 111> -PostHN-Noun -Postp (2b) PN-<Type 11> -<Type III> -PostHN-Postp</td><td>II</td></tr><tr><td>I</td><td colspan=\"2\">(2c) PN-<Type IF> -PostHN-Postp</td><td/><td>II</td></tr><tr><td>I</td><td/><td/><td/><td>I</td></tr><tr><td>I</td><td>kira</td><td>1. Noun = steam 2. Noun = dried laver 3. Noun = hope 4. Completive Noun = chance</td><td>[e.g. ~ ol ~-] [e.g. ~ g]'] [e.g. ~o] ~r.Jc ] [e.g. -~ ~ ~... ]</td><td>I</td></tr><tr><td>I</td><td/><td/><td/><td>I</td></tr><tr><td>i</td><td/><td/><td/><td/></tr><tr><td/><td colspan=\"2\">dong~ing-nei-jib-wun aju keu..da</td><td/><td/></tr><tr><td/><td colspan=\"3\">PN<Kim>-IN-brother-PostHN-appartment-Postp very large-St</td><td/></tr><tr><td/><td colspan=\"3\">(The appartment of Mr.Kim's brother's family is very large)</td><td/></tr><tr><td/><td colspan=\"3\">Kim MinU bagsa-nim-adeul-nei-eise janchi-ga yelli-essda</td><td/></tr><tr><td/><td colspan=\"3\">PN<Kim MinU>-.doctor-Sfx-son-PostHN-Postp party-Postp occur-Past</td><td/></tr><tr><td/><td colspan=\"3\">(There was a party in Dr. Kiln MinU's son's family's house)</td><td/></tr><tr><td/><td colspan=\"2\">GinO hyeng-nim-nei-lo modu ga-ja !</td><td/><td/></tr><tr><td/><td colspan=\"3\">PN<GinO>-brother-Sfx-PostHN-Postp together go-St</td><td/></tr><tr><td/><td colspan=\"2\">(Let's go together to Brother GinO's house !)</td><td/><td/></tr></table>", |
| "type_str": "table", |
| "text": "Here, several of the noun phrases we have examined so far occur piled together. The internal structures of the examples above are respectively: Hence, by providing information about the combinations of these strings, we could rise the accuracy in recognizing PNs. For example, the string that includes the sequence ~]..~ z~ 41 ~ ssi-dongsaing-neijib in (la) can hardly be anything else than a noun phrase containing a PN. Thus, even though we :find several entries :~ lkim in the lexicon of nouns, such as:", |
| "num": null |
| } |
| } |
| } |
| } |
