Search

I feel like there's an easy win to keep up with the fragmentation of discussions without waiting for some implementation of this feature request.

All a frontend needs to do is group all posts with the same URL together and display all their comments in the as one unified comment section. If you reply to the OP, you can either choose which community the comment goes to, and maybe set a default as well.

This functionality should be an extra switch for the frontend, so that the user can disable it and see individual posts.

This also nicely avoids not knowing how to deal with moderation, as each community moderator still maintains control.

Comments from blocked communities would not appear ofc.

This would both prevent seeing the same post multiple times on your feed, but also drive view to smaller communities where comment in their sections are ignored.

cross-posted from: https://sh.itjust.works/post/8431810

> Not sure how feasible this would be, but my favourite Reddit app (Joey) has this feature. > > It allows a user to "follow" an arbitrary post or comment and receive an notifications when new comments or replies are posted. E.g. "Post 'abc' has 9 new comments" or "Comment 'xyz' has 3 new replies". > > Useful for keeping up with active threads which have gotten buried in the feed due to age, as well as cases of "I have that question too, and would love to know the answer if someone responds". > > Anyway, thanks Bazsalanszky for an already great app! It is my current most-used Lemmy app.

I originally submitted this as an app feature request, but realized that it could also be implemented into Lemmy itself. Would anyone else find this feature useful?

cross-posted from: https://infosec.pub/post/2802322

This feature is long overdue, Lemmy is getting distracting, especially with worthless replies.

This is a feature request to implement reddit's 'best' sorting algorithm for comments.

Quoting the github issue creator academician: > Here is Reddit's original announcement post for the feature, written by Randall Munroe from XKCD, and here is an article about how the ranking algorithm works under the hood. Essentially, it uses a Wilson score interval based on the ratio of upvotes to downvotes.

TL;DR:

Top sorting has the problem that early comments usually stay on top because people are more likely to read the top comment and upvote it as opposed to reading new comments at the bottom.

Hot takes into account time and is very biased towards newer comments. I frequently see a much higher voted comment (with no downvotes) below a comment that was just posted a little later (maybe this can be tweaked a little though).

Best Doesn't take time into account at all. Instead we are trying to estimate how well received a comment might be in the future (its ratio of upvotes and downvotes), given the total number of upvotes and downvotes right now. This both allows the comments to be sorted by how much people upvoted (and downvoted) them but also allows new popular comments to rise quickly.

I hope this can be implemented soon. The code for the algorithm is already available in Rust or SQL, so it shouldn't be too much work.