International Conference on Computational Linguistics · 2016 · 12 citations · 13 references
Language StudiesComputer ScienceLinguisticsComputational LinguisticsNatural Language ProcessingSemanticsAnnotationCorpus AnalysisDiachronic Corpus AnalysisLanguage ClassificationSyntactic AnalysisType ClassificationCompound IdentificationGenerative GrammarGrammar TheoryLinguistic AnnotationLinguistic PatternsRandom Forest ClassificationSemantic Relations ExtractionSemantic Type Annotation
We propose a classification framework for semantic type identification of compounds in Sanskrit. We broadly classify the compounds into four different classes namely, Avyayībhāva, Tatpuruṣa, Bahuvrīhi and Dvandva. Our classification is based on the traditional classification system followed by the ancient grammar treatise Adṣṭādhyāyī, proposed by Pāṇini 25 centuries back. We construct an elaborate features space for our system by combining conditional rules from the grammar Adṣṭādhyāyī, semantic relations between the compound components from a lexical database Amarakoṣa and linguistic structures from the data using Adaptor Grammars. Our in-depth analysis of the feature space highlight inadequacy of Adṣṭādhyāyī, a generative grammar, in classifying the data samples. Our experimental results validate the effectiveness of using lexical databases as suggested by Amba Kulkarni and Anil Kumar, and put forward a new research direction by introducing linguistic patterns obtained from Adaptor grammars for effective identification of compound type. We utilise an ensemble based approach, specifically designed for handling skewed datasets and we %and Experimenting with various classification methods, we achieve an overall accuracy of 0.77 using random forest classifiers.
13
Pierre Geurts, Damien Ernst, Louis Wehenkel · Machine Learning · 2006 · 8.7K citations · Full text
Interpreting semantic relations in noun compounds via verb semantics
Su Nam Kim, Timothy Baldwin · 2006 · 64 citations · Full text