國立虎尾科技大學 |

Syntactic n-grams in Computational Linguistics

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Syntactic n-grams in Computational Linguistics/ by Grigori Sidorov.
Author:	Sidorov, Grigori.
Description:	IX, 92 p. 15 illus., 10 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Natural language processing (Computer science). -
Online resource:	https://doi.org/10.1007/978-3-030-14771-6
ISBN:	9783030147716

Syntactic n-grams in Computational Linguistics
Sidorov, Grigori.

Syntactic n-grams in Computational Linguistics[electronic resource] /by Grigori Sidorov. - 1st ed. 2019. - IX, 92 p. 15 illus., 10 illus. in color.online resource. - SpringerBriefs in Computer Science,2191-5768. - SpringerBriefs in Computer Science,.

Preface -- Introduction -- PART I. VECTOR SPACE MODEL IN THE ANALYSIS OF SIMILARITY BETWEEN TEXTS -- Chapter 1. Formalization in computational linguistics -- Chapter 2. Vector space model -- Chapter 3. Vector space model for texts and the tf-idf measure -- Chapter 4. Latent Semantic Analysis (LSA): reduction of dimensions -- Chapter 5. Design of experiments in computational linguistics -- Chapter 6. Example of application of n-grams: authorship attribution using n-grams of syllables -- PART II. NON-LINEAR CONSTRUCTION OF N-GRAMS -- Chapter 7. Syntactic n-grams: the concept -- Chapter 8. Types of syntactic n-grams according to their components -- Chapter 9. Continuous and non-continuous syntactic n-grams -- Chapter 10. Metalanguage of syntactic n-grams representation -- Chapter 11. Examples of construction of non-continuous syntactic n-grams -- Chapter 12. Automatic analysis of authorship using syntactic n-grams -- Chapter 13. Filtered n-grams -- Chapter 14. Generalized n-grams.

This book is about a new approach in the field of computational linguistics related to the idea of constructing n-grams in non-linear manner, while the traditional approach consists in using the data from the surface structure of texts, i.e., the linear structure. In this book, we propose and systematize the concept of syntactic n-grams, which allows using syntactic information within the automatic text processing methods related to classification or clustering. It is a very interesting example of application of linguistic information in the automatic (computational) methods. Roughly speaking, the suggestion is to follow syntactic trees and construct n-grams based on paths in these trees. There are several types of non-linear n-grams; future work should determine, which types of n-grams are more useful in which natural language processing (NLP) tasks. This book is intended for specialists in the field of computational linguistics. However, we made an effort to explain in a clear manner how to use n-grams; we provide a large number of examples, and therefore we believe that the book is also useful for graduate students who already have some previous background in the field.

ISBN: 9783030147716

Standard No.: 10.1007/978-3-030-14771-6doiSubjects--Topical Terms:

802180
Natural language processing (Computer science).

LC Class. No.: QA76.9.N38

Dewey Class. No.: 006.35

Syntactic n-grams in Computational Linguistics
LDR:03535nam a22003975i 4500 001 1009053
003 DE-He213
005 20200703072923.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030147716 $9 978-3-030-14771-6
024 7 $a 10.1007/978-3-030-14771-6 $2 doi
035 $a 978-3-030-14771-6
050 4 $a QA76.9.N38
072 7 $a UYQL $2 bicssc
072 7 $a COM073000 $2 bisacsh
072 7 $a UYQL $2 thema
082 0 4 $a 006.35 $2 23
100 1 $a Sidorov, Grigori. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 815274
245 1 0 $a Syntactic n-grams in Computational Linguistics $h [electronic resource] / $c by Grigori Sidorov.
250 $a 1st ed. 2019.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a IX, 92 p. 15 illus., 10 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a SpringerBriefs in Computer Science, $x 2191-5768
505 0 $a Preface -- Introduction -- PART I. VECTOR SPACE MODEL IN THE ANALYSIS OF SIMILARITY BETWEEN TEXTS -- Chapter 1. Formalization in computational linguistics -- Chapter 2. Vector space model -- Chapter 3. Vector space model for texts and the tf-idf measure -- Chapter 4. Latent Semantic Analysis (LSA): reduction of dimensions -- Chapter 5. Design of experiments in computational linguistics -- Chapter 6. Example of application of n-grams: authorship attribution using n-grams of syllables -- PART II. NON-LINEAR CONSTRUCTION OF N-GRAMS -- Chapter 7. Syntactic n-grams: the concept -- Chapter 8. Types of syntactic n-grams according to their components -- Chapter 9. Continuous and non-continuous syntactic n-grams -- Chapter 10. Metalanguage of syntactic n-grams representation -- Chapter 11. Examples of construction of non-continuous syntactic n-grams -- Chapter 12. Automatic analysis of authorship using syntactic n-grams -- Chapter 13. Filtered n-grams -- Chapter 14. Generalized n-grams.
520 $a This book is about a new approach in the field of computational linguistics related to the idea of constructing n-grams in non-linear manner, while the traditional approach consists in using the data from the surface structure of texts, i.e., the linear structure. In this book, we propose and systematize the concept of syntactic n-grams, which allows using syntactic information within the automatic text processing methods related to classification or clustering. It is a very interesting example of application of linguistic information in the automatic (computational) methods. Roughly speaking, the suggestion is to follow syntactic trees and construct n-grams based on paths in these trees. There are several types of non-linear n-grams; future work should determine, which types of n-grams are more useful in which natural language processing (NLP) tasks. This book is intended for specialists in the field of computational linguistics. However, we made an effort to explain in a clear manner how to use n-grams; we provide a large number of examples, and therefore we believe that the book is also useful for graduate students who already have some previous background in the field.
650 0 $a Natural language processing (Computer science). $3 802180
650 0 $a Computational linguistics. $3 555811
650 1 4 $a Natural Language Processing (NLP). $3 1254293
650 2 4 $a Computational Linguistics. $3 670080
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030147709
776 0 8 $i Printed edition: $z 9783030147723
830 0 $a SpringerBriefs in Computer Science, $x 2191-5768 $3 1255334
856 4 0 $u https://doi.org/10.1007/978-3-030-14771-6
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)