• Koreanishche Zeitschrift fur Deutsche Sprachwissenschaft
• /
• v.3
• /
• pp.211-231
• /
• 2001

Es gibt verschiedene Auffassungen $\"{u}ber$ die Formulierung der Ableitung, wobei nur die Suffixbildung als Ableitung einerseits gelten soll oder andererseits die Suffix- und $Pr\"{a}fixbildung$ zusammen als Ableitung gelten sollen. Hier wird die zweite Auffassung als Ableitung angesehen und danach $geh\"{o}rt$ auch die Zirkumfixbildung zur Ableitung. Das einzige Zirkumfix, mit dem die Substantive abgeleitet werden, ist ge-+-e und dessen Suffix kann gegebenenfalls nicht explizit $ausgedr\"{u}ckt$ werden. Diese Substantivableitung wird zuerst nach der Wortart der Basis und dann nach der Funktion oder Bedeutung $folgenderma{\ss}en$ klassifiziert: 1. Deverbale Substantive: 1) Abstrakta: Gefecht, $Ger\"{a}usch,\;Gest\"{o}ber$ - Wiederholung bzw. Dauer: $Gedr\"{o}hn$, Gekreisch, $Get\"{o}se$ - Pejorative Bewertung: Gejammer, Gerede, Geschreibe 2) Resultat bzw.Produkt: $Gem\"{a}lde$, Gewebe, Gewucher 3) Person bzw. Sache: $Gedr\"{a}nge,\;Gew\"{a}chs,\;Ger\"{o}ll$ 4) Instrumentalia: $Gebl\"{a}se,\;Gefa{\ss}$, Gestell b) Denominale Substantive: Kollektiva: Gehim, $Gel\"{a}nde$, Gerippe

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10c
• /
• pp.88-90
• /
• 2002

최근 인터넷 상에서 XML 문서의 사용이 급속도로 보편화, 일반화됨 따라 정보 검색을 위한 다양한 XML 질의 언어가 제안되고 있다. XML 질의의 공통 특징으로서 ‘*’ 문자 등을 사용한 정규화 경로식(regular path expression)에 의한 손쉬운 구조정보 검색 기능을 들 수 있다. 본 논문에서는 접미어 트리(suffix tree)를 이용한 새로운 경로 인덱싱 기법을 제안한다. 제안하는 기법에서는 XML 문서상의 각 경로를 축약된 유일한 문자열로 인코딩하며, 인코딩 된 각 문자열의 모든 접미어 정보를 인덱스에 저장한다. 본 기법은 일반 정규화 경로식을 포함하는 구조질의를 매우 효율적으로 처리하며, 또한 경로 정보가 부정확하게 기술된 경우에도 관사 질의 처리를 효과적으로 처리할 수 있다.

• Korean Linguistics
• /
• v.81
• /
• pp.267-297
• /
• 2018

Vowel raising in Korean has been primarily treated as a phonological, categorical change. This study aims to show how the Korean connective suffix {-go} is realized in various environments, and propose a principle of vowel raising based on both acoustic and perceptual data. To that end, we used a corpus of spoken Korean to analyze the types of syntactic constructions, the realization of prosodic boundaries (IP and PP), and the types of boundary tone associated with {-go}. It was found that the vowel tends to be raised most frequently in utterance-final position, while in utterance-medial position the vowel was raised more when the syntactic and prosodic distance between {-go} and the following constituent was smaller. The results for boundary tone also showed a correlation between vowel raising and the discourse function of the boundary tone. In conclusion, we propose that vowel raising is not simply an optional phenomenon, but rather a type of phonetic reduction related to the comprehension of the following constituent.

• International Journal of Advanced Culture Technology
• /
• v.9 no.4
• /
• pp.86-93
• /
• 2021

This paper aims to investigate a novel affix prevalently and productively used in social media, which is assumed to be borrowed from English into Korean loanblens. The novel affix is composed of a prefix-like and a suffix-like elements, but it seems to be distinguished from other regular combinations of a prefix and a suffix. In analyzing the affix, we attempt to highlight its peculiarities of the affix with empirical data. First, the seemingly borrowed affix does not behave like affixes found in the donor language (English) or the recipient language (Korean) from a linguistic point of view. Both languages have circumfixation rarely available in productive word-formation processes. Second, no regular assimilation rules of Korean apply to the affix boundary, which would otherwise be mandatory to such syllable contact contexts. Last but not least, the affix form has no correspondence to the donor language, and therefore it is claimed to be derived through secretion and taken as a case of pseudo-anglicisms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5B
• /
• pp.859-870
• /
• 2000

In this paper, an efficient H/W implementation technique for guard interval in OFDM(Orthogonal Frequency Division Multiplexing) systems is proposed and applied to ASIC chip design of an OFDM-based 25 Mbps wireless ATM modem. In OFDM systems, a cyclic prefix, longer than the largest multipath delay spread, is usually inserted to maintain the orthogonality of subchannels, by making the linear convolution of the channel ok like circular convolution inherent to the discreate Fourier domain, as well as to prevent the ISI(Intersymbol Interference) within the OFDM block. However, the OFDM system using the cyclic prefix requires an additional H/W in transmitter in order to store the original samples and to append the cyclic prefix to the beginning of each block. In this paper, a new approach using a cyclic prefix, even with a significantly lower H/W complexity. Finally, the performance of the proposed approach is demonstrated by applying it to ASIC chip design of an OFDM-based 25 Mbps wireless ATM modem.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.446-449
• /
• 2002

This paper represents a improved data compression algorithm of mixed text file by 2 byte completion Hangout and 1 byte alphabet from. Original LZW algorithm efficiently compress a alphabet text file but inefficiently compress a 2 byte completion Hangout text file. To solve this problem, data compression algorithm using 2 byte prefix field and 2 byte suffix field for compression table have developed. But it have a another problem that is compression ratio of alphabet text file decreased. In this paper, we proposes improved LZW algorithm, that is, compression table in the Extended LZW(ELZW) algorithm uses 2 byte prefix field for pointer of a table and 1 byte suffix field for repeat counter. where, a prefix field uses a pointer(index) of compression table and a suffix field uses a counter of overlapping or recursion text data in compression table. To increase compression ratio, after construction of compression table, table data are properly packed as different bit string in accordance with a alphabet, Hangout, and pointer respectively. Therefore, proposed ELZW algorithm is superior to 1 byte LZW algorithm as 7.0125 percent and superior to 2 byte LZW algorithm as 11.725 percent. This paper represents a improved data Compression algorithm of mixed text file by 2 byte completion Hangout and 1 byte alphabet form. This document is an example of what your camera-ready manuscript to ITC-CSCC 2002 should look like. Authors are asked to conform to the directions reported in this document.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.10
• /
• pp.107-116
• /
• 2012

The applying of semantic technologies that aim to let computers understand and automatically process the meaning of the interlinked data on the Web is spreading. In Semantic Web, understanding and accessing the associations between data that is, the meaning between data as well as accessing to the data itself is important. W3C recommended RDF (Resource Description Framework) as a standard format to represent both Semantic Web data and their associations and also proposed several RDF query languages in order to support query processing for RDF data. However further researches on the query language definition considering the semantic associations and query processing techniques are still required. In this paper, using the suffix array-based indexing scheme previously introduced for RDF query processing, we propose a query processing approach to handle ${\rho}$-path query which is the representative type of semantic associations. To evaluate the query processing performance of the proposed approach, we implemented two different types of query processing approaches and measured the average query processing times. The experiments show that the proposed approach achieved 1.8 to 2.5 and 3.8 to 11 times better performance respectively than others two.

• Journal of KIISE:Databases
• /
• v.30 no.2
• /
• pp.168-175
• /
• 2003

Until now, substring selectivities have been estimated by two steps. First step is to build up a count-suffix tree, which has statistical information about substrings, and second step is to estimate substring selectivity using it. However, it's actually impossible to build up a count-suffix tree from biological sequences because their lengths are too long. So, this paper proposes a novel data structure, count q-gram tree, consisting of fixed length substrings. The Count q-gram tree retains the exact counts of all substrings whose lengths are equal to or less than q and this tree is generated in 0(N) time and in site not subject to total length of all sequences, N. This paper also presents an estimation technique, k-MO. k-MO can choose overlapping length of splitted substrings from a query string, and this choice will affect accuracy of selectivity and query processing time. Experiments show k-MO can estimate very accurately.

• The Journal of the Korea Contents Association
• /
• v.10 no.12
• /
• pp.70-76
• /
• 2010

This paper Extended ELZW(EBCDIC Lempel Ziv Welch) algorithm uses 2 byte prefix field for pointer of a table and 1 byte suffix field for repeat counter. where, a prefix field uses a pointer(index) of compression table and a suffix field uses a counter of overlapping or recursion text data in compression table. To increase compression ratio, after construction of compression table, table data are properly packed as different bit string in accordance with a alphabet, Hangeul, and pointer respectively. Therefore, proposed ELZW algorithm is superior to 1byte LZW algorithm as 5.22 percent and superior to 2byte LZW algorithm as 8.96 percent.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.7
• /
• pp.95-103
• /
• 2011

The actual utilization of Semantic Web technology which aims to provide more intelligent and automated service for information retrieval over the Web becomes gradually reality. RDF is widely used as the one of standard formats to present and manage the voluminous data on the Web. Efficient query processing on RDF data, therefore, is one of the ongoing research topics. Retrieving resources having a specific association from a given resource is the typical query processing type and several researches for this have done. However the most of previous researches have not fully considered discovering the complex relationship among resources such as returning the association between resources as the query processing result. This paper introduces the indexing and query processing for ${\rho}$-intersect operation which is one of the semantic association retrieval types. It includes an indexing scheme using suffix array and optimal processing approaches for handling ${\rho}$-intersect operation. The experimental evaluations shows that the average execution times for the proposed approach is 3~7 times faster than the previous approach.