Abstract
In the previous chapters, we introduced the new concept of syntactic n-grams, i.e., n-grams obtained following paths in syntax trees. The discussion that follows in this chapter addresses the comparison of continuous syntactic n-grams with non-continuous syntactic n-grams (i.e., n-grams with bifurcations (ramifications) and n-grams without them).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
A sentence from one of the books by A. Conan-Doyle.
Bibliography
Gelbukh, A., Calvo, H., Torres, S.: Transforming a Constituency Treebank into a Dependency Treebank. Procesamiento de Lenguaje Natural, No 35. Sociedad Española para el Procesamiento de Lenguaje Natural (SEPLN) (2005)
Gelbukh, A., Sidorov, G., Han, SangYong, Hernández-Rubio, E.: Automatic Enrichment of Very Large Dictionary of Word Combinations on the Basis of Dependency Formalism. Lecture Notes in Artificial Intelligence N 2972, Springer-Verlag, pp 430-437 (2004)
Sidorov, G.: Non-continuous syntactic n-grams. Polibits, 48: 67–75 (2013)
Sidorov, G.: Syntactic Dependency Based N-grams in Rule Based Automatic English as Second Language Grammar Correction. International Journal of Computational Linguistics and Applications, 4(2): 169–188 (2013)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2019 The Author(s), under exclusive licence to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Sidorov, G. (2019). Continuous and Noncontinuous Syntactic n-grams. In: Syntactic n-grams in Computational Linguistics. SpringerBriefs in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-030-14771-6_10
Download citation
DOI: https://doi.org/10.1007/978-3-030-14771-6_10
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)