Re: aural browsers or screen reader rendering algorithm



André Gillibert wrote:

I tested one screen reader (JAWS) combined with Internet Explorer.
The document is read interactively. There's a key to read the next or
previous paragraph, keys to jump to a section defined by a header
level.
There's a heading navigation dialog box to see the structure of the
document and jump to a specific place.


OK, This makes some sense, the browser uses headers to delimit each logical section of the "copy", and lets the user decide the delivery sequence. What happens in logical blocks without headings, like navigation? Are they automatically delivered in logical units in the order they are encountered (FIFO)?

Better still, is there a utility to convert the html to a simple text
transcript.

This wouldn't be equivalent to a screen reader such as JAWS.
However, it may be possible to extract the data of a HTML document,
deleting navigation bars and decorative things. I don't have a
specific algorithm to recognize these things.
Moreover tables and divisions will be difficult to interpret.

I could use a text only browser like Lynx to get a rough extraction, but I was hoping to be able to review my html and get an estimation of how it is "seen" by users relying on this technology. A transcript would be a text copy of what the user would hear, in the order the user hears it.

Guess I'll have to assume that if my code is fairly logical and reasonably semantic, whatever algorithm they use, it should be rendered in an understandable manner.

Thanks.




.

Relevant Pages

  • Re: Dijkstras guarded commands
    ... but you may want to implement Floyd's algorithm as described in 'More ... Still another way is to generate the next permutation of the n statements ... on each new if[call and again jump to the first statement that tests true. ...
    (comp.lang.forth)
  • Re: Wer zu viel liked, dem glaubt man nicht
    ... Definition from Wiktionary, the free dictionary ... Jump to: navigation, search ...
    (de.etc.sprache.deutsch)
  • Re: a recurring favourite: shortest route :)
    ... "Dijkstra's algorithm is known to be a good algorithm ... The jump distance between 2 points ... > and remove some adjacent points (so that the other points lie on an arc ...
    (comp.programming)
  • Re: grub at start up
    ... Have mercy and> recommend using pinfo instead of info. ... Grrr, read page, jump to ... For me, info's navigation is kind of like using vi back in the day when you used h, j, k, and l to move the cursor around which meant you couldn't move the cursor in insert mode and pretty much everything else was just as counterintuitive. ...
    (Fedora)
  • Re: [QUIZ] Some observations on Pen and Paper (#90) or to make it fast, choose your algorithm wisely
    ... I ran across that while working on an algorithm. ... this means that you can jump from the end of one subsolution to the ... Note that for boards whose sides are a multiple of 10, ... different pattern for where the subboards went, ...
    (comp.lang.ruby)