http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : ( Koji Arikawa ) (검색결과 2 건)
- 무료
- 기관 내 무료
- 유료
-
( Koji Arikawa ) 서울대학교 인지과학연구소 2016 Journal of Cognitive Science Vol.17 No.4
Linguists have accumulated evidence for binary merge. This paper adds mathematical reason. The computational procedures of human natural language (CHL) choose binary merge because it can contain more information, and lacks optimal balance. Nature organizes network currents to minimize information loss. This is the physical principle of minimal computation (MC). CHL obeys MC. Nature has created CHL in the human brain. Nature has selected binary merge whose balance is not optimal, and information loss (error) is not minimized. However, this unsettled unbalance (asymmetry) of binary merge drives the infinite growth of binary trees.
-
Koji Arikawa 서울대학교 인지과학연구소 2020 Journal of Cognitive Science Vol.21 No.2
This article examines a graph-theoretical analysis of an externally merged VP as a derivational Fibonacci (F) tree, i.e., a structure written in a Lindenmayer grammar without a linearization condition. We aim to show that the computational procedures of a natural human language (CHL), which is a complex system, solve a dynamically frustrated equation (introduced by Philippe Binder, and proposed as a third factor by Juan Uriagereka) in the human brain. The relevant equation is Kirchhoff’s (electric) current law (KCL) AT y = f, which calculates the equilibrium (balance) in any network. Applying the standard graph-theoretical method, we calculate the hidden optimal balance among VP, vP, and CP as an F network. We calculate the potential (cumulative relative quantity of features) in each node and then the current (relative force of feature flow) along each edge. The graph theory shows that an externally merged antisymmetric VP with binary-node connections conceals an extremely symmetric balance (a KCL solution of zero), wherein almost all the edges disappear and the nodes are almost completely disconnected. In this scenario, KCL qualifies as a dynamically frustrated equation caught in a dilemma between two contradictory dynamics: symmetry breaking and symmetry generation. Our challenge is threefold. First, we aim to calculate the optimal balance hidden in sentential F trees. Second, we reassess Richard Kayne’s insightful “connectivity” proposal. Third, we propose a new hypothesis of phase existence. A frustrated nonphase catalyzes the creation of phases, forcing loop structures of feature inheritance and internal merges. These loops are nonzero solutions of the KCL.
KCI
KISS연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
