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...
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,...
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...
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...
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...