| Título |
Syntactic Dependency-Based N-grams as Classification Features |
| Tipo |
Congreso |
| Sub-tipo |
SCOPUS |
| Descripción |
Lecture Notes in Computer Science; 11th Mexican International Conference on Artificial Intelligence, MICAI 2012 |
| Resumen |
In this paper we introduce a concept of syntactic n-grams (sn-grams). Sn-grams differ from traditional n-grams in the manner of what elements are considered neighbors. In case of sn-grams, the neighbors are taken by following syntactic relations in syntactic trees, and not by taking the words as they appear in the text. Dependency trees fit directly into this idea, while in case of constituency trees some simple additional steps should be made. Sn-grams can be applied in any NLP task where traditional n-grams are used. We describe how sn-grams were applied to authorship attribution. SVM classifier for several profile sizes was used. We used as baseline traditional n-grams of words, POS tags and characters. Obtained results are better when applying sn-grams. |
| Observaciones |
DOI: 10.1007/978-3-642-37798-3_1 |
| Lugar |
San Luis Postosí |
| País |
Mexico |
| No. de páginas |
1-11 |
| Vol. / Cap. |
Vol. 7630, Issue 2 |
| Inicio |
2012-10-27 |
| Fin |
2012-11-04 |
| ISBN/ISSN |
978-3-642-37797-6 |
