W3C home > Mailing lists > Public > w3c-wai-ig@w3.org > October to December 2015

How the W3C Text Alternative Computation Works

From: Bryan Garaventa <bryan.garaventa@whatsock.com>
Date: Mon, 21 Dec 2015 10:41:27 -0800
To: <w3c-wai-ig@w3.org>
Cc: <accessible@googlegroups.com>
Message-ID: <005f01d13c1f$358eaa90$a0abffb0$@whatsock.com>
Recently I was asked to write a blog post explaining the naming calculation and how it works, which I've published at

I believe I've covered everything of note that should help explain the algorithm and how it works. The only controversial aspect is
the section regarding aria-hidden='false', however since this is written in the spec, this is the only way I see that logically
explains how this would impact the naming calculation. I'll pass this around to spread the word; the more who understand the
algorithm the easier it is to understand how ATs use it. Please let me know if anything is missing. 

Also, I wanted to thank Google for stepping up and doing an excellent job updating the recursive naming calculation with the most
recent release of Chrome Canary, which now has the closest recursion algorithm match for the naming calculation as compared with any
of the other browsers. This is really a great achievement, and all those who worked on this to get this done so quickly, should be
congratulated since it will have a significant impact in the future.

All the best,
Received on Monday, 21 December 2015 18:41:54 UTC

This archive was generated by hypermail 2.3.1 : Monday, 21 December 2015 18:41:55 UTC