Article

Free access

Statistical parsing with an automatically-extracted tree adjoining grammar

Author:

David ChiangAuthors Info & Claims

ACL '00: Proceedings of the 38th Annual Meeting on Association for Computational Linguistics

Pages 456 - 463

https://doi.org/10.3115/1075218.1075276

Published: 03 October 2000 Publication History

Abstract

We discuss the advantages of lexicalized tree-adjoining grammar as an alternative to lexicalized PCFG for statistical parsing, describing the induction of a probabilistic LTAG model from the Penn Treebank and evaluating its parsing performance. We find that this induction method is an improvement over the EM-based method of (Hwa, 1998), and that the induced model yields results comparable to lexicalized PCFG.

References

[1]

B. Srinivas. 1997. Complexity of lexical descriptions: relevance to partial parsing. Ph.D. thesis, Univ. of Pennsylvania.

[2]

Daniel M. Bikel, Scott Miller, Richard Schwartz, and Ralph Weischedel. 1997. Nymble: a high-performance learning name-finder. In Proceedings of the Fifth Conference on Applied Natural Language Processing (ANLP 1997), pages 194--201.

Digital Library

[3]

John Carroll and David Weir. 1997. Encoding frequency information in lexicalized grammars. In Proceedings of the Fifth International Workshop on Parsing Technologies (IWPT '97), pages 8--17.

[4]

Eugene Charniak. 2000. A maximum-entropy-inspired parser. In Proceedings of the First Meeting of the North American Chapter of the Association for Computational Linguistics (ANLP-NAACL2000), pages 132--139.

Digital Library

[5]

Ciprian Chelba and Frederick Jelinek. 1998. Exploiting syntactic structure for language modeling. In Proceedings of COLING-ACL '98, pages 225--231.

Digital Library

[6]

John Chen and K. Vijay-Shanker. 2000. Automated extraction of TAGs from the Penn Treebank. In Proceedings of the Sixth International Workshop on Parsing Technologies (IWPT 2000), pages 65--76.

[7]

Michael Collins. 1996. A new statistical parser based on bigram lexical dependencies. In Proceedings of the 34th Annual Meeting of the Assocation for Computational Linguistics, pages 184--191.

Digital Library

[8]

Michael Collins. 1997. Three generative lexicalised models for statistical parsing. In Proceedings of the 35th Annual Meeting of the Assocation for Computational Linguistics, pages 16--23.

Digital Library

[9]

Michael Collins. 1999. Head-driven statistical models for natural language parsing. Ph.D. thesis, Univ. of Pennsylvania.

Digital Library

[10]

Joshua Goodman. 1997. Global thresholding and multiple-pass parsing. In Proceedings of the Second Conference on Empirical Methods in Natural Language Processing (EMNLP-2), pages 11--25.

[11]

Rebecca Hwa. 1998. An empirical evaluation of probabilistic lexicalized tree insertion grammars. In Proceedings of COLING-ACL '98, pages 557--563.

Digital Library

[12]

Mark Johnson. 1998. PCFG models of linguistic tree representations. Computational Linguistics, 24:613--632.

Digital Library

[13]

David M. Magerman. 1995. Statistical decision-tree models for parsing. In Proceedings of the 33rd Annual Meeting of the Assocation for Computational Linguistics, pages 276--283.

Digital Library

[14]

Günter Neumann. 1998. Automatic extraction of stochastic lexicalized tree grammars from treebanks. In Proceedings of the 4th International Workshop on TAG and Related Formalisms (TAG+4), pages 120--123.

[15]

Owen Rambow, K. Vijay-Shanker, and David Weir. 1995. D-tree grammars. In Proceedings of the 33rd Annual Meeting of the Assocation for Computational Linguistics, pages 151--158.

Digital Library

[16]

Adwait Ratnaparkhi. 1996. A maximum-entropy model for part-of-speech tagging. In Proceedings of the Conference on Empirical Methods in Natural Language Processing, pages 1--10.

[17]

Philip Resnik. 1992. Probabilistic tree-adjoining grammar as a framework for statistical natural language processing. In Proceedings of the Fourteenth International Conference on Computational Linguistics (COLING-92), pages 418--424.

Digital Library

[18]

Yves Schabes and Stuart M. Shieber. 1994. An alternative conception of tree-adjoining derivation. Computational Linguistics, 20(1):91--124.

Digital Library

[19]

Yves Schabes and Richard C. Waters. 1995. Tree insertion grammar: a cubic-time parsable formalism that lexicalizes context-free grammar without changing the trees produced. Computational Linguistics, 21:479--513.

Digital Library

[20]

Yves Schabes and Richard Waters. 1996. Stochastic lexicalized tree-insertion grammar. In H. Bunt and M. Tomita, editors, Recent Advances in Parsing Technology, pages 281--294. Kluwer Academic Press, London.

[21]

Yves Schabes. 1992. Stochastic lexicalized tree-adjoining grammars. In Proceedings of the Fourteenth International Conference on Computational Linguistics (COLING-92), pages 426--432.

Digital Library

[22]

Fei Xia. 1999. Extracting tree adjoining grammars from bracketed corpora. In Proceedings of the 5th Natural Language Processing Pacific Rim Symposium (NLPRS-99), pages 398--403.

Cited By

Zheng XPeng HChen YZhang PZhang W(2015)Character-based parsing with convolutional neural networkProceedings of the 24th International Conference on Artificial Intelligence10.5555/2832249.2832395(1054-1060)Online publication date: 25-Jul-2015
https://dl.acm.org/doi/10.5555/2832249.2832395
Yamangil EShieber SLi HLin COsborne M(2012)Estimating compact yet rich tree insertion grammarsProceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Short Papers - Volume 210.5555/2390665.2390693(110-114)Online publication date: 8-Jul-2012
https://dl.acm.org/doi/10.5555/2390665.2390693
Kummerfeld JKlein DCurran JLi HLin COsborne M(2012)Robust conversion of CCG derivations to phrase structure treesProceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Short Papers - Volume 210.5555/2390665.2390692(105-109)Online publication date: 8-Jul-2012
https://dl.acm.org/doi/10.5555/2390665.2390692
Show More Cited By

Statistical parsing with an automatically-extracted tree adjoining grammar
1. Computing methodologies
  1. Artificial intelligence
2. Hardware
  1. Power and energy
    1. Power estimation and optimization

Recommendations

An Earley-type parsing algorithm for Tree Adjoining Grammars
ACL '88: Proceedings of the 26th annual meeting on Association for Computational Linguistics

We will describe an Earley-type parser for Tree Adjoining Grammars (TAGs). Although a CKY-type parser for TAGs has been developed earlier (Vijay-Shanker and Joshi, 1985), this is the first practical parser for TAGs because as is well known for CFGs, the ...
Tree insertion grammar: a cubic-time, parsable formalism that lexicalizes context-free grammar without changing the trees produced

Tree insertion grammar (TIG) is a tree-based formalism that makes use of tree substitution and tree adjunction. TIG is related to tree adjoining grammar. However, the adjunction permitted in TIG is sufficiently restricted that TIGs only derive context-...
Parsing French with Tree Adjoining Grammar: some linguistic accounts
COLING '88: Proceedings of the 12th conference on Computational linguistics - Volume 1

We present the first sizable grammar written for TAG. We present the linguistic coverage of our grammar, and explain the linguistic reasons which lead us to choose the particular representations. We show that TAG formalism provides sufficient ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image DL Hosted proceedings

ACL '00: Proceedings of the 38th Annual Meeting on Association for Computational Linguistics

October 2000

598 pages

General Chair:
Hitoshi Iida

Publisher

Association for Computational Linguistics

United States

Publication History

Published: 03 October 2000

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 85 of 443 submissions, 19%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

45
Total Citations
View Citations
546
Total Downloads

Downloads (Last 12 months)35
Downloads (Last 6 weeks)6

Reflects downloads up to 13 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zheng XPeng HChen YZhang PZhang W(2015)Character-based parsing with convolutional neural networkProceedings of the 24th International Conference on Artificial Intelligence10.5555/2832249.2832395(1054-1060)Online publication date: 25-Jul-2015
https://dl.acm.org/doi/10.5555/2832249.2832395
Yamangil EShieber SLi HLin COsborne M(2012)Estimating compact yet rich tree insertion grammarsProceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Short Papers - Volume 210.5555/2390665.2390693(110-114)Online publication date: 8-Jul-2012
https://dl.acm.org/doi/10.5555/2390665.2390693
Kummerfeld JKlein DCurran JLi HLin COsborne M(2012)Robust conversion of CCG derivations to phrase structure treesProceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Short Papers - Volume 210.5555/2390665.2390692(105-109)Online publication date: 8-Jul-2012
https://dl.acm.org/doi/10.5555/2390665.2390692
Kulick SBies AMott JChu-Carroll J(2012)Using supertags and encoded annotation principles for improved dependency to phrase structure conversionProceedings of the 2012 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies10.5555/2382029.2382067(305-314)Online publication date: 3-Jun-2012
https://dl.acm.org/doi/10.5555/2382029.2382067
Kulick SBies AMott JLin D(2011)Using derivation trees for treebank error detectionProceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers - Volume 210.5555/2002736.2002870(693-698)Online publication date: 19-Jun-2011
https://dl.acm.org/doi/10.5555/2002736.2002870
Yu KMiyao YWang XMatsuzaki TTsujii JJoshi AHuang CJurafsky D(2010)Semi-automatically developing Chinese HPSG grammar from the Penn Chinese Treebank for deep parsingProceedings of the 23rd International Conference on Computational Linguistics: Posters10.5555/1944566.1944728(1417-1425)Online publication date: 23-Aug-2010
https://dl.acm.org/doi/10.5555/1944566.1944728
Chung TPost MGildea DSeddah DKübler STsarfaty R(2010)Factors affecting the accuracy of Korean parsingProceedings of the NAACL HLT 2010 First Workshop on Statistical Parsing of Morphologically-Rich Languages10.5555/1868771.1868777(49-57)Online publication date: 5-Jun-2010
https://dl.acm.org/doi/10.5555/1868771.1868777
Tsarfaty RSeddah DGoldberg YKübler SCandito MFoster JVersley YRehbein ITounsi LSeddah DKübler STsarfaty R(2010)Statistical parsing of morphologically rich languages (SPMRL)Proceedings of the NAACL HLT 2010 First Workshop on Statistical Parsing of Morphologically-Rich Languages10.5555/1868771.1868772(1-12)Online publication date: 5-Jun-2010
https://dl.acm.org/doi/10.5555/1868771.1868772
Shen LXu JWeischedel R(2010)String-to-dependency statistical machine translationComputational Linguistics10.1162/coli_a_0001536:4(649-671)Online publication date: 1-Dec-2010
https://dl.acm.org/doi/10.1162/coli_a_00015
Post MGildea DBunt H(2009)Weight pushing and binarization for fixed-grammar parsingProceedings of the 11th International Conference on Parsing Technologies10.5555/1697236.1697255(89-98)Online publication date: 7-Oct-2009
https://dl.acm.org/doi/10.5555/1697236.1697255
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents