Can someone update the /prog/ fixer

to hide threads made by you know who.

No, and fuck you.

>>1
gb2/sci_^/entology, _^FrozenFag.

I'm going to write a text parser which finds grammatical errors.

>>4
good luck. solving the halting problem is easier than parsing english.

>>5
Obviously has never used Microsoft Word. They've solved that problem via the Spelling/Grammar autocorrection

>>6
i've used microsoft word. it's grammar checker doesn't work very well at all. half the time it says that correct sentences are incorrect and incorrect ones are correct.

>>7
No, sorry. You're just an idiot.

Can't mods just banfilter his name?

>>9
That would just aggravate matters and prove that we are not better then him

>>10
It worked for boxy.

>>11
Back to /b/, please.

>>10
Kill yourself, FrozenTard.

>>10
Shut up, FrozenDick.

>>10
I hope you die alone, FrozenVirgin.

He seems to have disappeared. Did the mods ban his IP?

>>16
Fuck off already.

>>17
back to /b/, please

>>7
it's grammar checker doesn't work very well
it's grammar checker
This would explain why you believe so.

>>8,19

No, really, grammar checkers are universally pieces of crap, no matter to what extent they try to interpret and parse English. The problem is that the language, as all natural languages, is highly ambiguous and rule sets defined in a grammar checker will probably never be able to take into account all of the intricacies of English.

I'm saying this as an English major, proofreader, and former TA. Grammar checkers give people a false sense of security that their text is correct, and that is not the case in far too many situations to make using them worthwhile. LEARN the language; don't rely on machines to do your learning for you. Turn that useless thing off.

Take a look at this: http://papyr.com/hypertextbooks/grammar/gramchek.htm
Even a dedicated grammar checking program will only find roughly half of the most common grammatical mistakes, and the substandard and shoddy checkers in modern word processing applications are probably doing more harm than good by suggesting spurious changes to already-correct grammar.

See also:
http://seattlepi.nwsource.com/business/217802_grammar28.asp
http://itre.cis.upenn.edu/~myl/languagelog/archives/005061.html
http://itre.cis.upenn.edu/~myl/languagelog/archives/005404.html
http://writinghood.com/style/grammar/the-decline-of-english-grammar/

>>20
http://papyr.com/hypertextbooks/grammar/gramchek.htm
10. Tense shift
Example:    John was edgy all day. He challenged anything that anyone said to him. Once at a meeting, John looked right at me and he says, "What do you mean by that?"
Correction:    John was edgy all day. He challenged anything that anyone said to him. Once at a meeting, John looked right at me and he said, "What do you mean by that?"
lol @ ungrammatical "Correction" (missing comma in compound sentence)

Who the fuck actually relys on spell checkers, gb2school and lrn2spell

relys

>>23
You found the joke!

Well done!

>>23
OH THE IRONY

>>24
Butthurt.

>>26
That's what happens when you eat too many chili peppers.

rule 34 as a   crack smoking bed   bug Here s   to you Mercury.

that she will spread STDs to the  screen Use OpenGL  or DirectX I  recommend DirectX since  it minimizes the  chances of your  best players if  you can get  C to do  harm more to  follow stay tuned.

32 Name: Anonymous 2011-02-04 14:44

33 Name: Anonymous 2011-02-18 13:52

<-- check 'em dubz

34 Name: Anonymous 2012-11-23 23:06

Back to http://www.reddit.com/r/animalswithoutnecks/ please

35 Name: Anonymous 2013-09-01 13:31

Zermelo began to work on the problems of set theory under Hilbert's influence and in 1902 published his first work concerning the addition of transfinite cardinals. By that time he had also discovered the so-called Russell paradox. In 1904, he succeeded in taking the first step suggested by Hilbert towards the continuum hypothesis when he proved the well-ordering theorem (every set can be well ordered). This result brought fame to Zermelo, who was appointed Professor in Göttingen, in 1905. His proof of the well-ordering theorem, based on the powerset axiom and the axiom of choice, was not accepted by all mathematicians, mostly because the axiom of choice was a paradigm of non-constructive mathematics. In 1908, Zermelo succeeded in producing an improved proof making use of Dedekind's notion of the "chain" of a set, which became more widely-accepted; this was mainly because that same year he also offered an axiomatization of set theory.

36 Name: Anonymous 2013-09-01 15:48

Cartesian product of A and B, denoted A × B, is the set whose members are all possible ordered pairs (a,b) where a is a member of A and b is a member of B. The cartesian product of {1, 2} and {red, white} is {(1, red), (1, white), (2, red), (2, white)}.

---

Don't change these.

Name:		Email:
Entire Thread Thread List

All trademarks and copyrights on this site are owned by their respective parties. All comments and posts are the responsibility of their own posters.
- Tinychan + 2ch Mode -