TY - CHAP
T1 - Continuous and noncontinuous syntactic n-grams
AU - Sidorov, Grigori
N1 - Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2019.
PY - 2019
Y1 - 2019
N2 - 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).
AB - 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).
UR - http://www.scopus.com/inward/record.url?scp=85064655019&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-14771-6_10
DO - 10.1007/978-3-030-14771-6_10
M3 - Capítulo
AN - SCOPUS:85064655019
T3 - SpringerBriefs in Computer Science
SP - 63
EP - 67
BT - SpringerBriefs in Computer Science
PB - Springer
ER -