Skip to main content

Modifier Structure Grammars

  • Chapter
Logic Grammars

Part of the book series: Symbolic Computation ((1064))

  • 75 Accesses

Abstract

As we saw in the preceding chapter, it is easy to automate syntactic tree buildup. It is not as easy, but often more desirable, to automate the buildup of semantic structure. Both features were introduced in joint research with McCord (Dahl and McCord 1983), which was motivated by treating coordination (constructions with “and”, “or”, “but”, etc.) in a metagrammatical fashion.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag New York Inc.

About this chapter

Cite this chapter

Abramson, H., Dahl, V. (1989). Modifier Structure Grammars. In: Logic Grammars. Symbolic Computation. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-3640-5_9

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-3640-5_9

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-8188-7

  • Online ISBN: 978-1-4612-3640-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics