- From: Kynn Bartlett <kynn-edapta@idyllmtn.com>
- Date: Mon, 30 Jul 2001 11:13:56 -0400
- To: Al Gilman <asgilman@iamdigex.net>, <w3c-wai-gl@w3.org>
At 12:23 PM -0400 2001/7/29, Al Gilman wrote: >There is a third approach where one passes a grade level parameter to a Reef >style view synthesis processor and for example there are explicit >hyperlinks to >explanatory resources attached to tough words and sentences for an adapted, >appropriate definition of 'tough.' Al, considering how to implement this (although I'm not sure it's the "best" way, but it may be "better" than what we have now, which is the Edapta -- er, Reef -- goal), I'm wondering if you know of any way to algorithmically determine the "grade level" for particular words and/or phrases. In other words how do I figure out what's "tough"? Any direction (books or research to look up) you could provide would be helpful! (Are we veering into NLP territory here?) --Kynn -- Kynn Bartlett <kynn@reef.com> Technical Developer Liaison Reef North America Accessibility - W3C - Integrator Network Tel +1 949-567-7006 ________________________________________ BUSINESS IS DYNAMIC. TAKE CONTROL. ________________________________________ http://www.reef.com
Received on Monday, 30 July 2001 12:31:11 UTC