Sciweavers

112 search results - page 9 / 23
» Functor-Driven Natural Language Generation with Categorial-U...
Sort
View
LATA
2010
Springer
14 years 2 months ago
Extending Stochastic Context-Free Grammars for an Application in Bioinformatics
We extend stochastic context-free grammars such that the probability of applying a production can depend on the length of the subword that is generated from the application and sho...
Frank Weinberg, Markus E. Nebel
FPL
2001
Springer
101views Hardware» more  FPL 2001»
14 years 1 days ago
An FPGA-Based Syntactic Parser for Real-Life Almost Unrestricted Context-Free Grammars
This paper presents an FPGA-based implementation of a syntactic parser that can process languages generated by almost unrestricted real-life context-free grammars (CFGs). More prec...
Cristian Ciressan, Eduardo Sanchez, Martin Rajman,...
EMNLP
2009
13 years 5 months ago
Refining Grammars for Parsing with Hierarchical Semantic Knowledge
This paper proposes a novel method to refine the grammars in parsing by utilizing semantic knowledge from HowNet. Based on the hierarchical state-split approach, which can refine ...
Xiaojun Lin, Yang Fan, Meng Zhang, Xihong Wu, Huis...
IWPT
2001
13 years 9 months ago
Automatic Grammar Partitioning for Syntactic Parsing
Natural language processing technologies offer ease-of-use of computers for average users, and easeof-access to on-line information. Natural language, however, is complex, and the...
Po-Chui Luk, Fuliang Weng, Helen Meng
EACL
1989
ACL Anthology
13 years 8 months ago
An Algorithm For Generation In Unification Categorial Grammar
We present an algorithm for the generation of sentences from the semantic representations of Unification Categorial Grammar. We discuss a variant of Shieber's semantic monoto...
Jonathan Calder, Mike Reape, Henk Zeevat