Skip to main content

Part of the book series: Studies in Computational Intelligence ((SCI,volume 765))

Abstract

We have previously shown that simultaneously considering three arguments yields better precision than does considering only two, though with a certain loss of recall. Kawahara and Kurohashi [107] differentiate the main verb using the closest argument in order to disambiguate verbs for learning preferences.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alexander Gelbukh .

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Gelbukh, A., Calvo, H. (2018). The Need for Full Co-Occurrence. In: Automatic Syntactic Analysis Based on Selectional Preferences. Studies in Computational Intelligence, vol 765. Springer, Cham. https://doi.org/10.1007/978-3-319-74054-6_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-74054-6_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-74053-9

  • Online ISBN: 978-3-319-74054-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics