116 search results - page 16 / 24 » An Efficient Parsing Algorithm for Tree Adjoining Grammars |
LATA
2010
Springer
14 years 2 months ago
2010
Springer
We extend stochastic context-free grammars such that the probability of applying a production can depend on the length of the subword that is generated from the application and sho...
ACL
2010
2010
Bayesian Synchronous Tree-Substitution Grammar Induction and Its Application to Sentence Compression
13 years 5 months ago
We describe our experiments with training algorithms for tree-to-tree synchronous tree-substitution grammar (STSG) for monolingual translation tasks such as sentence compression a...
NAACL
2010
13 years 5 months ago
2010
The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively f...
NAACL
2010
13 years 5 months ago
2010
We present a novel deterministic dependency parsing algorithm that attempts to create the easiest arcs in the dependency structure first in a non-directional manner. Traditional d...
ICTAI
2003
IEEE
14 years 25 days ago
2003
IEEE
Many natural language processing approaches at various complexity levels have been reported for extracting biochemical interactions from MEDLINE. While some algorithms using simpl...