http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Lee Kiyong (검색결과 115 건)
- 무료
- 기관 내 무료
- 유료
-
The Treatment of Tense in Situation Semantics
Lee, Kiyong 서울대학교 어학연구소 1992 語學硏究 Vol.28 No.4
In this paper, the four classical issues involving definite or dynamic interpretations of tense are first reviewed, as discussed in Hinrichs (1987). Then, an attempt is made to solve them in a situation-theoretic framework a` la Barwise (1989) with the notions of described, discourse, resource or background situations. For semantic composition, Yoo and Lee’s (1988) equation solving approach is adopted to treat Hinrichs’s tensed sentences. Finally, described and discourse situations are differentiated by the notions of temporal localization, connectedness, and dynamicity to state constraints on discourse situations and then properly to induce the dy namic or rational interpretation of a discourse.
-
Revising ISO-Space for the Semantic Annotation of Dynamic Spatial Information in Language
( Kiyong Lee ) 한국언어정보학회 2018 언어와 정보 Vol.22 No.1
ISO-Space refers to the ISO-Space (2014b) annotation standard for spatial information in language. Soon after its publication, Lee (2016) and Pustejovsky and Lee (2017) noted its failure to conform to the principles of semantic annotation laid down in the principles of semantic annotation (ISO 2016) and also its inadequacy to capture the dynamic aspect of spatial information involving trajectories created by motions. This paper thus proposes to revise ISO-Space to focus on the dynamic aspect of spatial information, while making the revised version, tentatively named ”I-Space”, conform to the ISO (2016) principles of semantic annotation. For this revision, four modifications are introduced. First, event-paths are formally defined as sequences of spatio- temporal locations associated with motional trajectories. Second, these trajectories are treated as genuine spatial entities of the event-path type in their annotation structures. Third, the link, tagged < moveLink >, in ISO-Space is re-formulated as a relation between a moving object and an event-path traversed by that object. Fourth, the spatial measure link, tagged < mLink >, in ISO-Space is generalized to cover spatiotemporal measures involving both space and time, and motions.
-
A Simple Syntax for Complex Semantics
( Kiyong Lee ) 한국언어정보학회 2002 국제 워크샵 Vol.2002 No.-
As part of a long-ranged project that aims at establishing database-theoretic semantics as a model of computational semantics, this presentation focuses on the development of a syntactic component for processeing strings of words or sentences to construct semantic data structures. For design and modeling purposes, the present treatment will be restricted to the analysis of some problematic constructions of Korean involving semi-free word order, conjunction and temporal anchoring, and adnominal modification and antecedent binding. The present work heavily relies on Hausser``s (1999, 2000) SLIM theory for language that is based on surface compositionality, time-linearity and two other conditions on natural language processing. Time-linear syntax for natural language has been shown to be concep-tually simple and computationally efficient. The associated semantics is complex, however, because it must deal with situated language involving interactive multi-agents. Nevertheless, by processing input word strings in a time-linear mode, the syntax can incrementally construct the necessary semantic structures for relevant queries and valid inferences. The fragment of Korean syntax will be implemented in Malaga, a C-type implementation language that was enriched for both programming and debugging purposes and that was particluarly made suitable for implementing in Left-Associative Grammar. This presentation will show how the system of syntactic rules with constraining subrules processes Korean sentences in a step-by-step time-linear manner to incrementally construct semantic data structures that mainly specify relations with their argument, temporal, and binding structures.
-
-
-
A Rule-Based Analysis from Raw Korean Text to Morphologically Annotated Corpora
( Kiyong Lee ),( Markus Schulze ) 한국언어정보학회 2002 언어와 정보 Vol.6 No.2
Morphologically annotated corpora are the basis for many tasks of computational linguistics. Most current approaches use statistically driven methods of morphological analysis, that provide just POS-tags. While this is sufficient for some applications, a rule-based full morphological analysis also yielding lemmatization and segmentation is needed for many others. This work thus aims at [1] introducing a rule-based Korean morphological analyzer called Kormoran based on the principle of linearity that prohibits any combination of left-to-right or right-to-left analysis or backtracking and then at [2] showing how it on be used as a POS-tagger by adopting an ordinary technique of preprocessing and also by filtering out irrelevant morpho-syntactic information in analyzed feature structures. It is shown that, besides providing a basis for subsequent syntactic or semantic processing, full morphological analyzers like Kormoran have the greater power of resolving ambiguities than simple POS-taggers. The focus of our present analysis is on Korean text. (Korea University and Universitat Erlangen-Nurnberg)
-
-
-
-
Recursion Problems in Concatenation: A Case of Korean Morphology
( Kiyong Lee ) 한국언어정보학회 1995 국제 워크샵 Vol.1995 No.-
Without properly constraining recursions in generation, no language system can effectively operate. This is especially so with morphological generation, for each well-formed word must be finite in length and is ac-cepted as such only when it actually occurs in text or ordinary usage. This difficulty is compounded when a language system tries to maintain a single rule of concatenation and apply it repeatedly in order to combine a nominal or verbal stem with a sequence of suffixes in a time-linear man-ner. In an agglutinative language like Korean, however, it can easily be demonstrated how a language system like Malaga, based on time-linear grammars like Hausser``s [1] Left-Associative Grammar, can properly be implemented to constrain undesirable recursive loops in generation. Both nominal and verbal concatenations in Korean are treated in this paper to show how infinite loops can be blocked by imposing appropriate matching conditions on two adjacent input strings to concatenation.
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
