From: Josef 'Jupp' SCHUGT Date: 2005-11-21T05:35:21+09:00 Subject: Re: [QUIZ PROPOSAL] autoreferential letter count Hi! At Sat, 19 Nov 2005 01:59:59 +0900, Paolo Capriotti wrote: > > I propose the following for the next week quiz: > > Write a ruby program that takes a sentence as its input an produces > an output that autoreferentially describes the letters found in the > sentence _and_ the description itself. As long as one restricts oneself to a single language that is no problem but as soon as several languages are involve things become naughty. Dutch 'co�rdinatie" (coordination) contains 1 a, 2 c, 1 d, 1 e, 2 i, 1 n, 2 o, 1 r, 1 t while German "Di�tplan" contains 1 a, 1 �, 1 d, 1 i, 1 l, 1 n, 1 p, 1 t You see that depending on the language the trema either introduces a new letter or not. Even if a German sentence contains no umlaut (�, �, �) at all, the count still may because 5 reads 'f�nf' (as a result the '�' is contained in any number containing the digit '5'), and 12 reads "zw�lf'. Tot ziens, Josef 'Jupp' Schugt -- Diese E-Mail wurde moeglicherweise erst mehrere Stunden nach ihrer Fertigstellung versendet, um Onlinekosten zu sparen. This e-mail has possibly been sent several hours after composition in order to reduce online costs.