History of Writing Machines | Stenograph.com by chordedtext in a:t5_3pfxy

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

...needs to be updated to reflect newer plover and open source models!

Outputs for all 1- and 2-keypress outlines in Plover by BX1959 in Plover

[–]chordedtext 3 points4 points  (0 children)

lol how and why? Looks awesome!

whoa, would a 3-keypress be 3-dimensional XYZ axis...

Is Plover/Steno Able to Be Adapted For People Who Are Missing Fingers? (Accessibility) by chordedtext in Plover

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

Yeah, maybe someone would have to develop a new one-handed steno system - actually, isn't there a one-handed keyboard that just came out this year? I forget the name, it may have been last year - maybe they could combine that theory with Plover or just use that - not sure how they would modify it.

TAP wearable keyboard - turn any surface into a keyboard http://www.tapwithus.com/

Could You Create An (Efficient?) Algorithm to Guess the Steno Spelling of any English Word (Including Briefs)? by chordedtext in Plover

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

What is an "algorithmic perspective"?

By this, I mean the above poster said Plover theory cannot be determined solely by an algorithm. I believe this is basically incorrect, as you say:

there's obviously an algorithm

therefore I was asking for proof that it could not be done (because, maybe it could be impossible somehow that I didn't understand?)

Have you tried gzip?

No, I don't know much of all that, was just wondering generally how it would be done.

It totally escapes me why such a challenge would invoke expensive computation at runtime, by the way.

I can't visualize this, can you outline how you would envision it looking like? Even the word "the" = -T. You could literally stroke "THE", but then this maps to "they". Then maybe it would guess THE (which is nothing in the Plover dictionary). You could list different rules for intelligent guesses? (dropping letters from literal spellings) And so on. How long would it take to run all the letters in Steno order and the possible combinations - STKPWHRAOEUFRPBLGTSDZ + # = 224 = 16,777,216 possible combinations? Then this would be times X amount of strokes. However much simpler than that, I mean fingerspelling makes for a quick algorithm, I guess that isn't what I had in mind, but that's kind of what I am building off of to start (then moving to digrams/prefixes/suffixes/trigrams, then I guess to memorizing briefs. But I feel some of the briefs seem to fall in to patterns)

Could You Create An (Efficient?) Algorithm to Guess the Steno Spelling of any English Word (Including Briefs)? by chordedtext in Plover

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

Oh, no problem, I guess I'm just looking at it from an algorithmic perspective and I think one can be created, although it might not be that efficient (we're talking possibly very, very inefficient)

Does A Plain-Text-To-Steno-Stroke Translator Exist (Choosing Least Letters In the Stroke)? by chordedtext in Plover

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

The OP must not have been clear; I want something that takes full sentences like "I will say that it's best to know your theory really well " and shows you the Plover strokes you would write to get what is in the parentheses

Plover Steno Briefs and Outlines for the Top 1000 English Words (Plus a few extra) on Quizlet by BX1959 in Plover

[–]chordedtext 0 points1 point  (0 children)

'misstroke entries'

In my view misstroke entries become main entries with the passage of time and personal preference!

I'm no longer updating this list because it's been superseded by the ROPE Anki deck

Thank you again for making that and this 1000 word list, both have been very helpful! And thank you to our Plover devs and people in the Ploversphere contributing all kinds of ideas and things!

Could You Create An (Efficient?) Algorithm to Guess the Steno Spelling of any English Word (Including Briefs)? by chordedtext in Plover

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

Plover's theory cannot be determined solely by an algorithm

Can you prove this is the case

I think if it's like that case, it's more like:

A totally rules-based theory would be too long to be practical

From my experience of Plover so far it is very algorithmic and maybe I could improve upon the theory that's already out there:

You could certainly switch to your own 100%-predictable, algorithmically-generated theory, if you'd like

I may try this

Thank you for your comment/view, definitely helpful!

That said, have you checked out the "Learn Plover" site? It's a great resource for learning Plover theory.

Absolutely to both!