Skip to main content

Metalanguage of Syntactic n-gram Representation

  • Chapter
  • First Online:
Book cover Syntactic n-grams in Computational Linguistics

Part of the book series: SpringerBriefs in Computer Science ((BRIEFSCOMPUTER))

  • 684 Accesses

Abstract

The question arises, how to represent non-continuous syntactic n-grams without resorting to their graphic form? Recall that continuous syntactic n-grams are simply sequences of words (obtained by following paths in a syntactic tree), but the case of the non-continuous syntactic n-gram is rather different.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2019 The Author(s), under exclusive licence to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Sidorov, G. (2019). Metalanguage of Syntactic n-gram Representation. In: Syntactic n-grams in Computational Linguistics. SpringerBriefs in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-030-14771-6_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-14771-6_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-14770-9

  • Online ISBN: 978-3-030-14771-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics