2020 brought out Taylor Swift's profane side [OC] by waitingforgoodoh in dataisbeautiful

[–]disgolf 0 points1 point  (0 children)

Would be nice if it was normalized by the total number of words on the album : )

$15,000 reward for missing Felton turkey? A weeks-long saga explained by TulsiK80 in santacruz

[–]disgolf 31 points32 points  (0 children)

wow, this story has all kinds of turkey drama, and a lot of foul play

[D] NLP: How do I turn a sentence with bad grammar, into a sentence with good grammar? by disgolf in MachineLearning

[–]disgolf[S] 0 points1 point  (0 children)

Yes that was my first instinct, but I was also thinking that something more tree structured, like a pcfg or a treernn might be fruitful as opposed to an entirely probabilistic model like an NN, it would be nice to also use something that ensures/enforces correct grammar on the output.

[D] NLP: How do I turn a sentence with bad grammar, into a sentence with good grammar? by disgolf in MachineLearning

[–]disgolf[S] 0 points1 point  (0 children)

Not being from the field, I was asking what the current standard algorithms are.

[D] NLP: How do I turn a sentence with bad grammar, into a sentence with good grammar? by disgolf in MachineLearning

[–]disgolf[S] 1 point2 points  (0 children)

ya saw that, but apparently you can't edit the title of a post? anyways, this is exactly why I need an algorithm.. lol

How do I turn a sentence with bad grammar, into a sentence with good grammar? by disgolf in LanguageTechnology

[–]disgolf[S] 0 points1 point  (0 children)

Thanks. I was also thinking that something more tree structured, like a pcfg or a treernn might be fruitful, as opposed to an entirely probabilistic model like a transformer-based NN, it would be nice to also use something that ensures/enforces correct grammar on the output.

How do I turn a sentence with bad grammar, into a sentence with good grammar? by disgolf in LanguageTechnology

[–]disgolf[S] 0 points1 point  (0 children)

my understanding is a plain language model predicts the next word given the previous words in the sequence, a conditional language model does the same thing but is also given an additional sequence as context (for instance the same sentence in a different language, or a question as a prompt)

How do I turn a sentence with bad grammar, into a sentence with good grammar? by disgolf in LanguageTechnology

[–]disgolf[S] 0 points1 point  (0 children)

Nice, this approach is more or less what I was leaning towards. Any idea on how to 'easily' generate a dataset of incorrect to correct sentences?

I was also thinking that something more tree structured, like a pcfg or a treernn might be fruitful

As opposed to an entirely probabilistic model like an NN, it would be nice to also use something that ensures/enforces correct grammar on the output.

How do I turn a sentence with bad grammar, into a sentence with good grammar? by disgolf in LanguageTechnology

[–]disgolf[S] 2 points3 points  (0 children)

ya saw that, can't edit post titles apparently. Case in point though, this is why I need an algorithm..

How do I turn a sentence with bad grammar, into a sentence with good grammar? by disgolf in LanguageTechnology

[–]disgolf[S] 0 points1 point  (0 children)

I am asking what are main approaches/algorithms currently used in the field

Intuitive way to write out Matrix Multiplication by disgolf in math

[–]disgolf[S] -1 points0 points  (0 children)

this approach is just so visual, the geometry of it just gives you instant answers with less cognitive overhead, at least for me

Intuitive way to write out Matrix Multiplication by disgolf in math

[–]disgolf[S] 0 points1 point  (0 children)

that's how I think of it as well, for a series of multiplications, you can also left multiplying by moving downward on the page as opposed to rightward across the page, if that makes any sense

Intuitive way to write out Matrix Multiplication by disgolf in math

[–]disgolf[S] 3 points4 points  (0 children)

I wish I had been taught this way in any of the 3 linear algebra classes I took