公开(公告)号：US06282512B1

公开(公告)日：2001-08-28

申请号：US09235123

申请日：1999-01-21

申请人： Charles T. Hemphill

发明人： Charles T. Hemphill

IPC分类号： G10L1522

CPC分类号： G10L15/26

摘要： Enhancement of hypertext pages containing graphical images is provided by extracting 102 the ALT tag from the markup language to support selection of the corresponding hypertext link by uttering the ALT tag phrase. We describe how to add a speakable phrase for images without ALT tags. The approach also applies to client image maps that can include ALT tags for individual areas. The steps include parsing to extract possible BASE tags reference and client map (MAP tag) 102, retaining any BASE tag for relative references or, if missing, creating one using the original page reference (103) and for each anchor (A tag) containing a page reference (HREF) but without link text, and using the ALT tag text as the link text (104). In the case of a missing ALT tag, creating unique link text.

摘要翻译： 通过从标记语言提取102个ALT标签来提供包含图形图像的超文本页面的增强，以支持通过发出ALT标签短语来选择相应的超文本链接。 我们描述如何为没有ALT标签的图像添加有声的短语。 该方法也适用于可以包括各个区域的ALT标签的客户端图像映射。 这些步骤包括解析以提取可能的BASE标签引用和客户端映射（MAP标签）102，保留用于相对引用的任何BASE标签，或者如果缺少使用原始页面引用（103）和每个锚（A标签）创建一个 页面引用（HREF）但不包含链接文本，并使用ALT标签文本作为链接文本（104）。 在缺少ALT标记的情况下，创建唯一的链接文本。

公开(公告)号：US4984178A

公开(公告)日：1991-01-08

申请号：US312835

申请日：1989-02-21

申请人： Charles T. Hemphill ,  Joseph W. Picone

发明人： Charles T. Hemphill ,  Joseph W. Picone

IPC分类号： G10L11/00 ,  G06F17/22 ,  G10L15/06 ,  G10L15/10 ,  G10L15/18 ,  G10L15/28

CPC分类号： G10L15/193 ,  G10L15/197

摘要： A chart parser is disclosed which incorporates rule and observation probabilities with stochastic unification grammars. The parser operates frame synchronously to provide top-down hypotheses and to incorporate observation probabilities as they become available. Because the language model produces multiple explanations of the speech data between frames, the prediction and combination of rules may create cycles in a graph representing the best scores. Score calculation includes the detection of these cycles and propagation of the best scores to the next frame. The algorithm creates no more states than a nonprobilistic chart parser, and remains linear for regular grammars and cubic in the worst case for CFGs. The parser allows a direct integration of statistical speech information and linguistic constraints within the same language model, while the language model permits a generalization of HMM-type models. The efficiency of the parser makes it applicable to multiple levels of a spoken language system (e.g., sentence, word, phoneme, and phone levels).