• Journal of the Korean Society for information Management
• /
• v.20 no.1
• /
• pp.145-163
• /
• 2003

An indexing language were studied to construct the sentences and paragraphs providing system aided to write a Korean or English composition. The indexing language includes the index terms like noun, predicate, and adverb. and also various index symbols. The subject name and the keyword Included the symbols, which Indicate the connectives between clauses in a sentence, is used as the access point. The search results show this system will be effective with large database and developed retrieval methods.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.2
• /
• pp.149-156
• /
• 2015

In this paper, we propose a Korean sentence symbol preprocessor for a SSML (speech synthesis markup language) supported speech synthesis system in order to improve the quality of the synthesized result. After the analysis of Korean Wikipedia documents, we propose 8 categories for the meaning of sentence symbols and 11 regular expression for the classification of each category. After the development of a Korean sentence symbol preprocess system we archived 56% of precision and 71.45% of recall ratio for 63,000 sentences.

• Proceedings of the KSPS conference
• /
• 1996.10a
• /
• pp.224-228
• /
• 1996

This paper is intended as a study on how an utterance is divided into rhythmic units in Standard Korean with respect to its syntactic structure. With respect to the data in this study I used 150 sentences which contained similar number of words and various syntactic structures. Those sentences were read by 7 speakers of Seoul dialect in a conversation style. Each sentence was read twice in a normal speed and twice in a fast speed. As a total, 4200 sentences were recorded. Then listening to them, the author marked the sentences with two kinds of boundaries i.e. strong and weak. To explore the relationship between rhythmic units and syntactic structure I devised a framework of grammatical symbols. Each symbol is designed to have both syntactic and morphological information at the same time. So I assigned those grammatical symbols to the sentences. Having sentences marked with grammatical symbols on the one hand, and with the rhythmic boundaries on the other hand, 1 could show the relationship between rhythmic units and syntactic structure; which syntactic structures are likely to be pronounced as one rhythmic unit, and which are on the rhythmic boundaries.

• Journal of Elementary Mathematics Education in Korea
• /
• v.17 no.2
• /
• pp.207-223
• /
• 2013

Teachers unfold a series of timeless mathematical symbols such as 5+2=7 in time by verbalizing the symbols in classrooms. A number sentence 5+2=7 is read in Korean as '5 더하기 2는(five plus two) 7과(seven) 같다(equals). Unlike in English, 5+2 and 7 are read first before the equal sign in Korean. This sequence of reading in Korean conflicts with the conventional linguistic sequence of writing from left to right. Ways of resolving the discrepancy between reading and writing sequences can make a difference students' understanding of the equal sign. Students would be in danger of perceiving the equal sign as an operational symbol, if a teacher resolves the discrepancy by subordinating reading sequence to linguistic convention of writing. This way of resolving results in the undesired phenomenon of changing the reading expressions in Korean elementary math textbook which represent relational notion of the equal sign into other reading expressions that represent operational notion of it. For understanding of relational notion of the equal sign, the discrepancy should be resolved by changing writing sequence in accordance with reading sequence. In addition, teaching of verbalizing the equal sign should be integrated with teaching of verbalizing inequality signs.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.8 no.3
• /
• pp.225-230
• /
• 2008

In this paper we embody a system that recognizes printed alphabet, numeral figures and symbols written on the keyboard for the recognition of English sentences. The image of the printed sentences is inputted and binarized, and the characters are separated by using histogram method that is the same as the existing character recognition method. During the abstraction of the individual characters, we classify one group that has not numerical information by the projection of the vertical center of the character. In case of another group that has the longer width than the height, we assort them by normalizing the width. The other group normalizes the height of the images. With the reverse application of the basic principle of the Japanese Puzzle to a normalized character image, the proposed system classifies and recognizes the printed numeral figures, symbols and characters, consequently we meet with good result.

• Proceedings of the Korean Society of Agricultural Engineers Conference
• /
• 1998.10a
• /
• pp.150-154
• /
• 1998

Database schema is designed to accumulate the literal information automatically such as reinforced concrete design specifications. Sentence of design knowledge with literal data, numerical data, and symbols have analyzed manually. Finally, the proposed method has been shown that by proper design of the database schema of knowledge information as a function of design rule.

• Journal of Digital Contents Society
• /
• v.17 no.3
• /
• pp.203-210
• /
• 2016

Korean is free of omission of sentence elements and modifying scope, so managing it on morphological analyzer is better than parser. In this paper, we propose functional expansion methods of the morphological analyzer to ease the burden of parsing. This method is a longest phrase matching method. When the series of several morpheme have one syntax category by processing of Unknown-words, Compound verbs, Compound nouns, Numbers and Symbols, our method combines them into a syntactic unit. And then, it is to treat by giving them a semantic features as syntax unit. The proposed morphological analysis method removes unnecessary morphological ambiguities and deceases results of morphological analysis, so improves accuracy of tagger and parser. By empirical results, we found that our method deceases 73.4% of Parsing tree and 52.4% of parsing time on average.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.7
• /
• pp.285-292
• /
• 2014

A named entity recognition method is used to improve the performance of information retrieval systems, question answering systems, machine translation systems and so on. The targets of the named entity recognition are usually PLOs (persons, locations and organizations). They are usually proper nouns or unregistered words, and traditional named entity recognizers use these characteristics to find out named entity candidates. The titles of books, movies and TV programs have different characteristics than PLO entities. They are sometimes multiple phrases, one sentence, or special characters. This makes it difficult to find the named entity candidates. In this paper we propose a method to quickly extract title named entities from news articles and automatically build a named entity dictionary for the titles. For the candidates identification, the word phrases enclosed with special symbols in a sentence are firstly extracted, and then verified by the SVM with using feature words and their distances. For the classification of the extracted title candidates, SVM is used with the mutual information of word contexts.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.454-456
• /
• 2005

일반적으로 중국어의 명사구는 최단명사구, 기본명사구 최장명사구로 분류된다. 최장명사구에 대한 정확한 식별은 문장의 전체적인 구조를 파악하고 문장의 정확한 지배용언을 찾아내는데 중요한 역할을 한다. 본 논문에서는 특성에 따라 5개의 클래스로 세분화된 문장부호를 학습자질로 사용하여 최장명사구 자동식별을 진행한다. 제안된 기법은 평균길이가 4인 최장명사구의 식별실험에서 기본모델(baseline)보다 $4.5\%$ 향상된 평균 $85.1\%$의 우수한 F-measure 성능을 보인다.

• Journal of Korean Philosophical Society
• /
• v.116
• /
• pp.257-280
• /
• 2010

I try to formalize the system of modal logic and interpret it in view of constructivism through this study. As to the meaning of a sentence, as we saw, Frege endorsed extensions in view of the fact that they are enough to provide for a compositional account for truth, in particular that (1) the assignment of extensions to expressions is compositional ; (2) the assignment of extensions to sentences coincides with the assignment of truth values. But nobody would be willing to admit that a truth value is what a sentence means and that consequently all true sentences are synonymous. So, if what we are after is meaning in the intuitive sense, then extensions would not do. This consideration has later become the point of departure of modal and intensional semantics. So, it is clear that the language of modal logic do not allow for an extensional interpretation. ${\square}$ is syntactically on a par with ${\vdash}$, hence within the extensional framework it would have to denote a unary truth function. This means that if modal logic is to be interpreted, we need a semantics which is not extensional. The first attempt to build a feasible intensional semantics was presented by Saul Kripke. He came to the conclusion that we must let sentences denote not truth values, but rather subsets of a given set. He called elements of the underlying set possible world. Hence each sentence is taken to denote the set of those possible world in which it is true. This lets us explicate necessity as 'truth in every possible world' and possibility as 'truth in at least one possible world'. But it is clear that the system of modal logic is not only an enlargement of propositional logic, as long as the former contains the new symbols, but that it is of an other nature. In fact, the modal logic is intensional, in that the operators do not determine the functions of truth any more. But this new element is not given a priori, but a posteriori from construction by logicist.