Sciweavers

367 search results - page 57 / 74
» Lexicalized Context-Free Grammars
Sort
View
COLING
1994
13 years 9 months ago
Bottom-Up Earley Deduction
We propose a bottom-up variant of Earley deduction. Bottom-up deduction is preferable to top-down deduction because it allows incrementai processing (even for head-driven grammars...
Gregor Erbach
COLING
2008
13 years 10 months ago
Weakly Supervised Supertagging with Grammar-Informed Initialization
Much previous work has investigated weak supervision with HMMs and tag dictionaries for part-of-speech tagging, but there have been no similar investigations for the harder proble...
Jason Baldridge
PASTE
2010
ACM
13 years 10 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
GREC
2007
Springer
14 years 10 days ago
Developing Domain-Specific Gesture Recognizers for Smart Diagram Environments
Computer understanding of visual languages in pen-based environments requires a combination of lexical analysis in which the basic tokens are recognized from hand-drawn gestures an...
Adrian C. Bickerstaffe, Aidan Lane, Bernd Meyer, K...
LREC
2008
140views Education» more  LREC 2008»
13 years 10 months ago
New Functions of FrameSQL for Multilingual FrameNets
The Berkeley FrameNet Project (BFN) is making an English lexical database called FrameNet, which describes syntactic and semantic properties of an English lexicon extracted from l...
Hiroaki Sato