TY - JOUR
T1 - Algorithm for extraction of subtrees of a sentence dependency parse tree
AU - Posadas-Durán, Juan Pablo
AU - Sidorov, Grigori
AU - Gómez-Adorno, Helena
AU - Batyrshin, Ildar
AU - Mirasol-Mélendez, Elibeth
AU - Posadas-Durán, Gabriela
AU - Chanona-Hernández, Liliana
N1 - Publisher Copyright:
© 2017, Budapest Tech Polytechnical Institution. All rights reserved.
PY - 2017
Y1 - 2017
N2 - In this paper, we introduce an algorithm for obtaining the subtrees (continuous and non-continuous syntactic n-grams) from a dependency parse tree of a sentence. Our algorithm traverses the dependency tree of the sentences within a text document and extracts all its subtrees (syntactic n-grams). Syntactic n-grams are being successfully used in the literature (by ourselves and other authors) as features to characterize text documents using machine learning approach in the field of Natural Language Processing.
AB - In this paper, we introduce an algorithm for obtaining the subtrees (continuous and non-continuous syntactic n-grams) from a dependency parse tree of a sentence. Our algorithm traverses the dependency tree of the sentences within a text document and extracts all its subtrees (syntactic n-grams). Syntactic n-grams are being successfully used in the literature (by ourselves and other authors) as features to characterize text documents using machine learning approach in the field of Natural Language Processing.
KW - Linguistic features
KW - Subtrees extraction
KW - Syntactic n-grams
KW - Tree traversal
UR - http://www.scopus.com/inward/record.url?scp=85034978381&partnerID=8YFLogxK
U2 - 10.12700/APH.14.3.2017.3.5
DO - 10.12700/APH.14.3.2017.3.5
M3 - Artículo
AN - SCOPUS:85034978381
SN - 1785-8860
VL - 14
SP - 79
EP - 98
JO - Acta Polytechnica Hungarica
JF - Acta Polytechnica Hungarica
IS - 3
ER -