• Journal of Electrical Engineering and information Science
• /
• v.2 no.5
• /
• pp.1-8
• /
• 1997

The main purpose of the Boolean equivalence problem is to verify that two Boolean expressions have the same functionality. Simulation has been extensively used as the standard method for the equivalence problem. Obviously, the number of tests required to perform a satisfactory coverage grows exponentially with the number of input variables. However, formal methods as opposed to simulation are getting more attention from the community. We propose a new algorithm called the Cover-Merge Algorithm based on a derivational method using the concept of cover and merge for the equivalence problem and investigate its theoretical aspects. Because of the difficulty of the problem, we emphasize simplification techniques in order to reduce the search space or problem size. Heuristics based on types of merges are developed to speed up the derivation process by allowing simplifications. In comparison with widely used technique called Binary Decision Diagram or BDD, the algorithm proposed outperforms BDD in nearly all cases of input including standard benchmark problems.

• International Journal of Advanced Culture Technology
• /
• v.6 no.4
• /
• pp.58-64
• /
• 2018

The Extraposition phenomenon in English has been analyzed mainly through two approaches: a derivational approach under the Principles & Parameters framework (P&P) and a representational approach under the early Minimalist framework (MP). The first one tries to understand the phenomenon as a result of the movement of a Big Subject first to the end of a sentence which is then followed by the insertion of an expletive 'it' to the empty Subject position. On the other hand, the second one tries to understand it by way of assuming a Big Subject originally base-generated at the end of a sentence which is followed by the insertion of an expletive 'it' to the empty Subject position. The two approaches, however, are not free from theoretical defects at all: the full derivational approach was under controversy in terms of (1) the failure of the Binding Theory and (2) its inability to suggest anything about the marginal reading issue. On the while, the representational approach has been argued (1) to violate the thematic hierarchy that should be kept in D-structure, and (2) to be also unable to suggest the slightest difference in marginal reading issue as the first one. In this paper I focus mainly on analyzing the 'It'-Extraposition phenomenon in the Optimality Theory. I will show that by way of (i) some newly developed constraints such as Subj., and AHSubj. and (ii) a constraint hierarchy of Subj.>>AHSubj., the controversies of 'It-Extraposition' such as (1) the analysis of construction and (2) the very closely related issue of 'marginal reading issue' can be explained properly.

• Speech Sciences
• /
• v.5 no.2
• /
• pp.27-40
• /
• 1999

This study is concerned with articulatory and acoustic experiments about the change of the stop /t/ into its counterpart affricate before derivational and inflectional suffixes beginning with /(h)i/. The present phonetic results show that the stop consonant is articulatorily and acoustically completely neutralized into the underlying plain affricate. Thus this study provides another instance of complete neutralization of manner of articulation in Korean in addition to Kim and Jongman (1996).

• Annual Conference on Human and Language Technology
• /
• 1995.10a
• /
• pp.282-289
• /
• 1995

이 연구는 지금까지 국어 형태론에서 사용되지 않았던, 코퍼스를 이용한 계량적인 방법으로 파생어의 생산성 정도를 측정하고, 그 결과로 국어 파생 형태론에서의 생산성을 기술한 것이다. 각각의 접사들의 생산성 정도에 대한 수치를 제시함으로써 좀 더 정확하게 상대적인 생산성 비교를 할 수 있도록 하였다. 접사의 생산성 정도 측정방법은 Baayen(1989)에서 제시한 것으로, 특정접사를 가지고 코퍼스에 단 한번 출현하는 단어의 수($n_1$)와, 주어진 접사를 가지고 코퍼스에 나오는 단어의 총수(N)의 비율로 접사의 생산성 정도를 측정한다($P=n_1/N$). 200만 어절 및 1000만 어절 코퍼스를 기반으로 국어의 대표적인 파생접미사들 중 명사파생 접미사 '-이', '-음', '-기', 형용사파생 접미사 '-스럽-', '-롭-', '답-', 동사파생 접미사 '-거리-', '-대-', '-이-'의 생산성 정도를 측정하였다. 본 연구에서 채택한 코퍼스를 이용한 언어 연구 방법은 기존의 사전을 이용하여 파생어의 생산성을 측정하는 것에 비해 앞선 것이라 할 수 있다.

• Structural Engineering and Mechanics
• /
• v.34 no.6
• /
• pp.703-718
• /
• 2010

In classical higher-order discontinuous boundary element formulation for two-dimensional elastostatics, interpolation functions for different boundary variables (i.e., boundary displacements and tractions) are assumed to be the same. However, there is a derivational relationship between these variables. This paper presents a boundary element formulation, called Mixed Boundary Element Formulation, for two dimensional elastostatic problems in which above mentioned relationship is taking into account. The formulations are performed by using discontinuous first and second-order mixed boundary elements. Based on the formulations presented in this study, two computer softwares are developed and verified through some example problems. The results show that the present formulation is credible.

• Proceedings of the KSPS conference
• /
• 1996.10a
• /
• pp.117-122
• /
• 1996

This paper proposes a derivational account of tensing and neutralization of obstruents in Korean within the theory of Government Phonology (GP) (Kaye, Lowenstamm and Vergnaud 1990, henceforth KLV; Park 1996). We begin by outling the relevant tensing and neutralization data in Korean. We point out several problems that need to be addressed in any account of these data. We then set out the central notions of GP, pointing out how adherence to the requirement that government relations remain constant throughout a derivation under the Projection Principle prevents a GP account of tensing and neutralization in Korean, which requires government relations to switch between lexical and phonetic representations. To address this problem, we propose abandoning the Projection Principle, extending lexical representations in GP along the lines of the Markedness Theory approach (Michaels 1989), and adopting the economy principles for derivation of the Minimalist approach (Chomsky 1993; Chomsky & Lasnik 1991). finally, we summarize the analysis of obstruent phenomena in Korean within GP extended in these ways.

• Proceedings of the Korean Society for Cognitive Science Conference
• /
• 2000.06a
• /
• pp.390-394
• /
• 2000

이 논문은 형태소 분석 말뭉치를 구축하면서 제기되었던 파생 명사 처리의 문제점을 논의하고 그 해결 방안을 모색한 것이다. 파생 명사의 분석에서 국어학적·전산 언어학적으로 유의미한 분석 범위를 정할 때 몇가지 고려해야 할 사항이 있다. 접두사는 어기가 불규칙하므로 규칙으로 자동처리가 어렵다. 형태소 분석의 대상은 생산성이 높고, 어기와 범주를 변화시키는 서술성 접두사로 그 범위를 정할 수 있을 것이다. 접미사의 분석은 생산성이 높고 규칙적인 굴절 접미사가 분석의 대상이 되며, 또한 서술성을 갖는 한자어계 접미사도 분석 대상이 된다. 파생 명사의 분석에 있어서 접사는 그 위상이 동요되므로 접두사는 고나형사와 구별이 어렵고, 접미사는 의존명사와 구별이어렵다. 그러므로, 대용량의 형태소 분석 말뭉치를 효율적으로 구축하기 위해서는 접사에 대한 다각적인 검토가 필요할 것이다.

• Annual Conference on Human and Language Technology
• /
• 2000.10d
• /
• pp.390-394
• /
• 2000

이 논문은 형태소 분석 말뭉치를 구축하면서 제기되었던 파생 명사 처리의 문제점을 논의하고 그 해결 방안을 모색한 것이다. 파생 명사의 분석에서 국어학적 전산 언어학적으로 유의미한 분석 범위를 정할 때 몇가지 고려해야 할 사항이 있다. 접두사는 어기가 불규칙하므로 규칙으로 자동처리가 어렵다. 형태소 분석의 대상은 생산성이 높고, 어기와 범주를 변화시키는 서술성 접두사로 그 범위를 정할 수 있을 것이다. 접미사의 분석은 생산성이 높고 규칙적인 굴절 접미사가 분석의 대상이 되며, 또한 서술성을 갖는 한자어계 접미사도 분석 대상이 된다. 파생 명사의 분석에 있어서 접사는 그 위상이 동요되므로 접두사는 관형사와 구별이 어렵고 접미사는 의존명사와 구별이 어렵다. 그러므로, 대용량의 형태소 분석 말뭉치를 효율적으로 구축하기 위해서는 접사에 대한 다각적인 검토가 필요할 것이다.

• Proceedings of the KSPS conference
• /
• 1996.10a
• /
• pp.109-116
• /
• 1996

In this paper, I would like to explore the possibility that the nature of place assimilation can be captured in terms of the OCP within the Optimality Theory (Mccarthy & Prince 1999. 1995; Prince & Smolensky 1993). In derivational models, each assimilatory process would be expressed through a different autosegmental rule. However, what any such model misses is a clear generalization that all of those processes have the effect of avoiding a configuration in which two consonantal place nodes are adjacent across a syllable boundary, as illustrated in (1):(equation omitted) In a derivational model, it is a coincidence that across languages there are changes that have the result of modifying a structure of the form (1a) into the other structure that does not have adjacent consonantal place nodes (1b). OT allows us to express this effect through a constraint given in (2) that forbids adjacent place nodes: (2) OCP(PL): Adjacent place nodes are prohibited. At this point, then, a question arises as to how consonantal and vocalic place nodes are formally distinguished in the output for the purpose of applying the OCP(PL). Besides, the OCP(PL) would affect equally complex onsets and codas as well as coda-onset clusters in languages that have them such as English. To remedy this problem, following Mccarthy (1994), I assume that the canonical markedness constraint is a prohibition defined over no more than two segments, $\alpha$ and $\beta$: that is, $^{*}\{{\alpha, {\;}{\beta{\}$ with appropriate conditions imposed on $\alpha$ and $\beta$. I propose the OCP(PL) again in the following format (3) OCP(PL) (table omitted) $\alpha$ and $\beta$ are the target and the trigger of place assimilation, respectively. The '*' is a reminder that, in this format, constraints specify negative targets or prohibited configurations. Any structure matching the specifications is in violation of this constraint. Now, in correspondence terms, the meaning of the OCP(PL) is this: the constraint is violated if a consonantal place $\alpha$ is immediately followed by a consonantal place $\bebt$ in surface. One advantage of this format is that the OCP(PL) would also be invoked in dealing with place assimilation within complex coda (e.g., sink [si(equation omitted)k]): we can make the constraint scan the consonantal clusters only, excluding any intervening vowels. Finally, the onset clusters typically do not undergo place assimilation. I propose that the onsets be protected by certain constraint which ensures that the coda, not the onset loses the place feature.

• International Journal of Computer Science & Network Security
• /
• v.23 no.4
• /
• pp.1-6
• /
• 2023

Morphological analysis is a branch of natural language processing, is now a rapidly growing field. The fundamental tenet of morphological analysis is that it can establish the roots or stems of words and enable comparison to the original term. Arabic is a highly inflected and derivational language and it has a strong structure. Each root or stem can have a large number of affixes attached to it due to the non-concatenative nature of Arabic morphology, increasing the number of possible inflected words that can be created. Accurate verb recognition and extraction are necessary nearly all issues in well-known study topics include Web Search, Information Retrieval, Machine Translation, Question Answering and so forth. in this work we have designed and implemented an algorithm to detect and recognize Arbic Verbs from Arabic text.The suggested technique was created with "Python" and the "pyqt5" visual package, allowing for quick modification and easy addition of new patterns. We employed 17 alternative patterns to represent all verbs in terms of singular, plural, masculine, and feminine pronouns as well as past, present, and imperative verb tenses. All of the verbs that matched these patterns were used when a verb has a root, and the outcomes were reliable. The approach is able to recognize all verbs with the same structure without requiring any alterations to the code or design. The verbs that are not recognized by our method have no antecedents in the Arabic roots. According to our work, the strategy can rapidly and precisely identify verbs with roots, but it cannot be used to identify verbs that are not in the Arabic language. We advise employing a hybrid approach that combines many principles as a result.