LiveCode Forums

This saved me, thanks. I've had my head in the sand using an old version and didn't even realise they discontinued support/downloads for the community edition. Discovering this made me sad, and I found this bit of previous correspondence I had with the company in 2015, which you may find interesting...

Idk how helpful this is now, but I uploaded a barebones RSS reader a while ago. It's not a bad starting point.

http://forums.livecode.com/viewtopic.ph ... 34#p141734

Thanks!

Hypnen! Sounds like great ambient prog-disco.

I like the simplicity of it. Maybe a few more rules could even tighten things up a bit more on average... does anyone know the actual Knuth–Liang hyphenation algorithm? I can't seem to find the nuts and bolts of it--only a bunch of talk about it.

Or is it just that you want to hyphenate for readability? Or for fun, or some other sinister purpose? Craig Newman The sinister purpose :evil: is a speed reading app, which displays only word at a time on-screen. It's been done before... many times since the '70s in fact... and I've even done this ...

I wouldn't use parsing rules, it's not only slower but too prone to error. Just as I feared. Soo... anyone know of a great free hyphenation dictionary? Haha. Just kidding, I'll start digging around. I may also experiment with text resizing, though that wouldn't be ideal as it doesn't solve the comp...

richmond62 wrote: ↑

Sat Feb 17, 2018 5:21 pm

2. My first master's degree is in Linguistics

My first master's degree is in psych. But as my second is in ethics, I have too many qualms about the first to properly manipulate anyone and must instead dabble in linguistics

Ah, no! You're right, that would be unnecessary. I only meant look ahead at the text of the document/book/article to read and create an index of the words within that. Then you could match against that as you go.

I love the idea of using linguistic rules to do it, but I'm not sure how consistent (or computationally efficient) that would be. Maybe with something like Polish it might work better, but I suspect English's lower grapheme-phoneme correspondence would cause problems. I might run with the idea and s...

richmond62 wrote: ↑

Sat Feb 17, 2018 2:48 pm

but comprehension is too low

Presumably this is your comprehension as computers cannot comprehend anything.

Yes, comprehension of the text by humans. Or any other species that can read, I suppose.

Does anyone know an easy method for hyphenating words a certain number of characters or longer? I'm flashing words sequentially on screen, but comprehension is too low with very long words. Varying "exposure" time by word length has been ruled out. Obviously some kind of hyphenation dictionary will ...

Got it... you wouldn't think so from the name, but the answer lies in revXMLChildContents. function listNodes pContent put revXMLCreateTree(pContent,false,true,false) into tTreeID put revXMLRootNode(tTreeID) into tRoot put revXMLChildContents(tTreeID,tRoot,COMMA,CR,"full",-1) into tNodesList repeat ...

Guess I'll just use an XPATH expression unless someone has a better idea. I was hoping to avoid those though as they seem a bit temperamental in LC (causing LC to close without saving and without explanation if the xpath expression is formatted incorrectly in v8.1).

Thanks for the reply. That makes sense... and that was exactly how I ran my first attempt. But the issue with revXMLMatchingNode is that it only returns the first matching node. So if I have Root/nodeX/nodeY and Root/nodeX/nodeY both with the same attribute and value, only the path to the first will...

Hello all, Is there a simple way to separately list out the paths to all nodes, regardless of depth, in an XML document? revXMLMatchingNode does what I want, but unfortunately it stops at the first match and I need all the nodes with a given attribute value. The source XML often has multiple sibling...