116 search results - page 7 / 24 » An Efficient Parsing Algorithm for Tree Adjoining Grammars |
COLING
2010
13 years 3 months ago
2010
Surface realisation with grammars integrating flat semantics is known to be NP complete. In this paper, we present a new algorithm for surface realisation based on Feature Based T...
ACL
1998
13 years 10 months ago
1998
Much of the power of probabilistic methods in modelling language comes from their ability to compare several derivations for the same string in the language. An important starting...
ACL
2010
13 years 6 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...
JDCTA
2010
13 years 3 months ago
2010
We implement a Korean syntactic analyzer which decreases many ambiguities in syntax parse trees using segmentation and semantic connection units. We use dependency grammar for par...
ICDT
2010
ACM
14 years 3 days ago
2010
ACM
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...