• Lingua Humanitatis
• /
• v.1 no.1
• /
• pp.235-251
• /
• 2001

According to Chomskyan grammar, humans can generate and understand an unbounded number of grammatical sentences. Against the background of pure and idealized linguistic competence, this linguistic productivity is argued and understood. In actual utterances, however, there are many limitations of productivity but they are said to come from the general constraints on performances such as capacity of short term memory or attention. In this paper I discuss a problem raised against idealized productivity. I argue that linguistic productivity idealizes our linguistic competence too much. By separating idealized competence from the various constraints of performance, Chomskyan theorists can argue for unlimited productivity. However, the absolute distinction between grammar (pure competence) and parser (actual psychological processes) makes little sense when we explain the low acceptability(intelligibility) of center embedded sentences. Usually, the problem of center embedded sentence is explained in terms of memory shortage or other performance constraints. To explain the low acceptability, however, we need to assume specialized memory structure because the low acceptability occurs only with a specific type of syntactic pattern. 1 argue that this special memory structure should not be considered as a general performance constraint. It is a domain specific (specifically linguistic) constraints and an intrinsic part of human language processing. Recent development of Chomskyan grammar, i.e., minimalist approach seems to close the gap between pure competence and this type of specialized constraints. Chomsky's earlier approach of generative grammar focuses on end result of the generative derivation. However, economy principle (of minimalist approach) focuses on actual derivational processes. By having less mathematical or less idealized grammar, we can come closer to the actual computational processes that build syntactic structure of a sentence. In this way, we can have a more concrete picture of our linguistic competence, competence that is not detached from actual computational processes.

• Journal of Digital Convergence
• /
• v.17 no.8
• /
• pp.37-46
• /
• 2019

The purpose of this study is to explore the effects of the use of artificial intelligence chatbots on improving Korean college students' English grammar skills. 70 undergraduate students participated in the present study. They were taking a General English class offered by a university in Korea. There were two groups in this study. Participants in the chatbot group consisted of 36 students while those in the human group were 34. Over 16 weeks, the chatbot group engaged in ten chat sessions with a chatbot while the human group had a chat with a human chat partner. Both pre- and post-tests were performed to examine changes in the participants' grammar skills over time. To compare the improvement between the two groups, an independent t-test was then run. Main findings are as follows: First, participants in both groups significantly improved their English grammar skills, indicating the beneficial effects of engaging in chat. Also, there was a statistically significant difference in the improvement between the chatbot and human groups, indicating the superior effects of the chatbot use. This study confirmed the improved grammar skills by the participants in the chatbot group, comparison with those in the human group. Based on these findings, suggestions for the future chatbot study are discussed.

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

This paper provides computational algorithms for a Korean reflexive caki, for which both sentence-bound and long-distance readings are possible. Its analyses are based on Chierichia's theory in Categorial Grammar, and a CCG-like system is introduced for the implementation. In this system, we can get both readings of caki with the same resolution mechanisms, while the difference is where the reflexive is resolved. These algorithms enable us to account for the distributions and characteristics off long-distance reflexive caki with a more unified way.

• Journal of Biomedical Engineering Research
• /
• v.12 no.4
• /
• pp.267-276
• /
• 1991

This paper describes syntactic pattern recognition algorithm for pattern recognition and diagnostic parameter extraction of ECG signal. ECG signal which is represented linguistic string is evaluated by pattern grammar and its interpreter-LALR(1) parser for pattern recognition. The proposed pattern grammar performs syntactic analysis and semantic evaluation simultaneously. The performance of proposed algorithm has been evaluated using CSE database.

• Proceedings of the IEEK Conference
• /
• 2000.11b
• /
• pp.172-175
• /
• 2000

In this paper, we address the requirement of VHDL parser for design rule checker, and the structure and implementing method of design rule checker which checks if IP design is valuable to reuse. This checker builds the grammar trees from the design rules, and the internal graphs representation from IP design data. It maps the nodes of the grammar trees and the internal graphs to check if it violates the design rules. The design rule checker can do the cross reference between source codes and error messages to find error position easy.

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

구문태그가 부착되지 않은 코퍼스를 사용하여 문법규칙의 확률을 훈련하는 비통제 학습(unsupervised learning) 방법의 대표적인 것이 CNF(Chomsky Normal Form)의 CFG(Context Free Grammar)를 입력으로 하는 inside-outside 알고리즘이다. 본 연구에서는 의존문법을 CNF로 변환하는 기법에 대해 논하고 의존문법을 위해 변형된 inside-outside 알고리즘을 논한다. 또한 이 알고리즘을 사용하여 실제 훈련한 결과를 보이고, 의존규칙과 구문구조 확률을 같이 사용하는 hybrid방식 구문분석기에 적용한 결과를 보인다.

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

This paper investigates the nature of Japanese argument cluster (Steedman 2000b). Based on Combinatory Categorial Grammar, a type-raising analysis of case particles which captures some aspects of the information structure in Japanese is discussed, including contrastive interpretation of coordination, wh-constructions, and some theme and rheme-related grammatical phenomena. These observations offer further support for the study of syntax, semantics, and phonology interface and the earlier analysis of English information structure.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.17 no.30
• /
• pp.185-192
• /
• 1994

The complexity and consistency are important factors that affect human information processing in use of product. In this study, complexity and consistency of product(remote controller) are measured by Task Action Grammar(TAG) model. Also, new design alternative of the user interface is presented and evaluated. The results show that the consistent system and the good correspondence between hierarchical structure of system and user's mental model lead to the reduction of errors and enhanced user's performance.

• Language and Information
• /
• v.11 no.1
• /
• pp.25-38
• /
• 2007

So-called multiple nominative constructions (MNCs) in Korean are quite theoretically as well as computationally puzzling. This paper shows that a grammar allowing the interaction of declarative constraints on types of signs - in particular, constructions (phrases and clauses)-can provide a robust and efficient way of encoding generalizations for two different MNCs. The feasibility of the grammar developed has been checked with its implementation into the LKB (Linguistic Knowledge Building) system.

• Journal of Korea Multimedia Society
• /
• v.6 no.6
• /
• pp.1088-1099
• /
• 2003

The syntax-directed translation using semantic actions is frequently used in construction of compiler for text programming languages. it is very useful for the language designers to develop compiler back-end using a syntax structure of a source programming language. Due to the lack of the integrated representation method for a parse tree node and modeling method of syntax structures, it is very hard to construct compiler using syntax-directed translation in visual languages. In this Paper, we propose a visual language compiler generation method for constructing a visual languages compiler automatically, using syntax-directed translation. Our method uses the Picture Layout Grammar as a underlying grammar formalism. This grammar allows our approach to generate parser efficiently u sing And-Or-Waiting Graph and encapsulating syntax definition as one unit. Unlike other systems, we suggest separating the specification and the generation of semantic actions. Because of this, it provides a very efficient method for modification.