Thamizhiudp: a Dependency Parser for Tamil

Total Page:16

File Type:pdf, Size:1020Kb

Thamizhiudp: a Dependency Parser for Tamil ThamizhiUDp: A Dependency Parser for Tamil Kengatharaiyer Sarveswaran Gihan Dias University of Moratuwa / Sri Lanka University of Moratuwa / Sri Lanka [email protected] [email protected] Abstract state of the art for most natural language process- This paper describes how we developed ing tasks. These approaches require a significant a neural-based dependency parser, namely amount of quality data for training and evaluation. ThamizhiUDp, which provides a complete On the other hand techniques like transfer learning, pipeline for the dependency parsing of the and multilingual learning may be used to overcome Tamil language text using Universal Depen- data scarcity. This paper discusses how we devel- dency formalism. We have considered the oped a neural-based dependency parser for Tamil phases of the dependency parsing pipeline and with the aid of data orchestration and multilingual identified tools and resources in each of these training. phases to improve the accuracy and to tackle data scarcity. ThamizhiUDp uses Stanza for to- kenisation and lemmatisation, ThamizhiPOSt 2 Background and Motivation and ThamizhiMorph for generating Part of Speech (POS) and Morphological annotations, Tamil is a Southern Dravidian language spoken and uuparser with multilingual training for de- by more than 80 million people around the world. pendency parsing. ThamizhiPOSt is our POS However, it still lacks enough tools and quality tagger, which is based on the Stanza, trained annotated data to build good Natural Language with Amrita POS-tagged corpus. It is the cur- Processing (NLP) applications. rent state-of-the-art in Tamil POS tagging with an F1 score of 93.27. Our morphological ana- 2.1 Universal Dependency Treebank lyzer, ThamizhiMorph is a rule-based system with a very good coverage of Tamil. Our de- Treebanks are a collection of texts with various lev- pendency parser ThamizhiUDp was trained us- els of annotations, including Part of Speech (POS) ing multilingual data. It shows a Labelled As- and morpho-syntactic annotations. There are differ- signed Score (LAS) of 62.39, 4 points higher ent formalisms used to mark syntactic annotations than the current best achieved for Tamil depen- (Marcus et al., 1993;B ohmov¨ a´ et al., 2003; Nivre dency parsing. Therefore, we show that break- ing up the dependency parsing pipeline to ac- et al., 2016; Kaplan and Bresnan, 1982). Among commodate existing tools and resources is a vi- the available formalisms, the dependency grammar able approach for low-resource languages. formalism is useful for languages like Tamil which are morphologically rich, and whose word order 1 Introduction arXiv:2012.13436v1 [cs.CL] 24 Dec 2020 is relatively variable and less bound (Bharati et al., Applying neural-based approaches to Tamil, like 2009). other Indic languages, is challenging due to a lack The Universal Dependency formalism (Nivre of quality data (Bhattacharyya et al., 2019), and the et al., 2016) is nowadays used widely to create language’s structure (Sarveswaran and Butt, 2019; Universal Dependency Treebanks (UD) with an- Butt, Miriam, Rajamathangi, S. and Sarveswaran, notations. The current release of UDv2.7 has 183 K., 2020). Although there is a large volume of elec- annotated treebanks of various sizes from 104 lan- tronic unstructured/partially-structured text avail- guages (Zeman et al., 2020). UD captures informa- able on the Internet, not many language processing tion such as Parts of Speech (POS), morphological tools are publicly available for even fundamental features, and syntactic relations in the form of de- tasks like part of speech (POS) tagging or pars- pendencies. All these annotations are defined with ing. Nowadays, neural-based approaches are the multilingual language processing in mind, and the present format used to specify the annotation is called CoNLL-U format.1 There are only three Indic languages, namely, Hindi, Urdu, and Sanskrit that have relatively large datasets 375K, 138K, and 28K tokens, respectively in UDv2.7. All the other six Indic languages, in- cluding Tamil and Telugu, have less than 12K to- kens in UDv2.7. 2.2 Tamil Universal Dependency Treebanks Tamil has been included in UD treebank releases since 2015. Initially it was populated from the Prague Style Tamil treebank by (Ramasamy and Figure 1: Phases of the Parsing Pipeline Zabokrtskˇ y´, 2012), and since then the dataset has Image source: https://stanfordnlp.github.io/stanza been part of the UD without much alterations or corrections. Tamil TTB in UDv2.6 has some inac- Dependency Treebanks (UD), including Stanza (Qi curacies, and inconsistencies. For instance, num- et al., 2020), and uuparser (de Lhoneux et al., 2017) bers are marked as NUM and ADJ, while only the and its derivatives. Both of these are open source former tag is correct. The first author of this pa- tools. Stanza is a Python NLP library which in- per has corrected some of these issues and made cludes a multilingual neural NLP pipeline for de- it available in UDv2.7. However, there are still pendency parsing using Universal Dependency for- more issues that need to be solved. Tamil TTB malism. uuparser is a tool developed specifically in UDv2.7 has altogether 600 sentences for train- for UD parsing. These neural-based tools need ing, development and testing. In (Zeman et al., large amount of quality data on which to be trained. 2020), there is another Tamil treebank with 536 On the other hand, several approaches are being sentences, namely MWTT, which has been newly used to overcome the issue with data scarcity, in- added. MWTT is based on the Enhanced Universal cluding multilingual training. There is an attempt 2 Dependency annotation, where complex concepts to create a multilingual parsing for several low- like elision, relative clauses, propagation of con- resource languages, and it is reported that multi- juncts, raising and control constructions, and ex- lingual training significantly improves the parsing tended case marking are captured. Therefore, there accuracy of low-resource languages (Smith et al., are slight variations in TTB and MWTT. Further, 2018). MWTT has very short sentences, while TTB has relatively very longer ones. In this paper, we have 3 ThamizhiUDp mainly used and discussed Tamil TTB. By considering all available resources and ap- 2.3 Dependency parsers proaches as outlined in section2, we decided to A Dependency parser is a type of syntactic parser develop a Universal Dependency parser (UDp) for which is useful to elicit lexical, morphological, and Tamil called ThamizhiUDp using existing open syntactic features, and the inter-connections of to- source tools, namely Stanza, ThamizhiMorph, and kens in a given sentence. Linguistically, this would uuparser. However, since we do not have enough be useful for syntactic analyses, and comparative data to train a neural-based parser end-to-end, we studies. Computationally, this is a key resource for have broken up the pipeline to different phases. We natural language understanding (Dozat and Man- have then orchestrated data from different sources ning, 2018). Different approaches are employed for each of these phases, and used different tools in when developing dependency parsers. However, different phases, as shown in Table1. The follow- neural-based parsers are the latest state of the art. ing sub-sections discuss each of the stages of the There are several off-the-shelf neural-based pipeline, and how we went about developing them. parsers available that are built around Universal Our dependency parsing pipeline has several 1https://universaldependencies.org/ stages as shown in Figure1. As mentioned, we format.html used different datasets and tools, as shown in Table 2https://universaldependencies.org/u/ overview/enhanced-syntax.html 1, in the different stages of the pipeline. Currently, Step Tool Dataset in TTB. We are in the process of improving this Tokenisation Stanza Tamil UDT Multi-word Stanza Tamil UDT multi-word tokeniser with the use of more data. tokeniser Lemmatisation Stanza Tamil UDT 3.3 Lemmatisation using Stanza POS tagging ThamizhiPOSt Amrita Data Morphological ThamizhiMorph Rule-based UD Treebanks also have lemmas marked in their tagging Dependency pars- uuparser UDT of various CoNLL-U format annotation This is useful for ing languages language processing applications, such as a Ma- chine Translator. We trained Stanza using the TTB Table 1: ThamizhiUDp process pipeline UDv2.6 to do lemmatisation. However, the cur- rent TTB has several inaccuracies in identifying Stanza does not have support for multilingual train- lemmas, specifically due to improper multi-word ing. Therefore, for dependency parsing, we used tokenisation. Since a lemma is identified for multi- uuparser with the multilingual training. Each of word tokenised words, multi-word tokenisation has the phases within the pipeline is explained in the an effect on lemmatisation. Since we are still in following respective sub-sections. the process of improving our multi-word tokeniser, lemmatisation will also be improved in the future. 3.1 Tokenisation 3.4 POS tagging using ThamizhiPOSt First, the given texts have been Unicode nor- malised, and then tokenised, and broken up in to Part of Speech (POS) tagging is an important sentences. We developed a script3 to do Unicode phase in the parsing process where each word normalisation. Because of different input meth- in a sentence is assigned with its POS tag (or ods or other reasons, at times the same surface lexical category) information. Several attempts form of a character has been stored using different have been made to define POS tagsets for Tamil, Unicode sequences. Therefore, this needed to be based on different theories, and level of granular- normalised, otherwise, a computer would consider ity; (Sarveswaran and Mahesan, 2014) gives an them as different characters. Once this normalisa- account of different tagsets. Among these, Am- tion was done, we moved on to tokenisation. To do rita (Anand Kumar et al., 2010) and BIS5 are two this, we trained Stanza with the texts available in popular tagsets.
Recommended publications
  • Enhanced Thesaurus Terms Extraction for Document Indexing
    Enhanced Thesaurus Terms Extraction for Document Indexing Frane ari¢, Jan najder, Bojana Dalbelo Ba²i¢, Hrvoje Ekli¢ Faculty of Electrical Engineering and Computing, University of Zagreb Unska 3, 10000 Zagreb, Croatia E-mail:{Frane.Saric, Jan.Snajder, Bojana.Dalbelo, Hrvoje.Eklic}@fer.hr Abstract. In this paper we present an mogeneous due to diverse background knowl- enhanced method for the thesaurus term edge and expertise of human indexers. The extraction regarded as the main support to task of building semi-automatic and auto- a semi-automatic indexing system. The matic systems, which aim to decrease the enhancement is achieved by neutralising burden of work borne by indexers, has re- the eect of language morphology applying cently attracted interest in the research com- lemmatisation on both the text and the munity [4], [13], [14]. Automatic indexing thesaurus, and by implementing an ecient systems still do not achieve the performance recursive algorithm for term extraction. of human indexers, so semi-automatic sys- Formal denition and statistical evaluation tems are widely used (CINDEX, MACREX, of the experimental results of the proposed MAI [10]). method for thesaurus term extraction are In this paper we present a method for the- given. The need for disambiguation methods saurus term extraction regarded as the main and the eect of lemmatisation in the realm support to semi-automatic indexing system. of thesaurus term extraction are discussed. Term extraction is a process of nding all ver- batim occurrences of all terms in the text. Keywords. Information retrieval, term Our method of term extraction is a part of extraction, NLP, lemmatisation, Eurovoc.
    [Show full text]
  • An Evaluation of Machine Learning Approaches to Natural Language Processing for Legal Text Classification
    Imperial College London Department of Computing An Evaluation of Machine Learning Approaches to Natural Language Processing for Legal Text Classification Supervisors: Author: Prof Alessandra Russo Clavance Lim Nuri Cingillioglu Submitted in partial fulfillment of the requirements for the MSc degree in Computing Science of Imperial College London September 2019 Contents Abstract 1 Acknowledgements 2 1 Introduction 3 1.1 Motivation .................................. 3 1.2 Aims and objectives ............................ 4 1.3 Outline .................................... 5 2 Background 6 2.1 Overview ................................... 6 2.1.1 Text classification .......................... 6 2.1.2 Training, validation and test sets ................. 6 2.1.3 Cross validation ........................... 7 2.1.4 Hyperparameter optimization ................... 8 2.1.5 Evaluation metrics ......................... 9 2.2 Text classification pipeline ......................... 14 2.3 Feature extraction ............................. 15 2.3.1 Count vectorizer .......................... 15 2.3.2 TF-IDF vectorizer ......................... 16 2.3.3 Word embeddings .......................... 17 2.4 Classifiers .................................. 18 2.4.1 Naive Bayes classifier ........................ 18 2.4.2 Decision tree ............................ 20 2.4.3 Random forest ........................... 21 2.4.4 Logistic regression ......................... 21 2.4.5 Support vector machines ...................... 22 2.4.6 k-Nearest Neighbours .......................
    [Show full text]
  • Using Lexico-Syntactic Ontology Design Patterns for Ontology Creation and Population
    Using Lexico-Syntactic Ontology Design Patterns for ontology creation and population Diana Maynard and Adam Funk and Wim Peters Department of Computer Science University of Sheffield Regent Court, 211 Portobello S1 4DP, Sheffield, UK Abstract. In this paper we discuss the use of information extraction techniques involving lexico-syntactic patterns to generate ontological in- formation from unstructured text and either create a new ontology from scratch or augment an existing ontology with new entities. We refine the patterns using a term extraction tool and some semantic restrictions derived from WordNet and VerbNet, in order to prevent the overgener- ation that occurs with the use of the Ontology Design Patterns for this purpose. We present two applications developed in GATE and available as plugins for the NeOn Toolkit: one for general use on all kinds of text, and one for specific use in the fisheries domain. Key words: natural language processing, relation extraction, ontology generation, information extraction, Ontology Design Patterns 1 Introduction Ontology population is a crucial part of knowledge base construction and main- tenance that enables us to relate text to ontologies, providing on the one hand a customised ontology related to the data and domain with which we are con- cerned, and on the other hand a richer ontology which can be used for a variety of semantic web-related tasks such as knowledge management, information re- trieval, question answering, semantic desktop applications, and so on. Automatic ontology population is generally performed by means of some kind of ontology-based information extraction (OBIE) [1, 2]. This consists of identi- fying the key terms in the text (such as named entities and technical terms) and then relating them to concepts in the ontology.
    [Show full text]
  • LASLA and Collatinus
    L.A.S.L.A. and Collatinus: a convergence in lexica Philippe Verkerk, Yves Ouvrard, Margherita Fantoli, Dominique Longrée To cite this version: Philippe Verkerk, Yves Ouvrard, Margherita Fantoli, Dominique Longrée. L.A.S.L.A. and Collatinus: a convergence in lexica. Studi e saggi linguistici, ETS, In press. hal-02399878v1 HAL Id: hal-02399878 https://hal.archives-ouvertes.fr/hal-02399878v1 Submitted on 9 Dec 2019 (v1), last revised 14 May 2020 (v2) HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. L.A.S.L.A. and Collatinus: a convergence in lexica Philippe Verkerk, Yves Ouvrard, Margherita Fantoli and Dominique Longrée L.A.S.L.A. (Laboratoire d'Analyse Statistique des Langues Anciennes, University of Liège, Belgium) has begun in 1961 a project of lemmatisation and morphosyntactic tagging of Latin texts. This project is still running with new texts lemmatised each year. The resulting files have been recently opened to the interested scholars and they now count approximatively 2.500.000 words, the lemmatisation of which has been checked by a philologist. In the early 2.000's, Collatinus has been developed by Yves Ouvrard for teaching.
    [Show full text]
  • Experiments in Clustering Urban-Legend Texts
    How to Distinguish a Kidney Theft from a Death Car? Experiments in Clustering Urban-Legend Texts Roman Grundkiewicz, Filip Gralinski´ Adam Mickiewicz University Faculty of Mathematics and Computer Science Poznan,´ Poland [email protected], [email protected] Abstract is much easier to tap than the oral one, it becomes feasible to envisage a system for the machine iden- This paper discusses a system for auto- tification and collection of urban-legend texts. In matic clustering of urban-legend texts. Ur- this paper, we discuss the first steps into the cre- ban legend (UL) is a short story set in ation of such a system. We concentrate on the task the present day, believed by its tellers to of clustering of urban legends, trying to reproduce be true and spreading spontaneously from automatically the results of manual categorisation person to person. A corpus of Polish UL of urban-legend texts done by folklorists. texts was collected from message boards In Sec. 2 a corpus of 697 Polish urban-legend and blogs. Each text was manually as- texts is presented. The techniques used in pre- signed to one story type. The aim of processing the corpus texts are discussed in Sec. 3, the presented system is to reconstruct the whereas the clustering process – in Sec. 4. We manual grouping of texts. It turned out that present the clustering experiment in Sec. 5 and the automatic clustering of UL texts is feasible results – in Sec. 6. but it requires techniques different from the ones used for clustering e.g. news ar- 2 Corpus ticles.
    [Show full text]
  • Removing Boilerplate and Duplicate Content from Web Corpora
    Masaryk University Faculty}w¡¢£¤¥¦§¨ of Informatics !"#$%&'()+,-./012345<yA| Removing Boilerplate and Duplicate Content from Web Corpora Ph.D. thesis Jan Pomik´alek Brno, 2011 Acknowledgments I want to thank my supervisor Karel Pala for all his support and encouragement in the past years. I thank LudˇekMatyska for a useful pre-review and also for being so kind and cor- recting typos in the text while reading it. I thank the KrdWrd team for providing their Canola corpus for my research and namely to Egon Stemle for his help and technical support. I thank Christian Kohlsch¨utterfor making the L3S-GN1 dataset publicly available and for an interesting e-mail discussion. Special thanks to my NLPlab colleagues for creating a great research environment. In particular, I want to thank Pavel Rychl´yfor inspiring discussions and for an interesting joint research. Special thanks to Adam Kilgarriff and Diana McCarthy for reading various parts of my thesis and for their valuable comments. My very special thanks go to Lexical Computing Ltd and namely again to the director Adam Kilgarriff for fully supporting my research and making it applicable in practice. Last but not least I thank my family for all their love and support throughout my studies. Abstract In the recent years, the Web has become a popular source of textual data for linguistic research. The Web provides an extremely large volume of texts in many languages. However, a number of problems have to be resolved in order to create collections (text corpora) which are appropriate for application in natural language processing. In this work, two related problems are addressed: cleaning a boilerplate and removing duplicate and near-duplicate content from Web data.
    [Show full text]
  • The State of (Full) Text Search in Postgresql 12
    Event / Conference name Location, Date The State of (Full) Text Search in PostgreSQL 12 FOSDEM 2020 Jimmy Angelakos Senior PostgreSQL Architect Twitter: @vyruss https://www.2ndQuadrant.com FOSDEM Brussels, 2020-02-02 Contents ● (Full) Text Search ● Indexing ● Operators ● Non-natural text ● Functions ● Collation ● Dictionaries ● Other “text” types ● Examples ● Maintenance https://www.2ndQuadrant.com FOSDEM Brussels, 2020-02-02 Your attention please Allergy advice ● This presentation contains linguistics, NLP, Markov chains, Levenshtein distances, and various other confounding terms. ● These have been known to induce drowsiness and inappropriate sleep onset in lecture theatres. https://www.2ndQuadrant.com FOSDEM Brussels, 2020-02-02 What is Text? (Baby don’t hurt me) ● PostgreSQL character types – CHAR(n) – VARCHAR(n) – VARCHAR, TEXT ● Trailing spaces: significant (e.g. for LIKE / regex) ● Storage – Character Set (e.g. UTF-8) – 1+126 bytes → 4+n bytes – Compression, TOAST https://www.2ndQuadrant.com FOSDEM Brussels, 2020-02-02 What is Text Search? ● Information retrieval → Text retrieval ● Search on metadata – Descriptive, bibliographic, tags, etc. – Discovery & identification ● Search on parts of the text – Matching – Substring search – Data extraction, cleaning, mining https://www.2ndQuadrant.com FOSDEM Brussels, 2020-02-02 Text search operators in PostgreSQL ● LIKE, ILIKE (~~, ~~*) ● ~, ~* (POSIX regex) ● regexp_match(string text, pattern text) ● But are SQL/regular expressions enough? – No ranking of results – No concept of language – Cannot be indexed ● Okay okay, can be somewhat indexed* ● SIMILAR TO → best forget about this one https://www.2ndQuadrant.com FOSDEM Brussels, 2020-02-02 What is Full Text Search (FTS)? ● Information retrieval → Text retrieval → Document retrieval ● Search on words (on tokens) in a database (all documents) ● No index → Serial search (e.g.
    [Show full text]
  • A Diachronic Treebank of Russian Spanning More Than a Thousand Years
    Proceedings of the 12th Conference on Language Resources and Evaluation (LREC 2020), pages 5251–5256 Marseille, 11–16 May 2020 c European Language Resources Association (ELRA), licensed under CC-BY-NC A Diachronic Treebank of Russian Spanning More Than a Thousand Years Aleksandrs Berdicevskis1, Hanne Eckhoff2 1Språkbanken (The Swedish Language Bank), Universify of Gothenburg 2Faculty of Medieval and Modern Languages, University of Oxford [email protected], [email protected] Abstract We describe the Tromsø Old Russian and Old Church Slavonic Treebank (TOROT) that spans from the earliest Old Church Slavonic to modern Russian texts, covering more than a thousand years of continuous language history. We focus on the latest additions to the treebank, first of all, the modern subcorpus that was created by a high-quality conversion of the existing treebank of contemporary standard Russian (SynTagRus). Keywords: Russian, Slavonic, Old Church Slavonic, treebank, diachrony, conversion and a richer inventory of syntactic relation labels. 1. Introduction Secondary dependencies are used to indicate external The Tromsø Old Russian and OCS Treebank (TOROT, subjects, for example in control structures, and to indicate Eckhoff and Berdicevskis 2015) has been available in shared dependents, for example in structures with various releases since its beginnings in 2013, and its East coordinated verbs. Empty nodes are allowed to give more Slavonic part now contains approximately 230K words.1 information on elliptic structures and asyndetic This paper describes the TOROT 20200116 release,2 which coordination. The empty nodes are limited to verbs and adds a conversion of the SynTagRus treebank. Former conjunctions, the scheme does not allow empty nominal TOROT releases consisted of Old East Slavonic and nodes.
    [Show full text]
  • Download in the Conll-Format and Comprise Over ±175,000 Tokens
    Integrated Sequence Tagging for Medieval Latin Using Deep Representation Learning Mike Kestemont1, Jeroen De Gussem2 1 University of Antwerp, Belgium 2 Ghent University, Belgium *Corresponding author: [email protected] Abstract In this paper we consider two sequence tagging tasks for medieval Latin: part-of-speech tagging and lemmatization. These are both basic, yet foundational preprocessing steps in applications such as text re-use detection. Nevertheless, they are generally complicated by the considerable orthographic variation which is typical of medieval Latin. In Digital Classics, these tasks are traditionally solved in a (i) cascaded and (ii) lexicon-dependent fashion. For example, a lexicon is used to generate all the potential lemma-tag pairs for a token, and next, a context-aware PoS-tagger is used to select the most appropriate tag-lemma pair. Apart from the problems with out-of-lexicon items, error percolation is a major downside of such approaches. In this paper we explore the possibility to elegantly solve these tasks using a single, integrated approach. For this, we make use of a layered neural network architecture from the field of deep representation learning. keywords tagging, lemmatization, medieval Latin, LSTM, deep learning INTRODUCTION Latin —and its historic variants in particular— have long been a topic of major interest in Natural Language Processing [Piotrowksi 2012]. Especially in the community of Digital Humanities, the automated processing of Latin texts has always been a popular research topic. In a variety of computational applications, such as text re-use detection [Franzini et al, 2015], it is desirable to annotate and augment Latin texts with useful morpho-syntactical or lexical information, such as lemmas.
    [Show full text]
  • Lemmagen: Multilingual Lemmatisation with Induced Ripple-Down Rules
    Journal of Universal Computer Science, vol. 16, no. 9 (2010), 1190-1214 submitted: 21/1/10, accepted: 28/4/10, appeared: 1/5/10 © J.UCS LemmaGen: Multilingual Lemmatisation with Induced Ripple-Down Rules MatjaˇzJurˇsiˇc (Joˇzef Stefan Institute, Ljubljana, Slovenia [email protected]) Igor Mozetiˇc (Joˇzef Stefan Institute, Ljubljana, Slovenia [email protected]) TomaˇzErjavec (Joˇzef Stefan Institute, Ljubljana, Slovenia [email protected]) Nada Lavraˇc (Joˇzef Stefan Institute, Ljubljana, Slovenia and University of Nova Gorica, Nova Gorica, Slovenia [email protected]) Abstract: Lemmatisation is the process of finding the normalised forms of words appearing in text. It is a useful preprocessing step for a number of language engineering and text mining tasks, and especially important for languages with rich inflectional morphology. This paper presents a new lemmatisation system, LemmaGen, which was trained to generate accurate and efficient lemmatisers for twelve different languages. Its evaluation on the corresponding lexicons shows that LemmaGen outperforms the lemmatisers generated by two alternative approaches, RDR and CST, both in terms of accuracy and efficiency. To our knowledge, LemmaGen is the most efficient publicly available lemmatiser trained on large lexicons of multiple languages, whose learning engine can be retrained to effectively generate lemmatisers of other languages. Key Words: rule induction, ripple-down rules, natural language processing, lemma- tisation Category: I.2.6, I.2.7, E.1 1 Introduction Lemmatisation is a valuable preprocessing step for a large number of language engineering and text mining tasks. It is the process of finding the normalised forms of wordforms, i.e. inflected words as they appear in text.
    [Show full text]
  • Language Technology Meets Documentary Linguistics: What We Have to Tell Each Other
    Language technology meets documentary linguistics: What we have to tell each other Language technology meets documentary linguistics: What we have to tell each other Trond Trosterud Giellatekno, Centre for Saami Language Technology http://giellatekno.uit.no/ . February 15, 2018 . Language technology meets documentary linguistics: What we have to tell each other Contents Introduction Language technology for the documentary linguist Language technology for the language society Conclusion . Language technology meets documentary linguistics: What we have to tell each other Introduction Introduction I Giellatekno: started in 2001 (UiT). Research group for language technology on Saami and other northern languages Gramm. modelling, dictionaries, ICALL, corpus analysis, MT, ... I Trond Trosterud, Lene Antonsen, Ciprian Gerstenberger, Chiara Argese I Divvun: Started in 2005 (UiT < Min. of Local Government). Infrastructure, proofing tools, synthetic speech, terminology I Sjur Moshagen, Thomas Omma, Maja Kappfjell, Børre Gaup, Tomi Pieski, Elena Paulsen, Linda Wiechetek . Language technology meets documentary linguistics: What we have to tell each other Introduction The most important languages we work on . Language technology meets documentary linguistics: What we have to tell each other Language technology for the documentary linguist Language technology for documentary linguistics ... Language technology meets documentary linguistics: What we have to tell each other Language technology for the documentary linguist ... what’s in it for the language community I work for? I Let’s pretend there are two types of language communities: 1. Language communities without plans for revitalisation or use in domains other than oral use 2. Language communities with such plans . Language technology meets documentary linguistics: What we have to tell each other Language technology for the documentary linguist Language communities without such plans I Gather empirical material and do your linguistic analysis I (The triplet: Grammar, text collection and dictionary) I ..
    [Show full text]
  • A 500 Million Word POS-Tagged Icelandic Corpus
    A 500 Million Word POS-Tagged Icelandic Corpus Thomas Eckart1, Erla Hallsteinsdóttir², Sigrún Helgadóttir³, Uwe Quasthoff1, Dirk Goldhahn1 1Natural Language Processing Group, University of Leipzig, Germany ² Department of Language and Communication, University of Southern Denmark, Odense, Denmark ³ The Árni Magnússon Institute for Icelandic Studies, Reykjavík, Iceland Email: {teckart, quasthoff, dgoldhahn}@informatik.uni-leipzig.de, [email protected], [email protected] Abstract The new POS-tagged Icelandic corpus of the Leipzig Corpora Collection is an extensive resource for the analysis of the Icelandic language. As it contains a large share of all Web documents hosted under the .is top-level domain, it is especially valuable for investigations on modern Icelandic and non-standard language varieties. The corpus is accessible via a dedicated web portal and large shares are available for download. Focus of this paper will be the description of the tagging process and evaluation of statistical properties like word form frequencies and part of speech tag distributions. The latter will be in particular compared with values from the Icelandic Frequency Dictionary (IFD) Corpus. Keywords: Corpus Creation, Part-of-Speech Tagging, Grammar and Syntax 1. History of the Icelandic Corpus Larger Icelandic corpora have been part of the Leipzig Corpora Collection (LCC) since 2005. The aim of the project is to generate large monolingual corpora based on various material of different genre, where the biggest resources are Web texts provided by the National and University Library of Iceland from autumn 2005 and autumn 2010 (approx. 33 million sentences). Moreover, additional newspaper texts (2 million sentences) and the complete Icelandic Wikipedia is included.
    [Show full text]