Article

Finite-state approximations of grammars

Author:

Fernando PereiraAuthors Info & Claims

HLT '90: Proceedings of the workshop on Speech and Natural Language

Pages 20 - 25

https://doi.org/10.3115/116580.116592

Published: 24 June 1990 Publication History

Abstract

Grammars for spoken language systems are subject to the conflicting requirements of language modeling for recognition and of language analysis for sentence interpretation. Current recognition algorithms can most directly use finite-state acceptor (FSA) language models. However, these models are inadequate for language interpretation, since they cannot express the relevant syntactic and semantic regularities. Augmented phrase structure grammar (APSG) formalisms, such as unification grammars, can express many of those regularities, but they are computationally less suitable for language modeling, because of the inherent cost of computing state transitions in APSG parsers.

References

[1]

Alfred V. Aho and Jeffrey D. Ullman. 1977. Principles of Compiler Design. Addison-Wesley, Reading, Massachusetts.

Digital Library

Google Scholar

[2]

Roland C. Backhouse. 1979. Syntax of Programming Languages---Theory and Practice. Series in Computer Science. Prentice-Hall, Englewood Cliffs, New Jersey.

Digital Library

Google Scholar

[3]

Alan W. Black. 1989. Finite state machines from feature grammars. In Masaru Tomita, editor, International Workshop on Parsing Technologies, pages 277-285, Pittsburgh, Pennsylvania. Carnegie Mellon University.

Google Scholar

[4]

Kenneth W. Church and Ramesh Patil. 1982. Coping with syntactic ambiguity or how to put the block in the box on the table. Computational Linguistics, 8(34):139--149.

Digital Library

Google Scholar

[5]

Kenneth W. Church. 1980. On memory limitations in natural language processing. Master's thesis, M.I.T. Published as Report MIT/LCS/TR--245.

Digital Library

Google Scholar

[6]

Steven G. Pulman. 1986. Grammars, parsers, and memory limitations. Language and Cognitive Processes, 1(3):197--225.

Crossref

Google Scholar

[7]

Stuart M. Shieber. 1985. Using restriction to extend parsing algorithms for complex-feature-based formalisms. In 23rd Annual Meeting of the Association

Digital Library

Google Scholar

Cited By

View all

Ayuso D(1994)Pattern matching in a linguistically-motivated text understanding systemProceedings of the workshop on Human Language Technology10.3115/1075812.1075850(182-186)Online publication date: 8-Mar-1994
https://dl.acm.org/doi/10.3115/1075812.1075850
Jacobs PKrupka GRau LMauldin MMitamura TKitani TSider IChilds L(1993)The TIPSTER/SHOGUN projectProceedings of a workshop on held at Fredericksburg, Virginia: September 19-23, 199310.3115/1119149.1119172(209-221)Online publication date: 23-Sep-1993
https://dl.acm.org/doi/10.3115/1119149.1119172
Jacobs PKrupka GRau LMauldin MMitamura TKitani TSider IChilds L(1993)GE-CMUProceedings of the 5th conference on Message understanding10.3115/1072017.1072031(109-120)Online publication date: 25-Aug-1993
https://dl.acm.org/doi/10.3115/1072017.1072031
Show More Cited By

Index Terms

Finite-state approximations of grammars
1. Computing methodologies
  1. Artificial intelligence
    1. Natural language processing
      1. Speech recognition

Recommendations

Finite-state approximation of phrase structure grammars
ACL '91: Proceedings of the 29th annual meeting on Association for Computational Linguistics

Phrase-structure grammars are an effective representation for important syntactic and semantic aspects of natural languages, but are computationally too demanding for use as language models in real-time speech recognition. An algorithm is described that ...
Parallel multiple context-free grammars, finite-state translation systems, and polynomial-time recognizable subclasses of lexical-functional grammars
ACL '93: Proceedings of the 31st annual meeting on Association for Computational Linguistics

A number of grammatical formalisms were introduced to define the syntax of natural languages. Among them are parallel multiple context-free grammars (pmcfg's) and lexical-functional grammars (lfg's). Pmcfg's and their subclass called multiple context-...
Finite-state morphological parsing using register vector grammars

Comments

Information & Contributors

Information

Published In

HLT '90: Proceedings of the workshop on Speech and Natural Language

June 1990

450 pages

Publisher

Association for Computational Linguistics

United States

Publication History

Published: 24 June 1990

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 240 of 768 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 12 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ayuso D(1994)Pattern matching in a linguistically-motivated text understanding systemProceedings of the workshop on Human Language Technology10.3115/1075812.1075850(182-186)Online publication date: 8-Mar-1994
https://dl.acm.org/doi/10.3115/1075812.1075850
Jacobs PKrupka GRau LMauldin MMitamura TKitani TSider IChilds L(1993)The TIPSTER/SHOGUN projectProceedings of a workshop on held at Fredericksburg, Virginia: September 19-23, 199310.3115/1119149.1119172(209-221)Online publication date: 23-Sep-1993
https://dl.acm.org/doi/10.3115/1119149.1119172
Jacobs PKrupka GRau LMauldin MMitamura TKitani TSider IChilds L(1993)GE-CMUProceedings of the 5th conference on Message understanding10.3115/1072017.1072031(109-120)Online publication date: 25-Aug-1993
https://dl.acm.org/doi/10.3115/1072017.1072031
Hobbs JAppelt DTyson MBear JIsrael D(1992)SRI InternationalProceedings of the 4th conference on Message understanding10.3115/1072064.1072103(268-275)Online publication date: 16-Jun-1992
https://dl.acm.org/doi/10.3115/1072064.1072103

Abstract

References

Cited By

Index Terms

Recommendations

Finite-state approximation of phrase structure grammars

Parallel multiple context-free grammars, finite-state translation systems, and polynomial-time recognizable subclasses of lexical-functional grammars

Finite-state morphological parsing using register vector grammars

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations