Sciweavers

77 search results - page 16 / 16
» Presenting a Category Modulo a Rewriting System
Sort
View
ICDT
2010
ACM
147views Database» more  ICDT 2010»
15 years 27 days ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld
PASTE
2010
ACM
14 years 11 months ago
Packrat parsers can handle practical grammars in mostly constant space
Packrat parsing is a powerful parsing algorithm presented by Ford in 2002. Packrat parsers can handle complicated grammars and recursive structures in lexical elements more easily...
Kota Mizushima, Atusi Maeda, Yoshinori Yamaguchi