workspace
stringclasses 1
value | channel
stringclasses 1
value | sentences
stringlengths 1
3.93k
| ts
stringlengths 26
26
| user
stringlengths 2
11
| sentence_id
stringlengths 44
53
| timestamp
float64 1.5B
1.56B
| __index_level_0__
int64 0
106k
|
|---|---|---|---|---|---|---|---|
pythondev | help | Also tried `PIL` `Image` type which didn’t work. | 2017-06-27T11:11:35.575773 | Temika | pythondev_help_Temika_2017-06-27T11:11:35.575773 | 1,498,561,895.575773 | 83,203 |
pythondev | help | you are opening it with ISO-8859-1, it wants utf-8 | 2017-06-27T11:11:41.578437 | Patty | pythondev_help_Patty_2017-06-27T11:11:41.578437 | 1,498,561,901.578437 | 83,204 |
pythondev | help | just becaues it has `.png` doesn’t mean it’s a valid png, meaning its mimetype wouldnt be png | 2017-06-27T11:12:14.592676 | Patty | pythondev_help_Patty_2017-06-27T11:12:14.592676 | 1,498,561,934.592676 | 83,205 |
pythondev | help | When I pass in `encoding="utf-8"` I still get back the same error above `UnicodeDecodeError` | 2017-06-27T11:13:05.614858 | Temika | pythondev_help_Temika_2017-06-27T11:13:05.614858 | 1,498,561,985.614858 | 83,206 |
pythondev | help | How about "rb" instead of "r"? | 2017-06-27T11:13:21.621785 | Gabriele | pythondev_help_Gabriele_2017-06-27T11:13:21.621785 | 1,498,562,001.621785 | 83,207 |
pythondev | help | `ValueError: binary mode doesn't take an encoding argument` | 2017-06-27T11:13:46.632993 | Temika | pythondev_help_Temika_2017-06-27T11:13:46.632993 | 1,498,562,026.632993 | 83,208 |
pythondev | help | With `rb` ^ | 2017-06-27T11:13:52.635395 | Temika | pythondev_help_Temika_2017-06-27T11:13:52.635395 | 1,498,562,032.635395 | 83,209 |
pythondev | help | so take the encoding argument back out | 2017-06-27T11:14:00.639050 | Gabriele | pythondev_help_Gabriele_2017-06-27T11:14:00.639050 | 1,498,562,040.63905 | 83,210 |
pythondev | help | Oh woops | 2017-06-27T11:14:05.640979 | Temika | pythondev_help_Temika_2017-06-27T11:14:05.640979 | 1,498,562,045.640979 | 83,211 |
pythondev | help | That worked :smiley: | 2017-06-27T11:14:34.654392 | Temika | pythondev_help_Temika_2017-06-27T11:14:34.654392 | 1,498,562,074.654392 | 83,212 |
pythondev | help | Thanks <@Gabriele> :taco: | 2017-06-27T11:14:42.658022 | Temika | pythondev_help_Temika_2017-06-27T11:14:42.658022 | 1,498,562,082.658022 | 83,213 |
pythondev | help | :+1: | 2017-06-27T11:15:19.674423 | Gabriele | pythondev_help_Gabriele_2017-06-27T11:15:19.674423 | 1,498,562,119.674423 | 83,214 |
pythondev | help | whhaaaa? am I supposed to be handing out tacos when someone helps me? | 2017-06-27T11:16:46.713230 | Deedee | pythondev_help_Deedee_2017-06-27T11:16:46.713230 | 1,498,562,206.71323 | 83,215 |
pythondev | help | Not enough flour or corn for that. | 2017-06-27T11:16:58.718893 | Deedee | pythondev_help_Deedee_2017-06-27T11:16:58.718893 | 1,498,562,218.718893 | 83,216 |
pythondev | help | Check the intro doc :slightly_smiling_face: | 2017-06-27T11:17:11.724126 | Beula | pythondev_help_Beula_2017-06-27T11:17:11.724126 | 1,498,562,231.724126 | 83,217 |
pythondev | help | Also the topic | 2017-06-27T11:17:20.728507 | Beula | pythondev_help_Beula_2017-06-27T11:17:20.728507 | 1,498,562,240.728507 | 83,218 |
pythondev | help | taco bot is pretty annoying when it comes to DM’s though :joy: | 2017-06-27T11:17:34.734611 | Temika | pythondev_help_Temika_2017-06-27T11:17:34.734611 | 1,498,562,254.734611 | 83,219 |
pythondev | help | I’ve turned off DM notifications about receiving / handing out tacos each week about 6 times now and it *still* does it | 2017-06-27T11:17:50.741664 | Temika | pythondev_help_Temika_2017-06-27T11:17:50.741664 | 1,498,562,270.741664 | 83,220 |
pythondev | help | so, got a question about python string casing. I have a large number (25K) PDF documents indexed in SOLR via `pdfminer`. Problem is, text casing is irregular, to say the least | 2017-06-27T11:24:43.923959 | Meg | pythondev_help_Meg_2017-06-27T11:24:43.923959 | 1,498,562,683.923959 | 83,221 |
pythondev | help | is there a library I can use to apply grammar rules in regard to text casing? | 2017-06-27T11:25:14.937582 | Meg | pythondev_help_Meg_2017-06-27T11:25:14.937582 | 1,498,562,714.937582 | 83,222 |
pythondev | help | Just tread it :joy: great sense of humor. Thanks for the link. | 2017-06-27T11:26:54.983667 | Deedee | pythondev_help_Deedee_2017-06-27T11:26:54.983667 | 1,498,562,814.983667 | 83,223 |
pythondev | help | <@Beula> :taco: | 2017-06-27T11:27:17.994434 | Deedee | pythondev_help_Deedee_2017-06-27T11:27:17.994434 | 1,498,562,837.994434 | 83,224 |
pythondev | help | What would be the intended end result? | 2017-06-27T11:32:44.143244 | Gabriele | pythondev_help_Gabriele_2017-06-27T11:32:44.143244 | 1,498,563,164.143244 | 83,225 |
pythondev | help | ```
PrinCiPleS oF bioloGyi
PrinCiPleS oF bioloGy ii
```
to
```Principles of Biology I
Principles of Biology II``` | 2017-06-27T11:33:31.164534 | Meg | pythondev_help_Meg_2017-06-27T11:33:31.164534 | 1,498,563,211.164534 | 83,226 |
pythondev | help | Okay, so you're seeking some sort of normalised form | 2017-06-27T11:34:42.195839 | Gabriele | pythondev_help_Gabriele_2017-06-27T11:34:42.195839 | 1,498,563,282.195839 | 83,227 |
pythondev | help | correct | 2017-06-27T11:34:50.199757 | Meg | pythondev_help_Meg_2017-06-27T11:34:50.199757 | 1,498,563,290.199757 | 83,228 |
pythondev | help | based on regular english rules governing capitalization | 2017-06-27T11:35:04.205396 | Meg | pythondev_help_Meg_2017-06-27T11:35:04.205396 | 1,498,563,304.205396 | 83,229 |
pythondev | help | I can find things for spelling correction | 2017-06-27T11:35:16.210521 | Meg | pythondev_help_Meg_2017-06-27T11:35:16.210521 | 1,498,563,316.210521 | 83,230 |
pythondev | help | You're potentially looking at PhD level amounts of NLP here to do it properly, but maybe you don't need _properly_ | 2017-06-27T11:35:22.213481 | Gabriele | pythondev_help_Gabriele_2017-06-27T11:35:22.213481 | 1,498,563,322.213481 | 83,231 |
pythondev | help | but not with capitalization | 2017-06-27T11:35:26.215163 | Meg | pythondev_help_Meg_2017-06-27T11:35:26.215163 | 1,498,563,326.215163 | 83,232 |
pythondev | help | yeah, agreed | 2017-06-27T11:35:56.228261 | Meg | pythondev_help_Meg_2017-06-27T11:35:56.228261 | 1,498,563,356.228261 | 83,233 |
pythondev | help | I mean, I could lowercase them all | 2017-06-27T11:36:05.232399 | Meg | pythondev_help_Meg_2017-06-27T11:36:05.232399 | 1,498,563,365.232399 | 83,234 |
pythondev | help | The example you gave is a good edge case... because capitalisation works differently if the context is a heading | 2017-06-27T11:36:26.241495 | Gabriele | pythondev_help_Gabriele_2017-06-27T11:36:26.241495 | 1,498,563,386.241495 | 83,235 |
pythondev | help | correct | 2017-06-27T11:36:34.245225 | Meg | pythondev_help_Meg_2017-06-27T11:36:34.245225 | 1,498,563,394.245225 | 83,236 |
pythondev | help | all this is text extracted from a PDF | 2017-06-27T11:36:41.248066 | Meg | pythondev_help_Meg_2017-06-27T11:36:41.248066 | 1,498,563,401.248066 | 83,237 |
pythondev | help | so, source is pretty questionable, in a structured format perspective | 2017-06-27T11:37:02.257055 | Meg | pythondev_help_Meg_2017-06-27T11:37:02.257055 | 1,498,563,422.257055 | 83,238 |
pythondev | help | I'd probably just lowercase them to make it simple | 2017-06-27T11:37:11.260967 | Beula | pythondev_help_Beula_2017-06-27T11:37:11.260967 | 1,498,563,431.260967 | 83,239 |
pythondev | help | What is the purpose of changing the case? Is it for display to end users, or for facilitating search, or...? | 2017-06-27T11:37:35.271621 | Gabriele | pythondev_help_Gabriele_2017-06-27T11:37:35.271621 | 1,498,563,455.271621 | 83,240 |
pythondev | help | display to end user | 2017-06-27T11:38:24.293113 | Meg | pythondev_help_Meg_2017-06-27T11:38:24.293113 | 1,498,563,504.293113 | 83,241 |
pythondev | help | <https://pypi.python.org/pypi/gingerit> | 2017-06-27T11:38:30.295863 | Jamey | pythondev_help_Jamey_2017-06-27T11:38:30.295863 | 1,498,563,510.295863 | 83,242 |
pythondev | help | basically, enter in a search query, and list of results shows | 2017-06-27T11:38:43.301853 | Meg | pythondev_help_Meg_2017-06-27T11:38:43.301853 | 1,498,563,523.301853 | 83,243 |
pythondev | help | <https://pypi.python.org/pypi/language-check> | 2017-06-27T11:38:47.303472 | Jamey | pythondev_help_Jamey_2017-06-27T11:38:47.303472 | 1,498,563,527.303472 | 83,244 |
pythondev | help | with click handlers for selection | 2017-06-27T11:38:50.304534 | Meg | pythondev_help_Meg_2017-06-27T11:38:50.304534 | 1,498,563,530.304534 | 83,245 |
pythondev | help | <https://pypi.python.org/pypi/grammar-check/1.3.1> | 2017-06-27T11:39:07.312307 | Jamey | pythondev_help_Jamey_2017-06-27T11:39:07.312307 | 1,498,563,547.312307 | 83,246 |
pythondev | help | <@Meg> check those 3 modules | 2017-06-27T11:39:27.321207 | Jamey | pythondev_help_Jamey_2017-06-27T11:39:27.321207 | 1,498,563,567.321207 | 83,247 |
pythondev | help | Haven't tried any of them actually but would love to hear your feedback :slightly_smiling_face: | 2017-06-27T11:40:13.341365 | Jamey | pythondev_help_Jamey_2017-06-27T11:40:13.341365 | 1,498,563,613.341365 | 83,248 |
pythondev | help | I would presume you'd index on `lower(thing)` and search that way, but find in the document fuzzily based on the string for display (granted not sure if solr supports that) | 2017-06-27T11:41:05.364575 | Beula | pythondev_help_Beula_2017-06-27T11:41:05.364575 | 1,498,563,665.364575 | 83,249 |
pythondev | help | well, solr search is case insensitive by default, I believe | 2017-06-27T11:41:28.375224 | Meg | pythondev_help_Meg_2017-06-27T11:41:28.375224 | 1,498,563,688.375224 | 83,250 |
pythondev | help | <@Jamey> thanks for the tips! | 2017-06-27T11:42:46.409779 | Meg | pythondev_help_Meg_2017-06-27T11:42:46.409779 | 1,498,563,766.409779 | 83,251 |
pythondev | help | Oh I see, it's really just what is contained in the doc isn't necessarily correct. :whoosh: | 2017-06-27T11:43:04.417260 | Beula | pythondev_help_Beula_2017-06-27T11:43:04.417260 | 1,498,563,784.41726 | 83,252 |
pythondev | help | Personally I'd just do `[sentence.lower().capitalize() for sentence in sentences]` and wait to see if that was sufficient. :slightly_smiling_face: | 2017-06-27T11:44:40.459223 | Gabriele | pythondev_help_Gabriele_2017-06-27T11:44:40.459223 | 1,498,563,880.459223 | 83,253 |
pythondev | help | Finding where one sentence ends and another starts, in badly scraped data... well, that's another problem | 2017-06-27T11:45:15.474466 | Gabriele | pythondev_help_Gabriele_2017-06-27T11:45:15.474466 | 1,498,563,915.474466 | 83,254 |
pythondev | help | oh agreed | 2017-06-27T11:47:40.535428 | Meg | pythondev_help_Meg_2017-06-27T11:47:40.535428 | 1,498,564,060.535428 | 83,255 |
pythondev | help | text is tricky | 2017-06-27T11:47:44.537596 | Meg | pythondev_help_Meg_2017-06-27T11:47:44.537596 | 1,498,564,064.537596 | 83,256 |
pythondev | help | <@Gabriele> may be a script can be written to search for `\n` as well as `.` and `,` in the data to detect the start of new sentences? | 2017-06-27T11:48:36.559843 | Jamey | pythondev_help_Jamey_2017-06-27T11:48:36.559843 | 1,498,564,116.559843 | 83,257 |
pythondev | help | It's better than nothing | 2017-06-27T11:49:08.572889 | Gabriele | pythondev_help_Gabriele_2017-06-27T11:49:08.572889 | 1,498,564,148.572889 | 83,258 |
pythondev | help | Hope any of them would be usefull :smiley: | 2017-06-27T11:50:04.597291 | Jamey | pythondev_help_Jamey_2017-06-27T11:50:04.597291 | 1,498,564,204.597291 | 83,259 |
pythondev | help | Hello guys, has anyone tried Dan Bader’s Python Tricks The Book? I wanted to know if it is really good as it is claimed on the author’s page | 2017-06-27T11:53:21.682509 | Clarence | pythondev_help_Clarence_2017-06-27T11:53:21.682509 | 1,498,564,401.682509 | 83,260 |
pythondev | help | i’ve heard his stuff is good but i have no experience with it personally. | 2017-06-27T11:54:49.720359 | Johana | pythondev_help_Johana_2017-06-27T11:54:49.720359 | 1,498,564,489.720359 | 83,261 |
pythondev | help | You could always look for ends of sentences, capitalize next alpha character. Search against databases for pronouns and such | 2017-06-27T12:34:01.696363 | Myong | pythondev_help_Myong_2017-06-27T12:34:01.696363 | 1,498,566,841.696363 | 83,262 |
pythondev | help | Hello guys I got a huge problem | 2017-06-27T13:09:56.535046 | Hyman | pythondev_help_Hyman_2017-06-27T13:09:56.535046 | 1,498,568,996.535046 | 83,263 |
pythondev | help | <@Hyman> ask away | 2017-06-27T13:10:44.553240 | Myong | pythondev_help_Myong_2017-06-27T13:10:44.553240 | 1,498,569,044.55324 | 83,264 |
pythondev | help | We've been ask as assignment the implementation of Dijkstra's and Bellman Ford's algorithm for calculating the shortest path in a given graph | 2017-06-27T13:13:12.608617 | Hyman | pythondev_help_Hyman_2017-06-27T13:13:12.608617 | 1,498,569,192.608617 | 83,265 |
pythondev | help | So what's the issue? | 2017-06-27T13:14:11.631014 | Myong | pythondev_help_Myong_2017-06-27T13:14:11.631014 | 1,498,569,251.631014 | 83,266 |
pythondev | help | run into a problem? | 2017-06-27T13:14:20.634557 | Myong | pythondev_help_Myong_2017-06-27T13:14:20.634557 | 1,498,569,260.634557 | 83,267 |
pythondev | help | I don't really know how to start and that's my problem | 2017-06-27T13:15:05.651654 | Hyman | pythondev_help_Hyman_2017-06-27T13:15:05.651654 | 1,498,569,305.651654 | 83,268 |
pythondev | help | Well were you given code to start off with as far as "i will give you this input" in order to build the graph you have with the path weights and what not? | 2017-06-27T13:16:31.684418 | Myong | pythondev_help_Myong_2017-06-27T13:16:31.684418 | 1,498,569,391.684418 | 83,269 |
pythondev | help | The Input to the algorithms is an oriented graph with weights | 2017-06-27T13:18:01.718549 | Hyman | pythondev_help_Hyman_2017-06-27T13:18:01.718549 | 1,498,569,481.718549 | 83,270 |
pythondev | help | So then you have to build the graph in the code, yes? | 2017-06-27T13:18:40.733389 | Myong | pythondev_help_Myong_2017-06-27T13:18:40.733389 | 1,498,569,520.733389 | 83,271 |
pythondev | help | More precisely compute the shortest path from a given source to all the other nodes | 2017-06-27T13:20:01.763870 | Hyman | pythondev_help_Hyman_2017-06-27T13:20:01.763870 | 1,498,569,601.76387 | 83,272 |
pythondev | help | I understand that, I am just asking if you have anything to build off of like code given to you to complete the task or if you have to start from scratch and build the graph in code then calculate it. | 2017-06-27T13:22:00.809588 | Myong | pythondev_help_Myong_2017-06-27T13:22:00.809588 | 1,498,569,720.809588 | 83,273 |
pythondev | help | You need to code the algorithm from scratch and supply it with a graph in a text file and it'll calculate the shortest path in it | 2017-06-27T13:28:26.961067 | Hyman | pythondev_help_Hyman_2017-06-27T13:28:26.961067 | 1,498,570,106.961067 | 83,274 |
pythondev | help | can you give an example input | 2017-06-27T13:29:05.976389 | Myong | pythondev_help_Myong_2017-06-27T13:29:05.976389 | 1,498,570,145.976389 | 83,275 |
pythondev | help | <@Hyman> how much experience do you have writing code? | 2017-06-27T13:32:12.050908 | Meg | pythondev_help_Meg_2017-06-27T13:32:12.050908 | 1,498,570,332.050908 | 83,276 |
pythondev | help | for example, there are quite a number of existing examples of the algorithms you're talking about | 2017-06-27T13:32:38.061507 | Meg | pythondev_help_Meg_2017-06-27T13:32:38.061507 | 1,498,570,358.061507 | 83,277 |
pythondev | help | basic i'm just starting | 2017-06-27T13:32:47.064717 | Hyman | pythondev_help_Hyman_2017-06-27T13:32:47.064717 | 1,498,570,367.064717 | 83,278 |
pythondev | help | ok | 2017-06-27T13:32:50.066257 | Meg | pythondev_help_Meg_2017-06-27T13:32:50.066257 | 1,498,570,370.066257 | 83,279 |
pythondev | help | can you describe the steps on how you execute the algorithm? | 2017-06-27T13:33:03.070903 | Meg | pythondev_help_Meg_2017-06-27T13:33:03.070903 | 1,498,570,383.070903 | 83,280 |
pythondev | help | and do you understand why those steps are necessary? | 2017-06-27T13:33:19.077301 | Meg | pythondev_help_Meg_2017-06-27T13:33:19.077301 | 1,498,570,399.077301 | 83,281 |
pythondev | help | if so, then the next step you take is translating your written description of the process into pseudocode | 2017-06-27T13:33:53.090833 | Meg | pythondev_help_Meg_2017-06-27T13:33:53.090833 | 1,498,570,433.090833 | 83,282 |
pythondev | help | once you have a reasonable sequence of actions, you then implement the pseudocode in your language of choice | 2017-06-27T13:34:17.100153 | Meg | pythondev_help_Meg_2017-06-27T13:34:17.100153 | 1,498,570,457.100153 | 83,283 |
pythondev | help | frankly, the first two items are always the most difficult | 2017-06-27T13:34:41.109545 | Meg | pythondev_help_Meg_2017-06-27T13:34:41.109545 | 1,498,570,481.109545 | 83,284 |
pythondev | help | because it requires you to understand the problem domain | 2017-06-27T13:34:52.113909 | Meg | pythondev_help_Meg_2017-06-27T13:34:52.113909 | 1,498,570,492.113909 | 83,285 |
pythondev | help | once you understand it, making it work is usually much less effort | 2017-06-27T13:35:08.120307 | Meg | pythondev_help_Meg_2017-06-27T13:35:08.120307 | 1,498,570,508.120307 | 83,286 |
pythondev | help | oof graph theory for a beginner. do you understand how those algorithms work, <@Hyman> ? | 2017-06-27T13:41:19.264188 | Patty | pythondev_help_Patty_2017-06-27T13:41:19.264188 | 1,498,570,879.264188 | 83,287 |
pythondev | help | Yes I understand how those work | 2017-06-27T13:42:14.285096 | Hyman | pythondev_help_Hyman_2017-06-27T13:42:14.285096 | 1,498,570,934.285096 | 83,288 |
pythondev | help | just having trouble translating described steps to code? | 2017-06-27T13:42:34.292979 | Meg | pythondev_help_Meg_2017-06-27T13:42:34.292979 | 1,498,570,954.292979 | 83,289 |
pythondev | help | I saw this today, <https://github.com/stackimpact/stackimpact-python>. Looks nice, but don't think we could use that internally. Anyone have any experience with Stack Impact, or know of something that would provide similar data without sending it to an outside source? Even just having the data print out at the end of a run would be great. | 2017-06-27T14:45:28.807216 | Meghan | pythondev_help_Meghan_2017-06-27T14:45:28.807216 | 1,498,574,728.807216 | 83,290 |
pythondev | help | <@Meghan> I dont know of any tool that does all of that. But I know of many tools that do peices | 2017-06-27T15:29:03.785865 | Signe | pythondev_help_Signe_2017-06-27T15:29:03.785865 | 1,498,577,343.785865 | 83,291 |
pythondev | help | What data are you mainly interested in? | 2017-06-27T15:29:15.790305 | Signe | pythondev_help_Signe_2017-06-27T15:29:15.790305 | 1,498,577,355.790305 | 83,292 |
pythondev | help | The charts are pretty, but I would just like to see which calls are blocking and for how long. | 2017-06-27T15:29:35.797226 | Meghan | pythondev_help_Meghan_2017-06-27T15:29:35.797226 | 1,498,577,375.797226 | 83,293 |
pythondev | help | For most of my code it's pretty clear anyway, and I throw in timing decorators at the really long ones. | 2017-06-27T15:30:09.809843 | Meghan | pythondev_help_Meghan_2017-06-27T15:30:09.809843 | 1,498,577,409.809843 | 83,294 |
pythondev | help | so, if you just want CPU profiling, then vprof works really well. | 2017-06-27T15:30:37.819912 | Signe | pythondev_help_Signe_2017-06-27T15:30:37.819912 | 1,498,577,437.819912 | 83,295 |
pythondev | help | Having a monitoring system for users who use my scripts would be nice too though. Right now I just have them email the logs if somethign goes wrong. | 2017-06-27T15:30:39.820608 | Meghan | pythondev_help_Meghan_2017-06-27T15:30:39.820608 | 1,498,577,439.820608 | 83,296 |
pythondev | help | So, for "errors", I highly recommend sentry | 2017-06-27T15:30:54.825846 | Signe | pythondev_help_Signe_2017-06-27T15:30:54.825846 | 1,498,577,454.825846 | 83,297 |
pythondev | help | basically, anyone not using sentry, should be doing it right now | 2017-06-27T15:31:14.832771 | Signe | pythondev_help_Signe_2017-06-27T15:31:14.832771 | 1,498,577,474.832771 | 83,298 |
pythondev | help | its a game changer | 2017-06-27T15:31:21.835450 | Signe | pythondev_help_Signe_2017-06-27T15:31:21.835450 | 1,498,577,481.83545 | 83,299 |
pythondev | help | Having a syslog server for loggign would be amazing, however the logs get extremely large for some scripts. | 2017-06-27T15:31:22.835814 | Meghan | pythondev_help_Meghan_2017-06-27T15:31:22.835814 | 1,498,577,482.835814 | 83,300 |
pythondev | help | One of them produces a log so large the last step in the script is to zip and delete its own logs. | 2017-06-27T15:32:11.852917 | Meghan | pythondev_help_Meghan_2017-06-27T15:32:11.852917 | 1,498,577,531.852917 | 83,301 |
pythondev | help | So, what do you actually use the logs for though? | 2017-06-27T15:32:26.858378 | Signe | pythondev_help_Signe_2017-06-27T15:32:26.858378 | 1,498,577,546.858378 | 83,302 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.