• Welcome to the Speedsolving.com, home of the web's largest puzzle community!
    You are currently viewing our forum as a guest which gives you limited access to join discussions and access our other features.

    Registration is fast, simple and absolutely free so please, join our community of 35,000+ people from around the world today!

    If you are already a member, simply login to hide this message and begin participating in the community!

CoLPI - collective letter-pair images database for BLD. In all languages.

Joined
Jan 10, 2013
Messages
611
Likes
393
Location
Saint Petersburg, Russia
WCA
2012STRA02
YouTube
MrWormster
Thread starter #1
Inspired by Tom's Letter Pair List, this tool is intended to collect letter-pair images used by different people in all languages.
Huge thanks to Tom Nelson for the initial set of words and Enoch Gray for exporting this collection (as well as his own!) into CoLPI.

>>> bestsiteever.ru/colpi <<<

Features:
  • Quick search for words on certain letter-pair
  • Multiple languages support
  • PAO support
  • Export as table (.csv)
  • Export as Anki deck (.txt)
Screenshot from 2019-07-03 00-01-48.png

Before exporting to Anki or csv, make sure no words appear twice for different letter-pairs. How?

Deal with offensive words. Maybe in user settings panel he may specify "show offensive words" - an option which is disabled by default.

Deal with PAO type. So far users can specify/edit it but it isn't used anywhere.

Add two-letters-per-sticker option. Most likely I would never do that as it requires a complete DB rebuilding.

Passive learning page. Same as http://bestsiteever.ru/stare but for letter-pairs, so that beginners can "passively" learn words by staring at the screen while doing dishes or pushups.
edit: thanks to xyzzy, I have started this https://docs.google.com/document/d/1Eexb0EI5473gcbc81gMj8i4ZHb1Z7uqn_tzG7Tfzw10/edit?usp=sharing

I have an intention to do similar tool where users can submit their 3cycle/flip/twist/parity algs and vote for them.
 
Last edited:
Joined
Dec 24, 2015
Messages
1,500
Likes
959
#2
I have an intention to do similar tool where users can submit their 3cycle/flip/twist/parity algs and vote for them. Fot that, I would need an advice from someone good at SQL on resolving this issue:
(I'm not good at SQL so maybe I'm talking nonsense.) I think what you're looking for is some way of canonically naming the 3-cycle cases. Rather than restricting to a fixed set of buffers, what if you consider the general problem of referring to any 3-cycle (with any buffer)? Then for edges you have six choices of a letter triplet, and for corners you have nine choices of a letter triplet; you could always pick the alphabetically earliest one as the canonical name for that 3-cycle. So for example, UF-FD-BL would have CKR, KRC, RCK, UHI, HIU, IUH as the six choices (using Speffz), and CKR is the alphabetically earliest one, so that's the canonical name. It wouldn't matter whether the user is actually using UF or DF (or FU or FD) as their buffer because the case's name doesn't depend on that.
 
Joined
Oct 19, 2017
Messages
496
Likes
286
WCA
2015KUCA01
YouTube
channel/UCKY9uCII2wIfPmLidA_KXMA
#3
Rather than restricting to a fixed set of buffers, what if you consider the general problem of referring to any 3-cycle (with any buffer)?
This makes it a bit hard to learn. I think a good way to do it would be to choose the buffer, and then it gives you options for the next pieces after that. It would be a lot more user friendly to be able to see all the cycles for a specific buffer.
 
Joined
Jan 10, 2013
Messages
611
Likes
393
Location
Saint Petersburg, Russia
WCA
2012STRA02
YouTube
MrWormster
Thread starter #9
Updates!
  • Once logged in with WCA, you stay logged in forever until clicking "logout".
  • Quick quiz for the least filled letter-pair. You will see the question "Which word would you use for ...?" when open coLPI.
  • Fixed: accent marks collation. "Sabiá" and "Sábia" are now considered different words, "AÑ" and "AN" are different letter-pairs.
  • Added website footer with some stats.

A lot is yet to be done. Web programming turned out to be fascinating :p
 
Joined
Jan 10, 2013
Messages
611
Likes
393
Location
Saint Petersburg, Russia
WCA
2012STRA02
YouTube
MrWormster
Thread starter #10
(I'm not good at SQL so maybe I'm talking nonsense.) I think what you're looking for is some way of canonically naming the 3-cycle cases. Rather than restricting to a fixed set of buffers, what if you consider the general problem of referring to any 3-cycle (with any buffer)? Then for edges you have six choices of a letter triplet, and for corners you have nine choices of a letter triplet; you could always pick the alphabetically earliest one as the canonical name for that 3-cycle. So for example, UF-FD-BL would have CKR, KRC, RCK, UHI, HIU, IUH as the six choices (using Speffz), and CKR is the alphabetically earliest one, so that's the canonical name. It wouldn't matter whether the user is actually using UF or DF (or FU or FD) as their buffer because the case's name doesn't depend on that.
That is exactly what I need!
And I need to also refer to multiple cycles at once (like 2e2e algs) as well as flips and twists. And I think involving Speffz is redundant. Here is my approach: Cube cycles canonical representation.

Do you see any flaws in it? Am I reinventing the wheel?
 
Top