Char Complexity - Revision history

Vulanovic at 12:51, 16 June 2009

2009-06-16T12:51:03Z

Vulanovic at 12:07, 16 June 2009

2009-06-16T12:07:30Z

Vulanovic at 12:06, 16 June 2009

2009-06-16T12:06:49Z

Patzschke at 11:52, 25 June 2007

2007-06-25T11:52:36Z

Altmann at 14:38, 2 July 2006

2006-07-02T14:38:20Z

Ahans at 13:00, 27 June 2006

2006-06-27T13:00:17Z

Ahans at 08:40, 17 June 2006

2006-06-17T08:40:09Z

Ahans at 08:35, 17 June 2006

2006-06-17T08:35:48Z

Ahans at 09:34, 28 April 2006

2006-04-28T09:34:05Z

New page

'''1. Problem and history'''

The complexity of Chinese characters can be measured in terms of the number of strokes. The stroke is a segment written with one uninterrupted movement. The question arises whether complexity follows a regular distribution. Evidently, this is a special case of (→) length distributions. The pertinent statements can be qualified as laws only if they hold for any types of ideograms but up to now no other writing systems have been examined.
Sanada (1999) shows empirical data on the distribution of strokes in Japanese but does not present a model. Proceeding rather inductively Yu (2001) found that the distribution of character lengths in texts follows the 1-displaced binomial distribution. Previous studies (Herdan 1966, Bohn 1998) did not achieve this result.
The distribution in texts and in the dictionary may be quite different because in texts repetition is taken into account. The measurement in terms of the number of strokes is –as a matter of fact – the measurement of length, not that of complexity.
Another kind of complexity of script, in which not only the number of the composing entities but also the kind of their joining is relevant, can be measured according to Altmann (2004) but until now no testing has been performed.

'''2. Hypothesis'''

''The distribution of the complexity of Chinese characters follows a usual length distribution.''

Complexity = here the number of strokes in a Chinese sign.

'''3. Derivation'''

Solving a (reparametrized) recurrence relation which is a special case of length distributions, namely

(1)<math>P_{x+1} = \frac{n-x+1}{x}\frac{p}{q}, \quad x = 1, 2, ..., n+1</math>

one obtains

(2)<math>P_x = {n \choose x-1}</math>

'''Example''': Chinese characters in texts

Yu (2001) tested the above hypothesis on 20 Chinese texts, one of which can be found in Table 1 and Fig. 1.
<div align="center">[[Image:Figur1_CC.jpg]]</div>

<div align="center">[[Image:Figur2_CC.jpg]]</div>

<div align="center">Fig. 1. The distribution of character complexity in a Chinese text</div>

The result corroborates the hypothesis.

'''4. Authors''': U. Strauss, G. Altmann

'''5. References'''

'''Altmann, G. (2004). Script complexity'''. ''Glottometrics 8'', 68-74.

'''Bohn, H. (1998).''' ''Quantitative Untersuchungen der modernen chinesischen Sprache und Schrift.'' '''Hamburg: Kováč'''.

'''Bohn, H. (2002). Untersuchungen zur chinesischen Sprache und Schrift. In: Köhler, R. (ed.),''' ''Korpuslinguistische Untersuchungen in die quantitative und systemtheoretische Linguistik: 127-177.'' http://ubt.opus.hbz-nrw.de/volltexte/2004/279/

'''Herdan, G. (1966).''' The advanced theory of language as choice and chance. '''Berlin: Springer.'''

'''Menzel, C. (2002). Das synergetische Basismodell der Lexik und die chinesische Schrift. In: Köhler, R. (ed.),''' ''Korpuslinguistische Untersuchungen in die quantitative und systemtheoretische Linguistik: 179-207''. http://ubt.opus.hbz-nrw.de/volltexte/2004/279/

'''Sanada, H. (1999). Analysis of Japanese vocabulary by the theory of synergetic linguistics'''. ''J. of Quantitative Linguistics 6, 239-251.''

'''Yu, X. (2001). Zur Komplexität chinesischer Schriftzeichen'''. ''Göttinger Beiträge zur Sprachwissenschaft.5, 121-129.''

Hypothesen aus C. Menzel

H 1: Funktionskomplexität = A1* Komplexität B1
H 2: Frequenz = A2 * Funktionskomplexität B2
H 3: Komplexität = A3 * Frequenz B3

Durch Einsetzen erhält man drei indirekte Abhängigkeiten:
H 4: Komplexität = A4 * Funktionskomplexität B4
H 5: Funktionskomplexität = A5 * Frequenz B5
H 6: Frequenz = A6 * Komplexität B6

@@ Line 23: / Line 23: @@
 one obtains
-(2) <math>P_x = {n \choose x-1}p^{x-1}q^{n-x+1}, \quad x= 1,2,...,n+1, \quad 0<p<1, n\epsilon N</math>
+(2) <math>P_x = {n \choose x-1}p^{x-1}q^{n-x+1}, \quad x= 1,2,...,n+1, \quad 0<p<1,\quad n\epsilon N</math>
 '''Example''': Chinese characters in texts

@@ Line 7: / Line 7: @@
 The distribution in texts and in the dictionary may be quite different because in texts repetition is taken into account. The measurement in terms of the number of strokes is – as a matter of fact – the measurement of length, not that of complexity.
-Another kind of complexity of script, in which not only the number of the composing entities is relevant, but also the way they ared joined together, can be measured according to Altmann (2004) but until now no testing has been performed.
+Another kind of complexity of script, in which not only the number of the composing entities is relevant, but also the way they are joined together, can be measured according to Altmann (2004) but until now no testing has been performed.
 '''2. Hypothesis'''

@@ Line 42: / Line 42: @@
 '''Altmann, G. (2004). Script complexity'''. ''Glottometrics 8'', 68-74.
-'''Bohn, H. (1998).''' ''Quantitative Untersuchungen der modernen chinesischen Sprache und Schrift.'' '''Hamburg: Kováč'''.
+'''Bohn, H.''' (1998). ''Quantitative Untersuchungen der modernen chinesischen Sprache und Schrift.'' Hamburg: Kováč.
-'''Bohn, H. (2002). Untersuchungen zur chinesischen Sprache und Schrift. In: Köhler, R. (ed.),''' ''Korpuslinguistische Untersuchungen in die quantitative und systemtheoretische Linguistik: 127-177.'' http://ubt.opus.hbz-nrw.de/volltexte/2004/279/
+'''Bohn, H.'''(2002). Untersuchungen zur chinesischen Sprache und Schrift. In: Köhler, R. (ed.), ''Korpuslinguistische Untersuchungen in die quantitative und systemtheoretische Linguistik: 127-177.'' http://ubt.opus.hbz-nrw.de/volltexte/2004/279/
-'''Herdan, G. (1966).''' The advanced theory of language as choice and chance. '''Berlin: Springer.'''
+'''Herdan, G.''' (1966). ''The advanced theory of language as choice and chance.'' Berlin: Springer.
-'''Menzel, C. (2002). Das synergetische Basismodell der Lexik und die chinesische Schrift. In: Köhler, R. (ed.),''' ''Korpuslinguistische Untersuchungen in die quantitative und systemtheoretische Linguistik: 179-207''. http://ubt.opus.hbz-nrw.de/volltexte/2004/279/
+'''Menzel, C.''' (2002). Das synergetische Basismodell der Lexik und die chinesische Schrift. In: Köhler, R. (ed.), ''Korpuslinguistische Untersuchungen in die quantitative und systemtheoretische Linguistik: 179-207''. http://ubt.opus.hbz-nrw.de/volltexte/2004/279/
-'''Sanada, H. (1999). Analysis of Japanese vocabulary by the theory of synergetic linguistics'''. ''J. of Quantitative Linguistics 6, 239-251.''
+'''Sanada, H.''' (1999). Analysis of Japanese vocabulary by the theory of synergetic linguistics. ''J. of Quantitative Linguistics 6, 239-251.''
-'''Yu, X. (2001). Zur Komplexität chinesischer Schriftzeichen'''. ''Göttinger Beiträge zur Sprachwissenschaft.5, 121-129.''
+'''Yu, X.''' (2001). Zur Komplexität chinesischer Schriftzeichen. ''Göttinger Beiträge zur Sprachwissenschaft.5, 121-129.''
 [[Category:Unfertig]]

← Older revision		Revision as of 14:38, 2 July 2006
Line 54:		Line 54:
	'''Yu, X. (2001). Zur Komplexität chinesischer Schriftzeichen'''. ''Göttinger Beiträge zur Sprachwissenschaft.5, 121-129.''		'''Yu, X. (2001). Zur Komplexität chinesischer Schriftzeichen'''. ''Göttinger Beiträge zur Sprachwissenschaft.5, 121-129.''

−	~~Hypothesen aus C. Menzel~~

−	~~H 1: Funktionskomplexität = A1* Komplexität B1~~
−	~~H 2: Frequenz = A2 * Funktionskomplexität B2~~
−	~~H 3: Komplexität = A3 * Frequenz B3~~
−
−	~~Durch Einsetzen erhält man drei indirekte Abhängigkeiten:~~
−	~~H 4: Komplexität = A4 * Funktionskomplexität B4~~
−	~~H 5: Funktionskomplexität = A5 * Frequenz B5~~
−	~~H 6: Frequenz = A6 * Komplexität B6~~

	[[Category:Unfertig]]		[[Category:Unfertig]]

← Older revision		Revision as of 08:40, 17 June 2006
Line 64:		Line 64:
	H 5: Funktionskomplexität = A5 * Frequenz B5		H 5: Funktionskomplexität = A5 * Frequenz B5
	H 6: Frequenz = A6 * Komplexität B6		H 6: Frequenz = A6 * Komplexität B6
		+
		+	[[Category:Unfertig]]

@@ Line 1: / Line 1: @@
 '''1. Problem and history'''
 The complexity of Chinese characters can be measured in terms of the number of strokes. The stroke is a segment written with one uninterrupted movement. The question arises whether complexity follows a regular distribution. Evidently, this is a special case of (→) length distributions. The pertinent statements can be qualified as laws only if they hold for any types of ideograms but up to now no other writing systems have been examined.
 Sanada (1999) shows empirical data on the distribution of strokes in Japanese but does not present a model. Proceeding rather inductively Yu (2001) found that the distribution of character lengths in texts follows the 1-displaced binomial distribution. Previous studies (Herdan 1966, Bohn 1998) did not achieve this result.
-The distribution in texts and in the dictionary may be quite different because in texts repetition is taken into account. The measurement in terms of the number of strokes is –as a matter of fact – the measurement of length, not that of complexity.
+Sanada (1999) shows empirical data on the distribution of strokes in Japanese but does not present a model. Proceeding rather inductively, Yu (2001) found that the distribution of character lengths in texts follows the 1-displaced binomial distribution. Previous studies (Herdan 1966, Bohn 1998) did not achieve this result.
-Another kind of complexity of script, in which not only the number of the composing entities but also the kind of their joining is relevant, can be measured according to Altmann (2004) but until now no testing has been performed.
 '''2. Hypothesis'''
@@ Line 16: / Line 19: @@
 Solving a (reparametrized) recurrence relation which is a special case of length distributions, namely
-(1)<math>P_{x+1} = \frac{n-x+1}{x}\frac{p}{q}, \quad x = 1, 2, ..., n+1</math>
+(1) <math>P_{x+1} = \frac{n-x+1}{x}\frac{p}{q}, \quad x = 1, 2, ..., n+1</math>
 one obtains
-(2)<math>P_x = {n \choose x-1}p^{x-1}q^{n-x+1}, \quad x= 1,2,...,n+1, \quad 0<p<1, n\epsilon N</math>
+(2) <math>P_x = {n \choose x-1}p^{x-1}q^{n-x+1}, \quad x= 1,2,...,n+1, \quad 0<p<1, n\epsilon N</math>
 '''Example''': Chinese characters in texts

@@ Line 25: / Line 25: @@
 Yu (2001) tested the above hypothesis on 20 Chinese texts, one of which can be found in Table 1 and Fig. 1.
-<div align="center">[[Image:Figur1_CC.jpg]]</div>
+<div align="center">[[Image:Figur11_CC.jpg]]</div>
 <div align="center">[[Image:Figur2_CC.jpg]]</div>