Send us a comment. The first CF-PSG parsing algorithms to systematically exploit the efficiency improvements to be gained by storage of intermediate results in WFSTs are those of Earley (1970) and Younger (1967), while the complexity issues are usefully explored in Sheil (1976). [*] [*] [*]
Contemporary chart parsing has its origins in the General Syntactic Processor of Kaplan (1973) and the MIND parser [*] of Kay (1973). [*] Kay himself provides a comprehensive technical discussion in his (1980/1986) paper. [*]
Tutorial introductions to the technique are provided by Thompson and Ritchie (1984, pp.245-63),
Winograd (1983, pp.116-27), and Allen (1987, pp.60-73). [*] [*]
Among many recent research papers on chart parsing are Thompson (1981, 1983), [*] [*] Kilbury (1985), [*] Ramsay (1985), [*] Slack (1986), [*] Wittenburg (1986), [*] Pareschi and Steedman (1987), [*] Sagvall Hein (1987), [*] Steel and De Roeck (1987), [*] and Wiren (1987). [*] Hirakawa (1983) and Matsumoto (1986) explicitly relate parallel logic programming techniques to chart parsing.
Chart parsers have also found uses in speech understanding (Görz 1981, 1982; Thompson 1985). [*] [*] [*]
Send us a comment.