116 search results - page 4 / 24 » An Efficient Parsing Algorithm for Tree Adjoining Grammars |
ACL
2007
13 years 9 months ago
2007
Surface realisers divide into those used in generation (NLG geared realisers) and those mirroring the parsing process (Reversible realisers). While the first rely on grammars not...
ACL
2000
13 years 9 months ago
2000
We discuss the advantages of lexicalized tree-adjoining grammar as an alternative to lexicalized PCFG for statistical parsing, describingthe induction of a probabilistic LTAG mode...
COLING
2010
13 years 7 months ago
2010
ACL
1990
13 years 8 months ago
1990
This paper presents an implemented, psychologicallyplausible parsing model for Government Binding theory grammars. I make use of two main ideas: (1) a generalization of the licens...
NLP
2000
13 years 11 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...