• Bulletin of the Korean Mathematical Society
• /
• v.8 no.1
• /
• pp.9-15
• /
• 1971

The purpose of this note is to use primitive recursive functions and predicates similar to those presented by Davis [2] to show the well-known result first proved by Godel in [3] that the well-formed formulas of a pure functional calculus form a recursive set. The technique shown in this paper immediately suggests a unique approach to Theorem proving using a computer.

• Journal of Korea Society of Industrial Information Systems
• /
• v.7 no.3
• /
• pp.74-80
• /
• 2002

There are many researches on post-processing methods for the Korean continuous speech recognition enhancement using natural language processing techniques. It is very difficult to use a formal morphological analyzer for improving the speech recognition because the analysis technique of natural language processing is mainly for formal written languages. In this paper, we propose a speech recognition enhancement model using syntactic unit of morphemes. This approach uses the functional word level longest match which dose not consider spacing words. We describe the post-processing mechanism for the improving speech recognition by using proposed model which uses the relationship of phonological structure information between predicates md auxiliary predicates or bound nouns that are frequently occurred in Korean sentences.

• Journal of Computing Science and Engineering
• /
• v.5 no.4
• /
• pp.294-304
• /
• 2011

Enhancing continuous queries over data streams with temporal functions and predicates enriches the expressive power of those queries. While traditional continuous queries retrieve only the values of attributes, temporal continuous queries retrieve the valid time intervals of those values as well. Correctly evaluating such queries requires the coalescing of adjacent timestamps for value-equivalent tuples prior to evaluating temporal functions and predicates. For many stream applications, the available computing resources may be too limited to produce exact query results. These limitations are commonly addressed through load shedding and produce approximated query results. There have been many load shedding mechanisms proposed so far, but for temporal continuous queries, the presence of coalescing makes theses existing methods unsuitable. In this paper, we propose a new accuracy metric and load shedding algorithm that are suitable for temporal query processing when memory is insufficient. The accuracy metric uses a combination of the Jaccard coefficient to measure the accuracy of attribute values and $\mathcal{PQI}$ interval orders to measure the accuracy of the valid time intervals in the approximate query result. The algorithm employs a greedy strategy combining two objectives reflecting the two accuracy metrics (i.e., value and interval). In the performance study, the proposed greedy algorithm outperforms a conventional random load shedding algorithm by up to an order of magnitude in its achieved accuracy.

• Language and Information
• /
• v.2 no.2
• /
• pp.155-183
• /
• 1998

The purpose of this paper is to explore the syntactic criteria for determining a secondary predicates as a predicate modifier or a conjunction, and to formalize the semantic aspects of the [-ke] structure as a predicate in Korean. Syntactically, the [-ke] structure is considered to be a secondary predicate when the shared arguments appear in both the [-ke] structure and the main verb structure. On the other hand, if they do not appear in both structures, the [-ke] structure is considered to be a connective element. Semantically the [-ke] structure has numerous aspects such as depictives, resultatives, objectivity, and emphasis. The depictives of the secondary predicate can be formalize as $p{\wedge}q$ where p represents a propositional expression of the secondary predicate and q is a propositional expression of the main verb. Resultatives have the logical form $q{\rightarrow}{\Box}p$, because the consequence has to always be true. However, objectivity has the logical form $q{\rightarrow}{\diamondsuit}p$, because the consequence can be either true or false. Emphasis is represented as $q{\rightarrow}p{\uparrow}$ because the secondary predicate represents the polarity of the event.

• Journal of the Korean earth science society
• /
• v.31 no.7
• /
• pp.785-797
• /
• 2010

This study identified the linguistic features of Earth science treatises through the analysis of the register. Data included three Korean treatises that were in geology, atmospheric science, and oceanography. The register of Earth science treatise was as follows: First, there were semantic, referential connections between Themes and Rhemes, that the messages and main points of the texts were expressed coherently and cohesively. Second, some predicates were used which were related to deductive inference, abductive inferences, or causal relation according to the genre elements of each text. The logical relations were not represented by the conjunctions but by the types of predicates. Third, most texts in the treatises showed interpersonally weak relationship using mental predicates related to possibilities, which meant scientists expressed indirectly their interpretation, explanation, or arguments. From these results, we argued that some activities of unpacking the language of science be included in science curriculum in order to improve students' literacy of science texts and understanding scientists' knowledge construction.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2002.02a
• /
• pp.113-122
• /
• 2002

Following Herburger (2000), I will develop an event-based semantics for Japanese emphatic particles which can address the issue of the mechanism of association with focus involving the emphatic particles. The proposed semantics makes use of Herburger's three key ideas: events as basic entities, decomposition of predicates into subatomic formulas, and separation of backgrounded and foregrounded information.

• Journal of the Korean Data and Information Science Society
• /
• v.19 no.1
• /
• pp.1-10
• /
• 2008

The purpose of this research is to compare whether SERVQUAL or SERVPERV AL scale is more excellent when explaining customer satisfaction and repurchase intention. The value of R2 which shows explaining power is used to test the excellence of the scale. As a result of comparison and analysis, SERVPERV AL scale showed better explaining power of customer satisfaction and repurchase intention than SERVQUAL. This result is because SERVPERV AL scale predicates overall estimation on utility of product/service.

• ETRI Journal
• /
• v.31 no.4
• /
• pp.463-465
• /
• 2009

In this letter, we present an event stream processing system that can evaluate a pattern query for a data sequence with predicates. We propose a pattern query language and develop a pattern query processing system. In our system, we propose novel techniques for run-time aggregation and negation processing and apply our system to stream data generated from vehicles to monitor unusual driving patterns.

• Language and Information
• /
• v.14 no.2
• /
• pp.85-101
• /
• 2010

This paper discusses mixed agreement triggered by hybrid pronouns. Hybrid pronouns considered in this paper show number discrepancy in that they are plural in form but singular in meaning. When predicates agree with these hybrid pronouns, the puzzle of number agreement arises: finite verbs show syntactic agreement, while predicate adjectives show semantic agreement. This is explained by three factors in grammar of agreement, the feature specification of agreement controllers, the types of agreement targets, and the Agreement Marking Principle that mediates the relation of two poles of agreement, controllers and targets.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2007.11a
• /
• pp.223-233
• /
• 2007

The so-called Korean BNC (bound noun construction) displays complex syntactic, semantic, and constructional properties. This paper, couched upon a constraint-based approach, two different syntactic structures for the construction with articulated lexical properties for the BNs and relevant predicates. The paper reports an implementation of this analysis in the LKB (Linguistic Knowledge Building) system and shows us that this direction is robust enough to pare relevant sentences.