27 search results - page 3 / 6 » Analyzing Ambiguity of Context-Free Grammars |
75
Voted
ACL
2010
14 years 7 months ago
2010
Learning a tree substitution grammar is very challenging due to derivational ambiguity. Our recent approach used a Bayesian non-parametric model to induce good derivations from tr...
COLING
1996
14 years 10 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
COLING
2008
14 years 11 months ago
2008
We generalize Uno and Yagiura's algorithm for finding all common intervals of two permutations to the setting of two sequences with many-to-many alignment links across the tw...
VL
1999
IEEE
15 years 1 months ago
1999
IEEE
To take advantage of the ever-increasing volume of diagrams in electronic form, it is crucial that we have methods for parsing diagrams. Once a structured, content-based descripti...
IJCNLP
2004
Springer
15 years 2 months ago
2004
Springer
Preparation of knowledge bank is a very difficult task. In this paper, we discuss the knowledge extraction from the manually examined Sinica Treebank. Categorical information, wor...