Abstract

Syntactic parsing in NLP is the task of working out the grammatical structure of sentences. Some of the purely formal approaches to parsing such as phrase structure grammar, dependency grammar have been successfully employed for a variety of languages. While phrase structure based constituent analysis is possible for fixed order languages such as English, dependency analysis between the grammatical units have been suitable for many free word order languages. These approaches rely on identifying the linguistic units based on their formal syntactic properties and establishing the relationships between such units in the form of a tree. Instead, we characterize every morphosyntactic unit as a mapping between form and function on the lines of Construction Grammar and parsing as identification of dependency relations between such conceptual units. Our approach to parser annotation shows an average MALT LAS score of 82.21% on Tamil gold annotated corpus of 935 sentences in a five-fold validation experiment.

Abstract

The Linguistic Annotation Workshop (LAW) is organized annually by the Association for Computational Linguistics’ Special Interest Group for Annotation (ACL SIGANN). It provides a forum to facilitate the exchange and propagation of research results concerned with the annotation, manipulation, and exploitation of corpora; work towards harmonisation and interoperability from the perspective of the increasingly large number of tools and frameworks for annotated language resources; and work towards a consensus on all issues crucial to the advancement of the field of corpus annotation. The series is now in its tenth year, with these proceedings including papers that were presented at LAW X, held in conjunction with the annual meeting of the Association for Computational Linguistics (ACL) in Berlin, Germany, on August 11, 2016.

Abstract

This paper evaluates the challenges involved in shallow parsing of Dravidian languages which are highly agglutinative and morphologically rich. Text processing tasks in these languages are not trivial because multiple words concatenate to form a single string with morpho-phonemic changes at the point of concatenation. This phenomenon known as Sandhi, in turn complicates the individual word identification. Shallow parsing is the task of identification of correlated group of words given a raw sentence. The current work is an attempt to study the effect of Sandhi in building shallow parsers for Dravidian languages by evaluating its effect on Malayalam, one of the main languages from Dravidian family. We provide an in-depth analysis of effect of Sandhi in developing a robust shallow parser pipeline with experimental results emphasizing on how sensitive the individual components of shallow parser are, towards the accuracy of a sandhi splitter. Our work can serve as a guiding light for building robust text processing systems in Dravidian languages.

Abstract

This paper explores P¯an. inian Grammar (PG) as an information processing device in terms of ‘how’, ‘how much’ and ‘where’ languages encode information. PG is based on a morphologically rich language, Sanskrit. We apply PG on English and see how the P¯an. inian perspective would deal with it from the information theoretical point of view and its effectiveness in machine translation. We analyze English phrases defining sup (nominal inflections) and ti ˙n (finite verb inflections) and compare them with the notion of pada (an inflected word form) and samasta-pada (compound) in Sanskrit. Sanskrit encodes relations between nouns and adjectives and nouns in apposition through agreement between gender, number and case markers, whereas English encodes them through positions. As a result, constituents are formed. It appears that an English phrase contains more than one pada, hence, cannot be similar to a pada. However, we show the linguistic similarities between a pada, samasta-pada and ‘phrase’.

Abstract

We present here a data mining approach for part-of-speech (POS) tagging, an important natural language processing (NLP) task, which is a classification problem. We propose a semi-supervised associative classification method for POS tagging. Existing methods for building POS taggers require extensive domain and linguistic knowledge and resources. Our method uses a combination of a small POS tagged corpus and untagged text data as training data to build the classifier model using association rules. Our tagger works well with very little training data also. The use of semi-supervised learning provides the advantage of not requiring a large high-quality annotated corpus. These properties make it especially suitable for resource-poor languages. Our experiments on various resource-rich, resource-moderate and resource-poor languages show good performance without using any language-specific linguistic information. We note that inclusion of such features in our method may further improve the performance. Results also show that for smaller training data sizes our tagger performs better than state-of-the-art conditional random field (CRF) tagger using same features as our tagger.

Abstract

In this paper, we present hybrid approaches for pronominal reference type (abstract or concrete) identification and event anaphora resolution for Hindi. Pronominal reference type identification is one of the important parts for any anaphora resolution system as it helps anaphora resolver in optimal feature selection based on pronominal reference types. We use language specific rules and features in set of classifiers (ensemble learning) for pronominal type identification. We discuss event referring anaphors (pronouns) and their resolution using Paninian dependency grammar, language syntax, proximity of events, etc. We achieved around 9̃0% accuracy in the pronominal reference type identification and around 7̃1% F-score in the event anaphora resolution on Hindi dependency tree-bank corpus.

Abstract

Back off techniques are employed in syllable based unit selection speech synthesis systems to maintain the naturalness of the speech in spite of the missing syllables. In synthesizing the missing complex consonant clusters syllables of Telugu, we introduced reduced vowel epenthesis as a rule-based backoff strategy[1]. In this paper, we refine the scope of the approach in selectively applying vowel epenthesis only in cases of sonority rise between adjacent consonants. When the sonority does not rise (stop-stop, liquid-stop clusters), we increase the duration of the consonant. Owing to specific patterns of vowel epenthesis observed in languages, we conduct a subjective evaluation to determine the identity of the epenthetic vowel in Hindi. From the inferences of the listening test, we devise a class based rule to perform epenthesis. Further, to evaluate the performance of the designed system, we perform both subjective as well as an objective evaluation based on confidence measures from an ASR system. We conduct a phone level automatic speech recognition task on the intelligibility of the words synthesized using epenthesis as a cluster-repair strategy. The results show that the proposed back off method helps in producing more natural-sounding speech compared to the conventional backoffs.

Abstract

The objective of this work is to develop a rule-based emotion conversion method for a better emotional perception. In this work, performance of emotion conversion using the linear modification model is improved by using vowel-based non-uniform prosody modification. In the present approach, attempts were made to integrate features like position and identity for addressing the non-uniformity in prosody generated due to the emotional state of the speaker. We mainly concentrate on the parameters such as strength, duration and pitch contour of vowels at different parts of the sentence. The influence of emotions on the above parameters is exploited to convert the speech from neutral emotion to the target emotion. Non-uniform prosody modification factors for emotion conversion are based on the position of vowels in the word, and the position of the word in the sentence. This study is carried out by using Indian Institute of Technology-Simulated Emotion speech corpus. Evaluation of the proposed algorithm is carried out by a subjective listening test. From the listening tests, it is observed that the performance of the proposed approach is better than the existing approaches

Abstract

In this paper, deep neural networks are investigated for language identification in Indian languages. Deep neural networks(DNN) have been recently proposed for this task. However many architectural choices and training aspects that have been made while building such systems have not been studied carefully. We perform several experiments on a dataset consisting of 12 Indian languages with a total training data of about 120hours in evaluating the effect of such choices.While DNN based approach is inherently a frame based one, we propose an attention mechanism based DNN architecture for utterance level classification there by efficiently making use of the context. Evaluation of models were performed on 30 hours of testing data with 2.5 hours for each language. In our results, we find that deeper architectures outperform shallower counterparts. Also, DNN with attention mechanism out-performs the regular DNN models indicating the effectiveness of attention mechanism.

Abstract

In this paper, we describe a statistical parametric speech synthesis approach with unit-level acoustic representation. In conventional deep neural network based speech synthesis, the input text features are repeated for the entire duration of phoneme for mapping text and speech parameters. This mapping is learnt at the frame-level which is the de-facto acoustic representation. However much of this computational requirement can be drastically reduced if every unit can be represented with a fixed-dimensional representation. Using recurrent neural network based auto-encoder, we show that it is indeed possible to map units of varying duration to a single vector. We then use this acoustic representation at unit-level to synthesize speech using deep neural network based statistical parametric speech synthesis technique. Results show that the proposed approach is able to synthesize at the same quality as the conventional frame based approach at a highly reduced computational cost.