Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Re^2: My favorite silent English letter is:

by Anonymous Monk
on Mar 18, 2012 at 10:01 UTC ( #960272=note: print w/replies, xml ) Need Help??

in reply to Re: My favorite silent English letter is:
in thread My favorite silent English letter is:

You can blame Bill The Bastard (sorry, I meant William the Conqueror) for that. He brought a whole bunch of French words into English. The aristocracy spoke French, the normal commoners spoke Anglo-Saxon. That's why you get two names for most types of meat; mutton and lamb (which comes from l'angneau), ox and beef (from buf), etc.

Look closely and you'll find that English (even the version with Merriam and Webster's messed up spelling (color vs colour)) is an amalgamation of Latin, Greek, Arabic, French, German, Anglo, Saxon, Swedish, Norwegian and Chinese plus a whole bunch of other words borrowed from around the old British Empire.

  • Comment on Re^2: My favorite silent English letter is:

Replies are listed 'Best First'.
Re^3: My favorite silent English letter is:
by Happy-the-monk (Canon) on Mar 18, 2012 at 10:53 UTC

    lamb (which comes from l'angneau),

    the choice of the word lamb curiously breaks that schema (which stays valid nearly everywhere else). It is believed to be a much older word from germanic/protogermanic roots, qf the German "Lamm", Dutch & Scandinavian languages "lam", Nedersaksisch "Laom" etc.

    Just the other way round mutton is from French mouton, so you have been unhappily mixing the pair the wrong way up.

    Cheers, Sören

    Later addition: "Billy the Bastard" would indeed have been an appropriate and probably undisputed name for the young William, I learned.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://960272]
[LanX]: edge or node?
[oiskuu]: from each height difference, there's a fixed number of "moves right" - "moves left". So it's a number of combinations.
[Discipulus]: I already know how much distinct paths exists but to demonstrate the property i want to have them all
[oiskuu]: ie C(n, k); where n is height difference, k is position in the line
[Discipulus]: infact there are 70 distinct path to reach the tale wich holds 70
[Discipulus]: what i want is to compute them

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (9)
As of 2018-03-19 11:05 GMT
Find Nodes?
    Voting Booth?
    When I think of a mole I think of:

    Results (239 votes). Check out past polls.