Abstract
Different ways of defining the term “word combinations” are considered. New methods based on syntactic trees are examined, as is the use of n-grams. Terms such as n-chain, n-subtree, and full t-subtrees are introduced. New types of word combinations can serve as the basis for start-of-text characters in problems of computer-assisted teaching. All described types of word combinations are compared to one another in a task of determining authorship, posed as a classification problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Moscow University Computational Mathematics and Cybernetics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
