Article

Free access

Guided parsing of range concatenation languages

Authors:

François Barthélemy,

Pierre Boullier,

Philippe Deschamp,

Éric de la ClergerieAuthors Info & Claims

ACL '01: Proceedings of the 39th Annual Meeting on Association for Computational Linguistics

Pages 42 - 49

https://doi.org/10.3115/1073012.1073019

Published: 06 July 2001 Publication History

PDF eReader

Abstract

The theoretical study of the range concatenation grammar [RCG] formalism has revealed many attractive properties which may be used in NLP. In particular, range concatenation languages [RCL] can be parsed in polynomial time and many classical grammatical formalisms can be translated into equivalent RCGs without increasing their worst-case parsing time complexity. For example, after translation into an equivalent RCG, any tree adjoining grammar can be parsed in O(n⁶) time. In this paper, we study a parsing technique whose purpose is to improve the practical efficiency of RCL parsers. The non-deterministic parsing choices of the main parser for a language L are directed by a guide which uses the shared derivation forest output by a prior RCL parser for a suitable superset of L. The results of a practical evaluation of this method on a wide coverage English grammar are given.

References

[1]

F. Barthélemy, P. Boullier, Ph. Deschamp, and É de la Clergerie. 2000. Shared forests can guide parsing. In Proceedings of the Second Workshop on Tabulation in Parsing and Deduction (TAPD'2000), University of Vigo, Spain, September.

Google Scholar

[2]

P. Boullier. 1998. A generalization of mildly context sensitive formalisms. In Proceedings of the Fourth International Workshop on Tree Adjoining Grammars and Related Frameworks (TAG+4), pages 17--20, University of Pennsylvania, Philadelphia, PA, August.

Google Scholar

[3]

P. Boullier. 1999. On tag parsing. In 6èmeconférence annuelle sur le Traitement Automatique des Langues Naturelles (TALN'99), pages 75--84, Cargèse, Corse, France, July. See also Research Report No. 3668 at http://www.inria.fr/RRRT/RR-3668.html, INRIA-Rocquencourt, France, Apr. 1999, 39 pages.

Google Scholar

[4]

P. Boullier. 2000a. A cubic time extension of context-free grammars. Grammars, 3(2/3):111--131.

Crossref

Google Scholar

[5]

P. Boullier. 2000b. Range concatenation grammars. In Proceedings of the Sixth International Workshop on Parsing Technologies (IWPT 2000), pages 53--64, Trento, Italy, February.

Google Scholar

[6]

John Carroll. 1994. Relating complexity to practical performance in parsing with wide-coverage unification grammars. In Proceedings of the 32th Annual Meeting of the Association for Computational Linguistics (ACL'94), pages 287--294, New Mexico, State University at Las Cruces, New Mexico, June.

Digital Library

Google Scholar

[7]

A. K. Joshi. 1987. An introduction to tree adjoining grammars. In A. Manaster-Ramer, editor, Mathematics of Language, pages 87--114. John Benjamins, Amsterdam.

Crossref

Google Scholar

[8]

M. Kay. 2000. Guides and oracles for linear-time parsing. In Proceedings of the Sixth International Workshop on Parsing Technologies (IWPT 2000), pages 6--9, Trento, Italy, February.

Google Scholar

[9]

V. S. Lakshmanan and C. H. Yim. 1991. Can filters do magic for deductive databases? In 3rd UK Annual Conference on Logic Programming, pages 174--189, Edinburgh, April. Springer Verlag.

Google Scholar

[10]

M.-J. Nederhof. 1998. Context-free parsing through regular approximation. In Proceedings of the International Workshop on Finite State Methods in Natural Language Processing, Ankara, Turkey, June--July.

Digital Library

Google Scholar

[11]

M.-J. Nederhof. 2000. Practical experiments with regular approximation of context-free languages. Computational Linguistics, 26(1):17--44.

Digital Library

Google Scholar

[12]

A. Sarkar. 2000. Practical experiments in parsing using tree adjoining grammars. In Proceedings of the Fifth International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+5), pages 193--198, University of Paris 7, Jussieu, Paris, France, May.

Google Scholar

[13]

the research group XTAG. 1995. A lexicalized tree adjoining grammar for English. Technical Report IRCS 95-03, Institute for Research in Cognitive Science, University of Pennsylvania, Philadelphia, PA, USA, March.

Google Scholar

Cited By

View all

Dohmann JDeeds KChang MLo DGamess E(2020)A Fast Filtering Algorithm for Massive Context-free GrammarsProceedings of the 2020 ACM Southeast Conference10.1145/3374135.3385266(62-70)Online publication date: 2-Apr-2020
https://dl.acm.org/doi/10.1145/3374135.3385266
van Cranenburgh ADaelemans W(2012)Efficient parsing with linear context-free rewriting systemsProceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics10.5555/2380816.2380873(460-470)Online publication date: 23-Apr-2012
https://dl.acm.org/doi/10.5555/2380816.2380873
van Cranenburgh AScha RSangati FSeddah DTsarfaty RFoster J(2011)Discontinuous data-oriented parsingProceedings of the Second Workshop on Statistical Parsing of Morphologically Rich Languages10.5555/2206359.2206364(34-44)Online publication date: 6-Oct-2011
https://dl.acm.org/doi/10.5555/2206359.2206364
Show More Cited By

Guided parsing of range concatenation languages
1. Hardware
  1. Power and energy
    1. Power estimation and optimization
2. Theory of computation
  1. Formal languages and automata theory

Recommendations

Parsing minimalist languages
Parsing directed acyclic graphs with range concatenation grammars
IWPT '09: Proceedings of the 11th International Conference on Parsing Technologies

Range Concatenation Grammars (RCGs) are a syntactic formalism which possesses many attractive properties. It is more powerful than Linear Context-Free Rewriting Systems, though this power is not reached to the detriment of efficiency since its sentences ...
Counting with range concatenation grammars
Algebraic methods in language processing

The class of range concatenation grammars appears to be a convincing challenger as a syntactic base for various tasks, especially in natural language processing. These grammars are powerful, since they strictly contain the class of mildly context-...

Comments

Information & Contributors

Information

Published In

ACL '01: Proceedings of the 39th Annual Meeting on Association for Computational Linguistics

July 2001

562 pages

General Chair:
Bonnie Lynn Webber

Publisher

Association for Computational Linguistics

United States

Publication History

Published: 06 July 2001

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 85 of 443 submissions, 19%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
272
Total Downloads

Downloads (Last 12 months)55
Downloads (Last 6 weeks)5

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Dohmann JDeeds KChang MLo DGamess E(2020)A Fast Filtering Algorithm for Massive Context-free GrammarsProceedings of the 2020 ACM Southeast Conference10.1145/3374135.3385266(62-70)Online publication date: 2-Apr-2020
https://dl.acm.org/doi/10.1145/3374135.3385266
van Cranenburgh ADaelemans W(2012)Efficient parsing with linear context-free rewriting systemsProceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics10.5555/2380816.2380873(460-470)Online publication date: 23-Apr-2012
https://dl.acm.org/doi/10.5555/2380816.2380873
van Cranenburgh AScha RSangati FSeddah DTsarfaty RFoster J(2011)Discontinuous data-oriented parsingProceedings of the Second Workshop on Statistical Parsing of Morphologically Rich Languages10.5555/2206359.2206364(34-44)Online publication date: 6-Oct-2011
https://dl.acm.org/doi/10.5555/2206359.2206364
Boullier PSagot B(2009)Multi-component tree insertion grammarsProceedings of the 14th international conference on Formal grammar10.5555/1987004.1987008(31-46)Online publication date: 25-Jul-2009
https://dl.acm.org/doi/10.5555/1987004.1987008
Boullier PSagot BBunt H(2009)Parsing directed acyclic graphs with range concatenation grammarsProceedings of the 11th International Conference on Parsing Technologies10.5555/1697236.1697287(254-265)Online publication date: 7-Oct-2009
https://dl.acm.org/doi/10.5555/1697236.1697287
Kallmeyer LMaier WParmentier Y(2009)An Earley parsing algorithm for range concatenation grammarsProceedings of the ACL-IJCNLP 2009 Conference Short Papers10.5555/1667583.1667587(9-12)Online publication date: 4-Aug-2009
https://dl.acm.org/doi/10.5555/1667583.1667587
Sagot B(2005)Linguistic facts as predicates over ranges of the sentenceProceedings of the 5th international conference on Logical Aspects of Computational Linguistics10.1007/11422532_18(271-286)Online publication date: 28-Apr-2005
https://dl.acm.org/doi/10.1007/11422532_18
Barthélemy FBoullier PDeschamp PKaouane LKhajour AVillemonte de la Clergerie ÉDeClerck TKrauwer SRosner M(2001)Tools and resources for Tree Adjoining GrammarsProceedings of the ACL 2001 Workshop on Sharing Tools and Resources - Volume 1510.3115/1118062.1118074(63-70)Online publication date: 7-Jul-2001
https://dl.acm.org/doi/10.3115/1118062.1118074

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

Abstract

References

Cited By

Recommendations

Parsing minimalist languages

Parsing directed acyclic graphs with range concatenation grammars

Counting with range concatenation grammars

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations