Wikipedia:Reference desk/Archives/Computing/2018 January 12
Computing desk | ||
---|---|---|
< January 11 | << Dec | January | Feb >> | January 13 > |
Welcome to the Wikipedia Computing Reference Desk Archives |
---|
The page you are currently viewing is an archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages. |
January 12
[edit]Change real name on Freenode IRC channel
[edit]Hi all. I use the website webchat
- I highly recommend getting a proper IRC client. I use mIRC.
- https://freenode.net/kb/answer/cloaks
- https://meta.wikimedia.org/wiki/IRC/Cloaks/en
- (((The Quixotic Potato))) (talk) 12:54, 12 January 2018 (UTC)
- Meno, try Firefox ESR or Waterfox — Preceding unsigned comment added by 78.0.222.210 (talk) 02:56, 19 January 2018 (UTC)
- Thank you, 78. That's what I needed to know. --Meno25 (talk) 12:00, 19 January 2018 (UTC)
Registry cleanup
[edit]I use CleanMyPC Registry Cleaner to clean the registry on my Win 10 (only C disk is present, unpartitioned). It typically finds around 10-20 items to clean during periodic scans, but Avast's Cleanup Premium in the antivirus finds 1,511 entries to clean (with an additional 23,35 GB of claimed redundant data, even though I also regularly do Windows disk cleanup). Which one to trust? My gut says that Avast Cleanup Premium actually exaggerates the real numbers, listing redundant entries. Brandmeistertalk 15:38, 12 January 2018 (UTC)
- I don't know but you might want to read Registry cleaner. Bubba73 You talkin' to me? 15:57, 12 January 2018 (UTC)
- {[ec}} Registry cleaners are pointless. They can cause problems and are almost never useful. And Avast's Cleanup finds stuff outside of the registry. I wouldn't recommend using Avast's Cleanup either. (((The Quixotic Potato))) (talk) 16:00, 12 January 2018 (UTC)
How to call this type of algorithms?
[edit]For a learning project, I wrote a function that checks if the given sentences matches a predefined pattern like, for example:
match("she is very pretty", "she is #adv? #adj") === true
match("she is classy", "she is #adv? #adj") === true
match("he is awesome", "she is #adv? #adj") === false
The name match doesn't provide much information about it. What would be an appropriate name for it? What's the correct way of describing this kind of algorithm? Pattern matching? Grammar matching? Template matching? (I searched for this on Wikipedia but didn't find what I was looking for) --129.45.127.206 (talk) 19:41, 12 January 2018 (UTC)
- parse v. analyze syntactically by assigning a constituent structure to a sentence, see Parsing. SdrawkcaB99 (talk) 19:54, 12 January 2018 (UTC)
- matchWords? You may like Categorial grammar Joepnl (talk) 23:47, 12 January 2018 (UTC)
- The pcode looks like a natural language parser. There are different algorithms for this sort of thing: the Recursive_descent_parser is a common choice, and the article has an implementation in C, so you can see how it works.OldTimeNESter (talk) 02:27, 13 January 2018 (UTC)