Sciweavers

382 search results - page 16 / 77
» Generalized Multitext Grammars
Sort
View
IBPRIA
2003
Springer
14 years 17 days ago
Smoothing Techniques for Tree-k-Grammar-Based Natural Language Modeling
Abstract. In a previous work, a new probabilistic context-free grammar (PCFG) model for natural language parsing derived from a tree bank corpus has been introduced. The model esti...
Jose L. Verdú-Mas, Jorge Calera-Rubio, Rafa...
CORR
1998
Springer
145views Education» more  CORR 1998»
13 years 7 months ago
Anchoring a Lexicalized Tree-Adjoining Grammar for Discourse
We here explore a "fully" lexicalized Tree-Adjoining Grammar for discourse that takes the basic elements of a (monologic) discourse to be not simply clauses, but larger ...
Bonnie L. Webber, Aravind K. Joshi
NAACL
2010
13 years 5 months ago
Chart Mining-based Lexical Acquisition with Precision Grammars
In this paper, we present an innovative chart mining technique for improving parse coverage based on partial parse outputs from precision grammars. The general approach of mining ...
Yi Zhang 0003, Timothy Baldwin, Valia Kordoni, Dav...
ACL
2009
13 years 5 months ago
Asynchronous Binarization for Synchronous Grammars
Binarization of n-ary rules is critical for the efficiency of syntactic machine translation decoding. Because the target side of a rule will generally reorder the source side, it ...
John DeNero, Adam Pauls, Dan Klein
IJCNLP
2004
Springer
14 years 22 days ago
Iterative CKY Parsing for Probabilistic Context-Free Grammars
This paper presents an iterative CKY parsing algorithm for probabilistic contextfree grammars (PCFG). This algorithm enables us to prune unnecessary edges produced during parsing,...
Yoshimasa Tsuruoka, Jun-ichi Tsujii