Article

Free access

Multitext Grammars and synchronous parsers

Author:

NAACL '03: Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1

Pages 79 - 86

https://doi.org/10.3115/1073445.1073466

Published: 27 May 2003 Publication History

PDF eReader

Abstract

Multitext Grammars (MTGs) generate arbitrarily many parallel texts via production rules of arbitrary length. Both ordinary MTGs and their bilexical subclass admit relatively efficient parsers. Yet, MTGs are more expressive than other synchronous formalisms for which parsers have been described in the literature. The combination of greater expressive power and relatively low cost of inference makes MTGs an attractive foundation for practical models of translational equivalence.

References

[1]

A. Abeillé, Y. Schabes, and A. Joshi (1990) "Using Lexicalized Tree Adjoining Grammars for Machine Translation," Proceedings of COLING.

Digital Library

Google Scholar

[2]

A. Aho and J. Ullman (1969) "Syntax Directed Translations and the Pushdown Assembler," Journal of Computer and System Sciences 3, 37--56.

Digital Library

Google Scholar

[3]

H. Alshawi, S. Bangalore, and S. Douglas (2000) "Learning Dependency Translation Models as Collections of Finite State Head Transducers," Computational Linguistics 26(1): 45--60.

Digital Library

Google Scholar

[4]

B. Dorr (1994) "Machine Translation Divergences: A Formal Description and Proposed Solution," Computational Linguistics, 20:4, 597--633.

Digital Library

Google Scholar

[5]

J. Eisner and G. Satta (1999) "Efficient Parsing for Bilexical Context-Free Grammars and Head-Automaton Grammars," Proceedings of the ACL.

Digital Library

Google Scholar

[6]

M. Johnson (1985) "Parsing with Discontinuous Constituents," Proceedings of the ACL.

Digital Library

Google Scholar

[7]

D. McAllester (2002) "On The Complexity Analysis of Static Analyses" Journal of the ACM 49(4).

Digital Library

Google Scholar

[8]

O. Rambow and G. Satta (1999) "Independent Parallelism in Finite Copying Parallel Rewriting Systems," Theoretical Computer Science 223: 87--120.

Digital Library

Google Scholar

[9]

H. Seki, T. Matsumura, M. Fujii, and T. Kasami (1991) "On Multiple Context-Free Grammars," Theoretical Computer Science 88: 191--229.

Digital Library

Google Scholar

[10]

S. Shieber and Y. Schabes (1990) "Synchronous Tree-Adjoining Grammars," Proceedings of COLING.

Digital Library

Google Scholar

[11]

S. Shieber, Y. Schabes, and F. Pereira (1995) "Principles and Implementation of Deductive Parsing," Journal of Logic Programming 24: 3--36.

Crossref

Google Scholar

[12]

D. Wu (1997) "Stochastic inversion transduction grammars and bilingual parsing of parallel corpora," Computational Linguistics 23(3): 377--404.

Digital Library

Google Scholar

Cited By

View all

Iwata TMochihashi DSawada H(2010)Learning common grammar from multilingual corpusProceedings of the ACL 2010 Conference Short Papers10.5555/1858842.1858876(184-188)Online publication date: 11-Jul-2010
https://dl.acm.org/doi/10.5555/1858842.1858876
Yoshinaka RClark A(2010)Polynomial time learning of some multiple context-free languages with a minimally adequate teacherProceedings of the 15th and 16th international conference on Formal Grammar10.1007/978-3-642-32024-8_13(192-207)Online publication date: 1-Aug-2010
https://dl.acm.org/doi/10.1007/978-3-642-32024-8_13
Gómez-Rodríguez CSatta GSu K(2009)An optimal-time binarization algorithm for linear context-free rewriting systems with fan-out twoProceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - Volume 210.5555/1690219.1690284(985-993)Online publication date: 2-Aug-2009
https://dl.acm.org/doi/10.5555/1690219.1690284
Show More Cited By

Recommendations

Generating parsers for affix grammars

Affix grammars are two-level grammars which are similar to van Wijngaarden's two-level grammars used in the definition of Algol 68. Affix grammars are shown by Koster to be equal in power to van Wijngaarden grammars. They are much more suited to parsing ...
Generalized multitext grammars
ACL '04: Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics

Generalized Multitext Grammar (GMTG) is a synchronous grammar formalism that is weakly equivalent to Linear Context-Free Rewriting Systems (LCFRS), but retains much of the notational and intuitive simplicity of Context-Free Grammar (CFG). GMTG allows ...
Regular right part grammars and their parsers

This paper introduces an alternative to context-free grammars called regular right part (RRP) grammars, which resemble PASCAL syntax diagrams. Formally, RRP grammars have production right parts, which are nondeterministic finite state machines (FSMs), ...

Comments

Information & Contributors

Information

Published In

NAACL '03: Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1

May 2003

293 pages

Program Chairs:
Marti Hearst,
Mari Ostendorf

Publisher

Association for Computational Linguistics

United States

Publication History

Published: 27 May 2003

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 21 of 29 submissions, 72%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

24
Total Citations
View Citations
388
Total Downloads

Downloads (Last 12 months)76
Downloads (Last 6 weeks)14

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Iwata TMochihashi DSawada H(2010)Learning common grammar from multilingual corpusProceedings of the ACL 2010 Conference Short Papers10.5555/1858842.1858876(184-188)Online publication date: 11-Jul-2010
https://dl.acm.org/doi/10.5555/1858842.1858876
Yoshinaka RClark A(2010)Polynomial time learning of some multiple context-free languages with a minimally adequate teacherProceedings of the 15th and 16th international conference on Formal Grammar10.1007/978-3-642-32024-8_13(192-207)Online publication date: 1-Aug-2010
https://dl.acm.org/doi/10.1007/978-3-642-32024-8_13
Gómez-Rodríguez CSatta GSu K(2009)An optimal-time binarization algorithm for linear context-free rewriting systems with fan-out twoProceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - Volume 210.5555/1690219.1690284(985-993)Online publication date: 2-Aug-2009
https://dl.acm.org/doi/10.5555/1690219.1690284
Snyder BNaseem TBarzilay RSu K(2009)Unsupervised multilingual grammar inductionProceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 1 - Volume 110.5555/1687878.1687890(73-81)Online publication date: 2-Aug-2009
https://dl.acm.org/doi/10.5555/1687878.1687890
Steinby MTîrnuc C(2009)Defining syntax-directed translations by tree bimorphismsTheoretical Computer Science10.1016/j.tcs.2009.03.009410:37(3495-3503)Online publication date: 1-Sep-2009
https://dl.acm.org/doi/10.1016/j.tcs.2009.03.009
Galley MManning CLapata MNg H(2008)A simple and effective hierarchical phrase reordering modelProceedings of the Conference on Empirical Methods in Natural Language Processing10.5555/1613715.1613824(848-856)Online publication date: 25-Oct-2008
https://dl.acm.org/doi/10.5555/1613715.1613824
Lopez A(2008)Statistical machine translationACM Computing Surveys10.1145/1380584.138058640:3(1-49)Online publication date: 13-Aug-2008
https://dl.acm.org/doi/10.1145/1380584.1380586
Huang L(2007)Binarization, synchronous binarization, and target-side binarizationProceedings of the NAACL-HLT 2007/AMTA Workshop on Syntax and Structure in Statistical Translation10.5555/1626281.1626286(33-40)Online publication date: 26-Apr-2007
https://dl.acm.org/doi/10.5555/1626281.1626286
Cherry CLin D(2007)Inversion transduction grammar for joint phrasal translation modelingProceedings of the NAACL-HLT 2007/AMTA Workshop on Syntax and Structure in Statistical Translation10.5555/1626281.1626284(17-24)Online publication date: 26-Apr-2007
https://dl.acm.org/doi/10.5555/1626281.1626284
Zhang HGildea D(2006)Inducing word alignments with bilexical synchronous treesProceedings of the COLING/ACL on Main conference poster sessions10.5555/1273073.1273195(953-960)Online publication date: 17-Jul-2006
https://dl.acm.org/doi/10.5555/1273073.1273195
Show More Cited By

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

Generating parsers for affix grammars

Generalized multitext grammars

Regular right part grammars and their parsers

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

Share

Share this Publication link

Share on social media

Affiliations