• Journal of the Korean Society for information Management
• /
• v.18 no.4
• /
• pp.37-55
• /
• 2001

The purpose of this study is to present a text summarization system using a knowledge base containing information about verbs and their arguments that are statistically obtained from a subject domain. The system consists of two modules: the training module and the summarization module. The training module is to extract cue verbs and their basic sentence patterns by counting the frequency of verbs and case markers respectively, and the summarization module is substantiate basic sentence patterns and to generate summaries. Basic sentence patterns are substantiated by applying substantiation rules to the syntactics structure of sentences. A summary is then produced by connecting simple sentences that the are generated through the substantiation module of basic sentence patterns. ‘robbery’in the daily newspapers are selected for a test collection. The system generates natural summaries without losing any essential information by combining both cue verbs and essential arguments. In addition, the use of statistical techniques makes it possible to apply this system to other subject domains through its learning capability.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.9 no.4
• /
• pp.958-963
• /
• 2008

Korean language has different structural properties which are controlled by semantic constraints of verbs. Also, most of Korean sentences are complex sentences which consisted of main clause and embedded clause. Therefore it is difficult to describe appropriate syntactic grammar or constraint for the Korean language and the Korean parsing causes various syntactic ambiguities. In this paper, we suggest how to describe CFG-based grammar using sentence patterns as syntactic constraint and solve syntactic ambiguities. To solve this, we classified 44 sentence patterns including complex sentences which have subordinate clause in Korean sentences and used it to reduce syntactic ambiguity. However, it is difficult to solve every syntactic ambiguity using the information of sentence patterns. So, we used semantic markers with semantic constraint. Semantic markers can be used to solve ambiguity by auxiliary particle or comitative case particle.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.6
• /
• pp.69-77
• /
• 2017

The information related to legislation is massive, and it takes much time and effort to manually build the legislation ontology. Thus, studies on machine-based automated building methods are underway. However, the studies to automatically construct such systems focus on using TBox construction, and those based on automated ABox construction, which corresponds to instances, theoretical systems and data building cases, has not yet been sufficiently developed. Therefore, this paper suggests using a semi-automatic ABox construction method based on sentence patterns to automatically build the ontology for the legislation of the Republic of Korea. Precision and Recall experiments were conducted to further discuss the performance of the suggested method. These experiments provide a comparison between the manual classification, and the triples built by the machines of the legal information by assessing the corresponding numerical values.

• MALSORI
• /
• no.33_34
• /
• pp.23-42
• /
• 1997

This study has two main purposes. One is to explore the relationship between syntactic aspects and prosodic aspects in Standard Korean. The other is to provide speech synthesis with the information about such relationship. This study will focus on the prosodic behavior of subjective particles'-i/-ga', '-eun/-neun'. The prosodic features of subjective particles are described respectively. How do the elements such as the position of particles in a sentence, the sentence constituents, the length of the sentence and the rhythmic boundaries influence on the prosodic behavior are also investigated.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06c
• /
• pp.242-247
• /
• 2008

This paper discusses a design for Korean language parsing based on subcategorization. First, we discuss some important Korean grammar elements such as syntax category, josa, omi-conjugation, syntactic affix, dependent noun and also discuss subcategorization and expression patterns. Then, we show the basic structure of Korean language parsing process. The first stage scans the input sentence and processes article, noun phrase, numeral, josa, affix, dependent noun, adjective, omi-conjugation, adverb, auxiliary verb. The second stage deals with subcategorization patterns and expression patterns. The third stage processes the clauses and the fourth stage deals with SEA(Sentence Ending+Auxiliary).

• Proceedings of the Korea Contents Association Conference
• /
• 2004.11a
• /
• pp.470-475
• /
• 2004

In this paper, we propose a method to extract a definitional answer sentence for a Definitional Question-Answering System. definitional answer sentence patterns are manually constructed with restriction rules to patterns, and a ranking information of the pattern using its frequency from the corpus. answer sentence pattern consists of the syntactic structure of a definitional answer sentence, and clue words. this system show 83% accuracy for untrained corpus.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.9
• /
• pp.2361-2368
• /
• 1998

This paper analyzes Korean spoken language and describes the machine translation o[ Korean to-English spoken language based on semantic patterns, In Korean-to-English machine translation. ambiguity of Korean sentence analysis using syntactic information can be resolved by semantic patterns, Therefore, for machine translation of spoken language, we estabilish the system based on semantic patterns extracted from Korean scheduling domain, This system obtains the robustness by skip ability of syllables in analysis of Korean sentence and we add options to semantic patterns in order to reduce pattern numbers, The data used [or the experiment are scheduling domain and performance of Korean-to-English translation is 88%.

• Journal of KIISE:Software and Applications
• /
• v.32 no.5
• /
• pp.396-405
• /
• 2005

Since sentences are the basic propositional units of text, their themes would be helpful for various tasks that require knowledge about the semantic content of text. Despite the importance of determining the theme of a sentence, however, few studies have investigated the problem of automatically assigning the theme to a sentence. Therefore, we propose a sentence theme allocation scheme based on the head-driven patterns of sentences in encyclopedia. In a serious of experiments using Dusan Dong-A encyclopedia, the proposed method outperformed the baseline of the theme allocation performance. The head-driven pattern 4, which is reconfigured based on the predicate, showed superior performance in the theme allocation with the average F-score of $98.96\%$ for the training data, and $88.57\%$ for the test data.

• Language and Information
• /
• v.4 no.1
• /
• pp.97-109
• /
• 2000

Application systems of natural language processing such as machine translation system must deal with actual texts including the full range of linguistic phenomena. But it seems to be impossible that the existing grammar covers completely such actual texts because they include disruptive factors such as long sentences, unexpected sentence patterns and erroneous input to obstruct well-formed analysis of a sentence. In order to solve analysis failure due to the disruptive factors or incorrect selection of correct parse tree among forest parse trees, this paper proposes two-level computational grammar which consists of a constraint-based grammar and an error-tolerant grammar. The constraint-based computational grammar is the grammar that gives us the well-formed analysis of English texts. The error-tolerant computational grammar is the grammar that reconstructs a comprehensible whole sentence structure with partially successful parse trees within failed parsing results.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.6
• /
• pp.761-766
• /
• 2011

A hedge is a linguistic device to express uncertainties. Hedges are used in a sentence when the writer is uncertain or has doubt about the contents of the sentence. Due to this uncertainty, sentences with hedges are considered to be non-factual. There are many applications which need to determine whether a sentence is factual or not. Detecting hedges has the advantage in information retrieval, and information extraction, and QnA systems, which make use of non-hedge sentences as target to get more accurate results. In this paper, we constructed Korean hedge corpus, and extracted generalized hedge cue-word patterns from the corpus, and then used them in detecting hedges. In our experiments, we achieved 78.6% in F1-measure.