Sciweavers

367 search results - page 30 / 74
» Lexicalized Context-Free Grammars
Sort
View
ACL
1996
13 years 9 months ago
Generating an LTAG out of a Principle-based Hierarchical Representation
Lexicalized Tree Adjoining Grammars have proved useful for NLP. However, numerous redundancy problems face LTAGs developers, as highlighted by Vijay-Shanker and Schabes (92). We p...
Marie-Hélène Candito
CLIN
2000
13 years 9 months ago
Alpino: Wide-coverage Computational Analysis of Dutch
Alpino is a wide-coverage computational analyzer of Dutch which aims at accurate, full, parsing of unrestricted text. We describe the head-driven lexicalized grammar and the lexic...
Gosse Bouma, Gertjan van Noord, Rob Malouf
ACL
1998
13 years 9 months ago
HPSG-Style Underspecified Japanese Grammar with Wide Coverage
This paper describes a wide-coverage Japanese grammar based on HPSG. The aim of this work is to see the coverage and accuracy attainable using an underspecified grammar. Underspec...
Yutaka Mitsuishi, Kentaro Torisawa, Jun-ichi Tsuji...
IJBRA
2006
111views more  IJBRA 2006»
13 years 8 months ago
Memory efficient alignment between RNA sequences and stochastic grammar models of pseudoknots
: Stochastic Context-Free Grammars (SCFG) has been shown to be effective in modelling RNA secondary structure for searches. Our previous work (Cai et al., 2003) in Stochastic Paral...
Yinglei Song, Chunmei Liu, Russell L. Malmberg, Co...
EMNLP
2008
13 years 10 months ago
Generalizing Local and Non-Local Word-Reordering Patterns for Syntax-Based Machine Translation
Syntactic word reordering is essential for translations across different grammar structures between syntactically distant languagepairs. In this paper, we propose to embed local a...
Bing Zhao, Yaser Al-Onaizan