parsing lexicalized treeadjoining grammars

... work. 269 7 Relevance to other lexicalized grammars Some aspects of our approach can be extended to other lexicalized grammars, in particular to catego- rial grammars (e.g. Combinatory Categorial ... relevance of our approach to other lexicalized grammars. In Section 8 we conclude with some directions for future work. 2 Lexicalized Tree-Adjoining Grammar Lexicalized Tree-Adjoining Grammar ... Schabes, Anne Abeill~, aJad Aravind K. Joshi. 1988. parsing strategies with &apos ;lexicalized& apos; grammars: Application to "l~ee Adjoining Grammars. In Pro- ceedings of the 12 *4 International...

Ngày tải lên: 20/02/2014, 22:20

... preprocessing. 5: Further Comparisons and Conclusion The LR parsing algorithm for grammars with atomic categories involves no category matching during parsing. In Fig.l, catego~;ies are pushed onto the ... 61801, USA tsuneko@grice.cogsci.uiuc.edu ABSTRACT This paper proposes an LR parsing algorithm modified for grammars with feature-based categories. The proposed algorithm does not instantiate ... eliminates the necessity of search for GOTO table entries during parsing. 1 Introduction The LR method is known to be a very efficient parsing algorithm that involves no searching or backtracking....

Ngày tải lên: 22/02/2014, 10:20

... head-corner parsing is especially useful for parsing with non-concatenative grammar formalisms. In [Lavelli and Satta, 1991] a head-driven parsing strategy for Lexicalized Tree Adjoining Grammars ... standard parsing algorithms to such grammars is unsatisfactory for a number of rea- sons. Earley parsing is intractable in general, as the rule set. is simply too general. For some grammars, ... Head driven parsing. In Proceedings of Workshop on Parsing Technologies, Pittsburg, 1989. [Laveili and Satta, 1991] Alberto Lavelli and Gior- gio Satta. Bidirectional parsing of lexicalized...

Ngày tải lên: 09/03/2014, 01:20

Ngày tải lên: 17/03/2014, 07:20

Ngày tải lên: 17/03/2014, 22:20

... of Lexicalization to Parsing. In Proceedings of the 1st International Workshop on Parsing Technologies. Pittsburgh, PA. To also appear under the title: Parsing with Lexicalized Tree Adjoining ... this paper a bidirectional parser for Lexicalized Tree Adjoining Grammars will be presented. The algorithm takes advantage of a peculiar characteristic of Lexicalized TAGs, i.e. that each elementary ... Bidirectional Parsing: A Tabular Method. In Proceedings of the 1st International Workshop on Parsing Technologies. Pittsburgh, PA. Schabes, Yves, 1990. Mathematical and Computational Aspects of Lexicalized...

Ngày tải lên: 22/02/2014, 10:20

Ngày tải lên: 17/03/2014, 07:20

... heuristics. 3 Symbol-Refined Tree Substitution Grammars In this section, we propose Symbol-Refined Tree Substitution Grammars (SR-TSGs) for syntactic parsing. Our SR-TSG model is an extension of the ... Accurate Parsing with an All-Fragments Grammar. In In Proc. of ACL, pages 1098–1107. Phil Blunsom and Trevor Cohn. 2010. Unsupervised Induction of Tree Substitution Grammars for Depen- dency Parsing. ... Christopher D Manning. 2003. Accurate Unlexicalized Parsing. In Proc. of ACL, 1:423–430. K Lari and S J Young. 1991. Applications of Stochas- tic Context-Free Grammars Using the Inside–Outside Algorithm....

Ngày tải lên: 19/02/2014, 19:20

Ngày tải lên: 20/02/2014, 18:20

... Eisner. 1997. Bilexical grammars and a cubic- time probabilistic parser. In IWPT97, pages 54-65. R. Evans and D. Weir. 1997. Automaton-based parsing for lexicalized grammars. In IWPT97, pages ... circuits. J. Franklin Institute. A. K. Joshi and Y. Schabes. 1991. Tree-adjoining grammars and lexicalized grammars. In Maurice Ni- vat and Andreas Podelski, editors, Definability and Recognizability ... 1988. An Earley-type parsing algorithm for tree adjoining grammars. In ACL88. K. Vijay-Shanker and A. K. Joshi. 1985. Some com- putational properties of tree adjoining grammars. In ACL85,...

Ngày tải lên: 20/02/2014, 18:20

... 1988. Parsing strategies with &apos ;lexicalized& apos; grammars: Applica- tion to Tree Adjoining Grammars. In Proceedings of COLING-88, Budapest, August. Yves Schabes. 1992. Stochastic lexicalized ... can also be exploited in parsing formalisms other than rewriting systems. The authors have developed an O(nT)-time parsing algorithm for bilexicalized tree adjoining grammars (Schabes, 1992), ... all: • For bilexicalized context-free grammars, O(n 4) is possible. • The O(n 4) result also holds for head au- tomaton grammars. • For a very common special case of these grammars where...

Ngày tải lên: 20/02/2014, 19:20

... Between D-Tree Grammars and Type-Logical Grammars. ' Proc. Fourth Workshop on Tree- Adjoining Grammars and Related Frame- works. KSnig, E. 1990, 'The complexity of parsing with extended ... [heppleOdcs .shef .ac.uk] Abstract We present a new chart parsing method for Lambek grammars, inspired by a method for D- Tree grammar parsing. The formulae of a Lam- bek sequent are firstly ... purposes much better than previous chart methods for Lambek grammars. 1 Introduction We present a new chart parsing method for Lambek grammars. The starting point for this work is the observation,...

Ngày tải lên: 20/02/2014, 19:20

... probability of rewriting the non- terminal AT/. 32 Towards History-based Grammars: Using Richer Models for Probabilistic Parsing* Ezra Black Fred Jelinek John Lafferty David M. Magerman Robert ... the sentence and the discourse are relevant to the model. Most previous probabilistic models of parsing assume the probabilities of sentences in a discourse are independent of other sentences. ... ing models, which we call P-CFG, the HBG model significantly outperforms P-CFG, increasing the parsing accuracy rate from 60% to 75%, a 37% reduction in error. Introduction Almost any natural...

Ngày tải lên: 20/02/2014, 21:20

... performance of different parsing algorithms using wide-coverage unification-based grammars. Previous comparisons have either fo- cussed on context-free (CF) or augmented CF parsing (Tomita, 1987; ... ac- curate to predict how the properties of individual unification-based grammars will interact with par- ticular parsing algorithms to determine practical performance. REFERENCES Aho, A., ... ambiguous parsing. " In Pro- ceedings of the 27th Meeting of the Association for Computational Linguistics. 143-151. Bouma, G. & G. van Noord (1993) "Head-driven parsing for...

Ngày tải lên: 20/02/2014, 21:20

... deter- ministic shift-reduce parsing for unifica- tion-based grammars, and (ii) best-first shift-reduce parsing with beam threshold- ing for unification-based grammars. De- terministic parsing cannot simply ... only as “strict” otherwise. 4 Shift-reduce parsing for unification- based grammars Non-deterministic shift-reduce parsing for unifi- cation-based grammars has been studied by Bris- coe and Carroll ... shift-reduce parsing algorithm, and then we explain the shift-reduce parsing with back- tracking and beam search. 4.1 Deterministic shift-reduce parsing for unification-based grammars The...

Ngày tải lên: 22/02/2014, 02:20

... Guided parsing of Range Concatenation Languages. In Pro- ceedings of ACL, pages 42–49. Tilman Becker, Aravind K. Joshi, and Owen Rambow. 1991. Long-distance scrambling and tree adjoining grammars. ... some extensions of RCG parsing. In Proceed- ings of IWPT 2001, pages 66–77, Beijing, China. Pierre Boullier. 1999. Chinese numbers, mix, scram- bling, and range concatenation grammars. In Pro- ceedings ... Norway. Pierre Boullier. 2000. Range concatenation grammars. In Proceedings of IWPT 2000, pages 53–64, Trento. H ˚ akan Burden and Peter Ljungl ¨ of. 2005. Parsing lin- ear context-free rewriting systems....

Ngày tải lên: 08/03/2014, 01:20

... perspective, because lexicalized grammars can be parsed significantly more efficiently than non -lexicalized ones (Schabes and Joshi, 1990). Formally, a grammar is said &apos ;lexicalized& apos; ... Adjoining Grammars. In Proceedings of the Ist International Workshop on Tree Adjoining Grammars, Dagstuhl C, astle, FRG, August. Schabes, Yves, Anne Abeill6, and Aravind K. Joshi. 1988. Parsing ... A lexicalized grammar can be organized as a lexicon where each lexical item is associated with a finite number of structures for which that item is the anchor. In general, CFGs are not lexicalized...

Ngày tải lên: 08/03/2014, 07:20

... with categorial grammars. In 25 ~h meeting Assoc. Comput. Ling., 1987. M. Steedman. Combinators and grammars. In 1~. Oehrle, E. Bach, and D. Wheeler, editors, Cat- egorial Grammars and Natural ... Struc- tures. Foris, Dordrecht, 1986. M. Steedman. Parsing spoken language using combinatory grammars. : In International Work- shop of Parsing Technologies, Pittsburgh, PA, 1989. M. J. ... natural language parsing. In 26 th meeting Assoc. Corn- put. Ling., 1988. K. Vijay-Shanker and D. J. Weir. The recognition of Combinatory Categorial Grammars, Linear In- dexed Grammars, and...

Ngày tải lên: 08/03/2014, 18:20

Ngày tải lên: 16/03/2014, 19:20

Ngày tải lên: 17/03/2014, 02:20