Sciweavers

57 search results - page 6 / 12
» Generalized Lr Parsing Algorithm for Boolean Grammars
Sort
View
ACL
2012
12 years 12 months ago
Estimating Compact Yet Rich Tree Insertion Grammars
We present a Bayesian nonparametric model for estimating tree insertion grammars (TIG), building upon recent work in Bayesian inference of tree substitution grammars (TSG) via Dir...
Elif Yamangil, Stuart M. Shieber
EACL
1993
ACL Anthology
14 years 10 months ago
The Use of Shared Forests in Tree Adjoining Grammar Parsing
We study parsing of tree adjoining grammars with particular emphasis on the use of shared forests to represent all the parse trees deriving a well-formed string. We show that ther...
K. Vijay-Shanker
MFCS
2004
Springer
15 years 2 months ago
The Dual of Concatenation
A binary language-theoretic operation is proposed, which is dual to the concatenation of languages in the same sense as the universal quantifier in logic is dual to the existenti...
Alexander Okhotin
IJCNLP
2004
Springer
15 years 2 months 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
PEPM
1993
ACM
15 years 1 months ago
Partial Evaluation of General Parsers
Applications of partial evaluation have so far mainly focused on generation of compilers from interpreters for programming languages. We partially evaluate a simple general LR(k) ...
Christian Mossin