• Proceedings of the Korean Society for Language and Information Conference
• /
• 2006.06a
• /
• pp.97-110
• /
• 2006

• Journal of the Korean Data and Information Science Society
• /
• v.20 no.6
• /
• pp.1207-1212
• /
• 2009

Basic objective in cluster analysis is to discover natural groupings of items or variables. In general, clustering is conducted based on some similarity (or dissimilarity) matrix or the original input text data. Various measures of similarities (or dissimilarities) between objects (or variables) are developed. We introduce a real application problem of clustering procedure in SPSS when the distance matrix of the objects (or variables) is only given as an input data. It will be very helpful for the cluster analysis of huge data set which leads the size of the proximity matrix greater than 1000, particularly. Syntax command for matrix input data in SPSS for clustering is given with numerical examples.

• Journal of Internet Computing and Services
• /
• v.3 no.4
• /
• pp.19-26
• /
• 2002

Workflow Management Systems(WFMSs) is a software system that supports that specification and execution of business processes. In this paper, we proposed Multi Agent Based Workflow Modeling System which was implemented by Java application. The proposed workflow modeling system is divided into four agents; Session, Organization, Relevant Data. Invoked Application. We adapted ICN(Information Control Net) to check workflow model syntax, And the proposed modeling system provide the function to import/export WPDL which was defined in WfMC.

• Journal of the Korean Society for information Management
• /
• v.17 no.3
• /
• pp.147-170
• /
• 2000

RDF treats all resources independently, that's integrated description model for internet resources description, that provides the model to connect resources that related with the specific resources. This article performs theoretical review of RDF model and syntax specification and RDF schema specification that's a common rule of semanics, structure and syntax those provides search and access in the area of dispersed information environment of internet and Dublin Core that's description element for build metadata. And with this way it's materialized metadata design, schema, DTD of Dublin Core element for building RDF-based metadata that is XML application.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.4
• /
• pp.1092-1102
• /
• 2000

In this paper, we made software components reusable through syntax-analysis method, designed a Viewer for understanding component information, and retrieved similar components by using Enhanced SARM. Because SARM requires a lot of computation time, it was enhanced by reducing unnecessary activation value. Also GUI was designed for component-query relationship and Viewer represents hierarchy diagram of a retrieved component. This system supports facilities which can insert and delete components on diagram. For a component modification, this system supports a editor to rebuild class inheritance relationship. In this paper, SCRS (software components reuse system) is consisted of syntax-analysis method, component-query relationship interface, retrieval (Enhanced SARM), diagram viewer, reuse on diagram, and a editor.

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

Syntax parsers can benefit from speakers' intuition about constituent structures indicated in the input string in the form of parentheses. Focusing on languages like Korean, whose orthographic convention requires more than one word to be written without spaces, we describe an algorithm for passing the bracketing information across the tagger to the probabilistic CFG parser, together with one for heightening (or penalizing, as the case may be) probabilities of putative constituents as they are suggested by the parser. It is shown that two or three constituents marked in the input suffice to guide the parser to the correct parse as the most likely one, even with sentences that are considered long.

• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.4 no.2
• /
• pp.65-73
• /
• 1986

The PM language is a Compiler writing language which syntax- directly translates a high level language into a intermediate language of matrix form. The PM assembler translates the PM language into recursive subroutines which test input strings or output intermediate terms or call another subroutines. A large subset of PASCAL compiler was written in the PM language.

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

One main complexity of the copula constructions concerns a mismatch between morphology and syntactic constituency: the copula seems to form a morphological unit with the immediately preceding element, whereas in terms of syntax the copula appears to take this as its syntactic complement. In capturing such mismatches, we show that the copula is treated as an independent verb at the level of tectogrammatical structure (or syntax tree), whereas as a bound morpheme at the level of phonogram-matical structure (or domain tree), in terms of Dowty 1992 (or Reape 1994). This paper, adopting the notion of DOMAIN in HPSG, shows that copula constructions are a subtype of compacting-constructions. These constructions compact the domain value of the copula and that of its preceding element together into one domain unit, eventually making it inert to syntactic phenomena such as scrambling, deletion and pro-form substitution. This construction-based approach provides a clean analysis for the formation of the copula construction and related phenomena.

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

This paper discusses a Korean-English machine translation method using expression patterns. The expression patterns are defined for the purpose of aligning Korean expressions with appropriate English expressions in semantic and expressive senses. This paper also argues to develop a new Korean syntax analysis method using agglutinative characteristics of Korean language, expression pattern concept, sentence partition concept, and incorporation of semantic structures as well in the parsing process. We defined a simple Korean grammar to show the possibility of new Korean syntax analysis method.

• Language and Information
• /
• v.10 no.2
• /
• pp.1-20
• /
• 2006

This paper is concerned with the distribution and interpretation of yekan and its cognates. Syntactically they require negation, but semantically the sentences in which they occur are positive ones that make monotone increasing inferences possible. This syntax-semantics discrepancy can be best accounted for by showing that yekan and its cousins must be strictly c-commanded by metalinguistic negation at the surface structure and that the positive meaning of the sentences they are part of is derived from the cancellation of the pragmatic upper-bounding implicatum associated with them. These also enable us to explain why they do not occur in the environments where typical NPIs do and why only certain forms of negation license them.