|
|
Obviously we (means CP) appreciate hard work even we do not understand a word of it...
"The only place where Success comes before Work is in the dictionary." Vidal Sassoon, 1928 - 2012
|
|
|
|
|
"mug's game:" if that's what you think, or, how you feel, why play the game ? what do you win, or lose ?
for me, the "great game" on CP is the pursuit of technical excellence, where "excellence" means improving myself through continual learning, not reaching some impossible (given my age, and priorities of other interests) degree of perfection. that CP provides a friendly context where that improvement can be fostered by my peers, and mentors: that's a blessing !
however, i must admit to occasionally wishing I could wake up and be Richard Deeming, or Marc Clifton, or OriginalGriff, or Pete O'Hanlon ... for a while !
«One day it will have to be officially admitted that what we have christened reality is an even greater illusion than the world of dreams.» Salvador Dali
|
|
|
|
|
BillWoodruff wrote: i must admit to occasionally wishing I could wake up and be Richard Deeming, or Marc Clifton, or OriginalGriff, or Pete O'Hanlon ... for a while I wish somebody would wake up and be me for a while... I could use a break .
Software Zen: delete this;
|
|
|
|
|
good idea: i often wish i could off-load certain parts of me onto some other person or ... goat.
«One day it will have to be officially admitted that what we have christened reality is an even greater illusion than the world of dreams.» Salvador Dali
|
|
|
|
|
It was just a bad joke, Bill. Mug's game cuz you win a mug if you win
Real programmers use butterflies
|
|
|
|
|
Your puns are as inscrutable as your articles.
|
|
|
|
|
I thought this one was obvious!
Real programmers use butterflies
|
|
|
|
|
Greg Utas wrote: Your puns are as inscrutable as your articles. Witches do cast spells
«One day it will have to be officially admitted that what we have christened reality is an even greater illusion than the world of dreams.» Salvador Dali
|
|
|
|
|
apologies !
you actually win a mug, as in a physical cup ? wow ! i am like now so motivated to take a mug shot
thanks for alerting me to the rich meanings of that word: [^]
i stand ashamed, exposed as a muggle, not a mage.
«One day it will have to be officially admitted that what we have christened reality is an even greater illusion than the world of dreams.» Salvador Dali
|
|
|
|
|
|
|
I'm an old man. Too "spacy" for me
It does not solve my Problem, but it answers my question
modified 19-Jan-21 21:04pm.
|
|
|
|
|
I'm 70 and I like it!
Monday starts Diarrhea awareness week, runs until Friday!
JaxCoder.com
|
|
|
|
|
they were too spacey in the 1990s, let alone with 2020 vision.
I wanna be a eunuchs developer! Pass me a bread knife!
|
|
|
|
|
|
|
I've only ever listened to their Fear of a Blank Planet album.
I listened to other albums once or twice, but always came back to that one.
Best song: Porcupine Tree - Anesthetize - YouTube[^]
There's only one thing I don't like about the song, it's "only" 17 minutes long
Arriving Somewhere But Not Here sounds good though, maybe I should give it another chance...
|
|
|
|
|
Never could get into Zappa.
I like some Dire Straits songs, just not that one.
Sultans of Swing is one of the best songs ever made though
|
|
|
|
|
I'm on my way to being able to create parser generators that can parse natural language
I'm using GLR parsing which is a form of LR parsing that uses a non-deterministic approach to running one of the existing LR algorithms (usually LALR(1))
Basically the GLR algorithm uses almost exactly the same tables as the LALR(1) algorithm but it uses with with 1+n stacks instead of 1 stack where n is the number of alternate parses it is finding in the input (GLR can return multiple parse trees for the same input)
Now this is cool. However, my LALR(1) algorithm is clearly broken.
I taught myself how to do it using what I could find on the web, and 90% of it works. The 10% are the blasted epsilon rules. The issue is when I was "taught" LALR(1) by the web it only showed me monotonic grammars - no epsilon rules. Now, any grammar can be converted to monotonic, and it's the approach Chomsky suggests so a lot of eggheads do it that way, and then work on the monotonic form. It's not as practical when making a parser generator though because it significantly changes what the resulting parse tree looks like.
Most (all?) real world algorithms can handle epsilons but since I was only shown how to do this by some undergrads with free time and such I have never learned this.
LALR(1) is very difficult to understand. I understand most of it now, but do i understand enough to modify the algorithm to do what I need?
I hope so. I've been smashing away at it all morning, getting close, but never quite there.
Real programmers use butterflies
|
|
|
|
|
"parse natural language": I'm keen on to see an approach.
I assume you will try it first in english. If you can do it that would be great! The next step will be translate the translation from other languages.
Very cool challenge anyway
It does not solve my Problem, but it answers my question
modified 19-Jan-21 21:04pm.
|
|
|
|
|
For most natural language constructs it will probably return multiple parse trees because natural language can be ambiguous.
Parsing English involves creating a grammar for it which would be daunting to do in its entirety and probably run the computer out of memory.
But you could do a subset.
Real programmers use butterflies
|
|
|
|
|
English grammar is ridiculously simple, with no more than about 130 rules, which could be learned to perfection in a couple of hours.
Style rules, distinctions of the various ways to phrase things, and idioms, however...
How many centuries can you pencil in to work on it?
I wanna be a eunuchs developer! Pass me a bread knife!
|
|
|
|
|
Right. And if just programmers would learn to write correct programs adhering to all rules, compilers could be ridiculously simple.
But I assume that you meant to be sarcastic.
|
|
|
|
|
Member 7989122 wrote: But I assume that you meant to be sarcastic. No, English grammar is ridiculously simple, with about 130 rules.
As I said, I believe quite clearly, it's the ridiculous number of non-rules that is the problem -- "non-rules" being idiomatic speech, old sayings/proverbs/etc, and ridiculous "rules" of style that hundreds of people have documented as being That-Which-Must-Be-Obeyed, but which are no more than personal preferences.
Using a computer language well is a piece of piss, by comparison, and the readership is computers, which don't come in a multitude of flavours and levels of understanding -- case in point my having to repeat my perfectly clear statements here.
I wanna be a eunuchs developer! Pass me a bread knife!
|
|
|
|