DOCSLIB.ORG

Constraint Grammar Parsing with Left and Right Sequential Finite

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Constraint Grammar Parsing with Left and Right Sequential Finite Constraint Grammar parsing with left and right sequential finite transducers Mans Hulden University of Helsinki [email protected] Abstract ten times faster operation, although at the cost of a loss in accuracy. We propose an approach to parsing Con- In this paper, we describe a process of compil- straint Grammars using finite-state transduc- ing individual CG rules into finite-state transducers ers and report on a compiler that converts Con- straint Grammar rules into transducer repre- (FSTs) that perform the corresponding disambigua- sentations. The resulting transducers are fur- tion task on an ambiguous input sentence. Using ther optimized by conversion to left and right this approach, we can improve the worst-case run- sequential transducers. Using the method, ning time of a CG parser to quadratic in the length we show that we can improve on the worst- of a sentence, down from the cubic time requirement case asymptotic bound of Constraint Gram- reported earlier (Tapanainen, 1999). The method mar parsing from cubic to quadratic in the presented here implements faithfully all the oper- length of input sentences. ations allowed in the CG-2 system documented in Tapanainen (1996). The same approach can be used 1 Introduction for various extensions and variants of the Constraint Grammar paradigm. The Constraint Grammar (CG) paradigm (Karlsson, The idea of representing CG rules as FSTs has 1990) is a popular formalism for performing part- been suggested before (Karttunen, 1998), but to of-speech disambiguation, surface syntactic tagging, our knowledge this implementation represents the and certain forms of dependency analysis. A CG first time the idea has been tried in practice.1 We is a collection of hand-written disambiguation rules also show that after compiling a collection of CG for part-of-speech or syntactic functions. The popu- rules into their equivalent FSTs, the individual trans- larity of CGs is explained by a few factors. They ducers can further be converted into left and right typically achieve quite high F-measures on unre- sequential transducers which greatly improves the stricted text, especially for free word-order lan- speed of application of a rule. guages (Chanod and Tapanainen, 1995; Samuelsson In the following, we give a brief overview of and Voutilainen, 1997). Constraint Grammars can the CG formalism, discuss previous work and CG also be developed by linguists rather quickly, even parsers, provide an account of our method, and fi- for languages that have only meager resources avail- nally report on some practical experiments in com- able as regards tagged or parsed corpora, although piling large-scale grammars into FSTs with our CG- it is hard to come by exact measures of how much rule-to-transducer compiler. effort development requires. One drawback to using CG, however, is that applying one to disambiguate 2 Constraint Grammar parsers input text tends to be very slow: for example, the Apertium project (Forcada et al., 2009), which of- A Constraint Grammar parser occupies the central fers the option of using both n-gram models and CG role of a system in the CG framework. A CG system (by way of the vislcg3 compiler (Bick, 2000)), re- 1However, Peltonen (2011) has recently implemented a sub- ports that using n-gram models currently results in set of CG-2 as FSTs using a different method. 39 Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing, pages 39–47, Blois (France), July 12-15, 2011. c 2011 Association for Computational Linguistics is usually intended to produce part-of-speech tag- tions, and BARRIER specifications. For example, a ging and surface syntactic tagging from unrestricted more complete rule such as: text. Generally, the text to be processed is first tok- "<word>" REMOVE (X) IF enized and subjected to morphological analysis, pos- (*1 A BARRIER C LINK *1 B BARRIER C); sibly by external tools, producing an output where would remove the tag X for the word-form word if words are marked with ambiguous, alternative read- the first tag A were followed by a B somewhere to ings. This output is then passed as input to a CG the right, and there was no C before the B, except if parser component. Figure 1 (left) shows an exam- the first A-tagged reading also contained C. ple of intended input to a CG parser where each in- It is also possible to add and modify tags to co- dented line following a lemma represents an alterna- horts using ADD and MAP operations, which work tive morphological and surface syntactic reading of exactly as the SELECT and REMOVE operations as that lemma; an entire group of alternative readings, regards the contextual target specification. such as the five readings for the word people in the figure is called a cohort. Figure 1 (right) shows the 2.2 Parser operation desired output of a CG disambiguator: each cohort Given a collection of CG rules, the job of the parser has been reduced to contain only one reading. is to apply each rule to the set of input cohorts rep- resenting an ambiguous sentence as in Figure 1, and 2.1 Constraint grammar rules remove or select readings as the rule dictates. The A CG parser operates by removing readings, or by formalism specifies no particular rule ordering per selecting readings (removing the others) according se, and different implementations of the CG formal- to a set of CG rules. In its standard form there ism apply rules in varying orders (Bick, 2000). In exists only these two types of rules (SELECT and this respect, it is up to the grammar writer to design REMOVE). How the rules operate is further condi- the rules so that they operate correctly no matter in tioned by constraints that dictate in which environ- what order they are called upon. The parser iter- ment a rule is triggered. A simple CG rule such as: ates rule application and removes readings until no rule can perform any further disambiguation, or un- REMOVE (V) IF (NOT *-1 sub-cl-mark) (1C (VFIN)) ; til each cohort contains only one reading. Naturally, since no rule order is explicit, most parser imple- would remove all readings that contain the tag V, if mentations (Tapanainen, 1996; Bick, 2000) tend to there (a) is no subordinate clause mark anywhere to use complex techniques to predict if a certain rule the left (indicated by the rule scope (NOT 1), and ∗− can apply at all to avoid the costly process of check- (b) the next cohort to the right contains the tag VFIN ing each reading and its respective contexts in an in- in all its readings (signaled by 1C (VFIN)). Such a put sentence against a rule for possible removal or rule would, for instance, disambiguate the word peo- selection. ple in the example sentence in Figure 1, removing all other readings except the noun reading. Rules can 2.3 Computational complexity also refer to the word-forms or the lemmas in their Tapanainen (1999) gives the following complexity environments. Traditionally, the word-forms are analysis for his CG-2 parsing system. Assume that quoted while the lemmas are enclosed in brackets a sentence of length n contains maximally k differ- and quotation marks (as in ‘‘<counselors>’’ ent readings of a token, and is to be disambiguated vs. ‘‘counselor’’ in fig. 1). by a grammar consisting of G rules. Then, testing In the example above, only morphological tags whether to keep or discard a reading with respect to a are being used, but the same formalism of con- single rule can be done in O(nk), with respect to all straints is often used to disambiguate additional, rules, in O(Gnk), and with respect to all rules and syntactically motivated tags as well, including tags all tokens in O(n2Gk). Now, in the worst case, ap- that mark phrases and dependencies (Tapanainen, plying all rules to all alternative readings only results 1999; Bick, 2000). Additional features in the rule in the discarding of a single reading. Hence, the pro- formalism include LINK contexts, Boolean opera- cess must in some cases be repeated n(k 1) times, − 40 "<Business>" "<Business>" "business" <*> N NOM SG "business" <*> N NOM SG "<people>" "<people>" "people" N NOM SG/PL "people" N NOM SG/PL "people" V PRES -SG3 VFIN "<can>" "people" V IMP VFIN "can" V AUXMOD Pres VFIN "people" V SUBJUNCTIVE VFIN "<play>" "people" V INF "play" V INF "<can>" "<a>" "can" V AUXMOD Pres VFIN "a" <Indef> DET CENTRAL ART SG "<role>" "<play>" "role" <Count> N NOM SG "play" N NOM SG "<as>" "play" V PRES -SG3 VFIN "as" PREP "play" V IMP VFIN "<counselors>" "play" V SUBJUNCTIVE VFIN "counselor" <DER:or> <Count> N NOM PL "play" V INF "<and>" "<a>" "and" CC "a" <Indef> DET CENTRAL ART SG "<teachers>" "<role>" "teacher" <DER:er> <Count> N NOM PL "role" <Count> N NOM SG "<.>" "<as>" "." PUNCT Pun "as" ADV AD-A> "as" <**CLB> CS "as" PREP "<counselors>" "counselor" <DER:or> <Count> N NOM PL "<and>" "and" CC "<teachers>" "teacher" <DER:er> <Count> N NOM PL "<.>" "." PUNCT Pun Figure 1: Example input (left) and output (right) from a Constraint Grammar disambiguator. yielding a total complexity of O(n3Gk2). As men- linking constraints; secondly, TBL rules target tags, tioned above there are various heuristics one can use not words, while CG allows for rules to target any to avoid blindly testing rules against readings where mix of both; thirdly, TBL rules only replace single they cannot apply, but none that guarantee a lower tags with other single tags and do not remove tags complexity. from sets of alternative tags.2 Additionally, Koskenniemi (1990); Koskenniemi 3 Related work et al.
Load more

Recommended publications
  • Annotation Schemes in North Sami Dependency Parsing
    Annotation schemes in North Sámi dependency parsing Mariya Sheyanova Fundamental and Applied Linguistics Higher School of Economics Moscow, Russia [email protected] Francis M. Tyers Giela ja kultuvrra instituhtta UiT Norgga árktalaš universitehta N-9018 Romsa, Norway [email protected] Abstract In this paper we describe a comparison of two annotation schemes for de- pendency parsing of North Sámi, a Finno-Ugric language spoken in the north of Scandinavia and Finland. The two annotation schemes are the Giellatekno (GT) scheme which has been used in research and applications for the Sámi languages and Universal Dependencies (UD) which is a cross-lingual scheme aiming to unify annotation stations across languages. We show that we are able to deterministi- cally convert from the Giellatekno scheme to the Universal Dependencies scheme without a loss of parsing performance. While we do not claim that either scheme is a priori a more adequate model of North Sámi syntax, we do argue that the choice of annotation scheme is dependent on the intended application. This work is licensed under a Creative Commons Attribution–NoDerivatives 4.0 International Licence. Licence details: http://creativecommons.org/licenses/by-nd/4.0/ 1 66 The 3rd International Workshop for Computational Linguistics of Uralic Languages, pages 66–75, St. Petersburg, Russia, 23–24 January 2017. c 2017 Association for Computational Linguistics 1 Introduction Dependency parsing is an important step in many applications of natural language processing, such as information extraction, machine translation, interactive language learning and corpus search interfaces. There are a number of approaches to depen- dency parsing.
    [Show full text]
  • Word Classes and Part-Of-Speech 5 Tagging
    Speech and Language Processing: An introduction to speech recognition, computational linguistics and natural language processing. Daniel Jurafsky & James H. Martin. Copyright c 2006, All rights reserved. Draft of July 30, 2007. Do not cite without permission. WORD CLASSES AND PART-OF-SPEECH 5 TAGGING Conjunction Junction, what’s your function? Bob Dorough, Schoolhouse Rock, 1973 A gnostic was seated before a grammarian. The grammarian said, ‘A word must be one of three things: either it is a noun, a verb, or a particle.’ The gnostic tore his robe and cried, “Alas! Twenty years of my life and striving and seeking have gone to the winds, for I laboured greatly in the hope that there was another word outside of this. Now you have destroyed my hope.’ Though the gnostic had already attained the word which was his purpose, he spoke thus in order to arouse the grammarian. Rumi (1207–1273), The Discourses of Rumi, Translated by A. J. Arberry Dionysius Thrax of Alexandria (c. 100 B.C.), or perhaps someone else (exact au- thorship being understandably difficult to be sure of with texts of this vintage), wrote a grammatical sketch of Greek (a “techne¯”) which summarized the linguistic knowl- edge of his day. This work is the direct source of an astonishing proportion of our modern linguistic vocabulary, including among many other words, syntax, diphthong, PARTS­OF­SPEECH clitic, and analogy. Also included are a description of eight parts-of-speech: noun, verb, pronoun, preposition, adverb, conjunction, participle, and article. Although ear- lier scholars (including Aristotle as well as the Stoics) had their own lists of parts-of- speech, it was Thrax’s set of eight which became the basis for practically all subsequent part-of-speech descriptions of Greek, Latin, and most European languages for the next 2000 years.
    [Show full text]
  • Analysing Constraint Grammar with SAT I L
    T D L P Analysing Constraint Grammar with SAT I L Department of Computer Science and Engineering C U T U G Gothenburg, Sweden 2016 Analysing Constraint Grammar with SAT I L © Inari Listenmaa, 2016. Technical Report 154L ISSN 1652-876X Research groups: Functional Programming / Language Technology Department of Computer Science and Engineering C U T U G SE-412 96 Gothenburg Sweden Telephone +46 (0)31-772 1000 Typeset in Palatino and Monaco by the author using X TE EX Printed at Chalmers Gothenburg, Sweden 2016 Abstract Constraint Grammar (CG) is a robust and language-independent formalism for part-of-speech tagging and shallow parsing. A grammar consists of disambiguation rules for initially am- biguous, morphologically analysed text: the correct analysis for the sentence is attained by removing improper readings from ambiguous words. Wide-coverage Constraint Grammars, containing some thousands of rules, generally achieve very high accuracy for free text: thanks to the flexible formalism, new rules can be written to address even the rarest phenomena, without compromising the general tendencies. Even with a smaller set of rules, CG-based taggers have been competetive with statistical taggers. In addition, CG has been used in more experimental settings: dependency syntax, dialogue system for language learning and anaphora resolution. This thesis presents two contributions to the study of CG. Firstly, we model a parallel variant of CG as a Boolean satisfiability (SAT) problem, and implement a CG-engine by using a SAT-solver. This is attractive for several reasons: formal logic is well-studied, and serves as an abstract language to reason about the properties of CG.
    [Show full text]
  • When Grammar Can't Be Trusted
    Department of Language and Culture (ISK) When grammar can’t be trusted - Valency and semantic categories in North Sámi syntactic analysis and error detection — Linda Wiechetek A dissertation for the degree of Philosophiae Doctor – December 2017 When grammar can’t be trusted - Valency and semantic categories in North Sámi syntactic analysis and error detection Linda Wiechetek A dissertation for the degree of Philosophiae Doctor Department of Language and Culture (ISK) December 2017 Für meine Eltern & buot sámegiela oahpahalliide Contents I Beginning 3 1 Introduction 7 2 Background and methodology 13 2.1 Theoretical background: Valency theory . 14 2.1.1 Syntactic valency . 16 2.1.1.1 Obligatoriness . 17 2.1.1.2 Syntactic tests . 19 2.1.2 Selection restrictions and semantic prototypes . 21 2.1.3 Semantic valency . 23 2.1.3.1 Semantic roles vs. syntactic functions . 24 2.1.3.2 Semantic roles vs. referential semantics . 25 2.1.4 Semantic verb classes . 25 2.1.5 Criteria for potential governors . 27 2.2 Valency theory in Sámi research . 28 2.2.1 Case and valency . 28 2.2.2 Rection and valency . 30 2.2.3 Transitivity and valency . 32 2.2.4 Syntactic valency . 34 2.2.5 Governors . 35 2.2.6 Selection restrictions . 36 2.2.7 Semantic valency . 38 2.3 Human-readable and machine-readable valency resources . 42 2.3.1 Human-readable valency resources . 42 2.3.2 Machine-readable valency resources . 43 2.4 Methodology and framework . 46 2.4.1 Methodology . 46 2.4.2 Framework . 50 2.4.2.1 The Constraint Grammar formalism .
    [Show full text]
  • A Constraint Grammar Parser for Spanish
    Proceedings of the International Joint Conference IBERAMIA/SBIA/SBRN 2006 - 4th Workshop in Information and Human Language Technology (TIL’2006), Ribeir˜aoPreto, Brazil, October 23–28, 2006. CD-ROM. ISBN 85-87837-11-7 A Constraint Grammar Parser for Spanish Eckhard Bick Institute of Language and Communication, University of Southern Denmark [email protected] Abstract. In this paper we describe and evaluate a Constraint Grammar parser for Spanish, HISPAL. The parser adopts the modular architecture of the Portuguese PALAVRAS parser, and in a novel porting approach, the linguist- written Portuguese CG rules for morphological and syntactic disambiguation were ªcorrectedº and appended for Spanish in a corpus-based fashion, rather than rewritten from scratch. As part of the 5 year project, a 74.000 lexeme lexicon was developed, as well as a morphological analyzer and semantic ontology for Spanish. An evaluation of the the system©s tagger/parser modules indicated F-scores of 99% for part-of-speech tagging and 96% for syntactic function assignment. HISPAL has been used for the grammatical annotation of 52 million words of text, including the Europarl and Wikipedia text collections. Keywords: Spanish parser, Constraint Grammar, NLP, Corpus annotation 1 Introduction As results for several languages have shown (e.g. English [7], Portuguese [3], French [5], Danish [4] and Norwegian [6]), Constraint Grammar (CG) based NLP systems can achieve a high level of robustness and accuracy in the annotation of running text. However, as rule-based systems, they normally demand not only a full lexicon-based morphological analysis as input, but also a large linguist-written disambiguation grammar.
    [Show full text]
  • Finnpos: an Open-Source Morphological Tagging and Lemmatization Toolkit for Finnish
    Noname manuscript No. (will be inserted by the editor) FinnPos: An Open-Source Morphological Tagging and Lemmatization Toolkit for Finnish Miikka Silfverberg · Teemu Ruokolainen · Krister Lindén · Mikko Kurimo the date of receipt and acceptance should be inserted later Abstract This paper describes FinnPos, an open-source morphological tagging and lemmatization toolkit for Finnish. The morphological tagging model is based on the averaged structured perceptron classifier. Given training data, new taggers are esti- mated in a computationally efficient manner using a combination of beam search and model cascade. The lemmatization is performed employing a combination of a rule-based morphological analyzer, OMorFi, and a data-driven lemmatization model. The toolkit is readily applicable for tagging and lemmatization of running text with models learned from the recently published Finnish Turku Dependency Treebank and FinnTreeBank. Empirical evaluation on these corpora shows that FinnPos performs favorably compared to reference systems in terms of tagging and lemmatization ac- curacy. In addition, we demonstrate that our system is highly competitive with regard to computational efficiency of learning new models and assigning analyses to novel sentences. Keywords Morphological tagging · Data-driven lemmatization · Averaged perceptron · Finnish · Open-source M. Silfverberg ( ) · K. Lindén University of Helsinki, Helsinki, Finland M. Silfverberg E-mail: mpsilfve@iki.fi T. Ruokolainen · M. Kurimo Aalto University, Helsinki, Finland 2 Miikka Silfverberg et al. 1 Introduction This paper presents FinnPos, an open-source morphological tagging and lemmati- zation toolkit for Finnish. Our work stems from the recently published Turku De- pendency Treebank (Haverinen et al, 2009, 2014) and FinnTreeBank (Voutilainen, 2011). The Turku Dependency Treebank has been prepared by manually correcting the output of an automatic annotation process, whereas the FinnTreeBank has been prepared completely manually.
    [Show full text]
  • Morphosyntactic Disambiguation in an Endangered Language Setting
    Morphosyntactic Disambiguation in an Endangered Language Setting Jeff Ens♠ Mika Ham¨ al¨ ainen¨ ♦ Jack Rueter♦ Philippe Pasquier♠ ♠ School of Interactive Arts & Technology, Simon Fraser University ♦ Department of Digital Humanities, University of Helsinki [email protected], [email protected], [email protected], [email protected] Abstract available in the infrastructure, as they are not free Endangered Uralic languages present a of errors (Ham¨ al¨ ainen¨ et al., 2018; Ham¨ al¨ ainen,¨ high variety of inflectional forms in their 2018). morphology. This results in a high num- This paper presents a method to learn the mor- ber of homonyms in inflections, which in- phosyntax of a language on an abstract level by troduces a lot of morphological ambigu- learning patterns of possible morphologies within ity in sentences. Previous research has sentences. The resulting models can be used employed constraint grammars to address to evaluate the existing rule-based disambigua- this problem, however CGs are often un- tors, as well as to directly disambiguate sentences. able to fully disambiguate a sentence, and Our work focuses on the languages belonging to their development is labour intensive. We the Finno-Permic language family: Finnish (fin), present an LSTM based model for auto- Northern Sami (sme), Erzya (myv) and Komi- matically ranking morphological readings Zyrian (kpv). The vitality classification of the of sentences based on their quality. This three latter languages is definitely endangered ranking can be used to evaluate the exist- (Moseley, 2010). ing CG disambiguators or to directly mor- phologically disambiguate sentences. Our 2 Motivation approach works on a morphological ab- There are two main factors motivating this re- straction and it can be trained with a very search.
    [Show full text]
  • Arxiv:2105.12428V1 [Cs.CL] 26 May 2021
    Neural Morphology Dataset and Models for Multiple Languages, from the Large to the Endangered Mika Hämäläinen, Niko Partanen, Jack Rueter and Khalid Alnajjar Faculty of Arts University of Helsinki [email protected] Abstract machine translation (Pirinen et al., 2017). The transducers are also in constant use in several We train neural models for morpholog- real world applications such as online dictionar- ical analysis, generation and lemmatiza- ies (Rueter and Hämäläinen, 2019), spell check- tion for morphologically rich languages. ers (Trosterud and Moshagen, 2021), online cre- We present a method for automatically ative writing tools (Hämäläinen, 2018), automated extracting substantially large amount of news generation (Alnajjar et al., 2019), language training data from FSTs for 22 languages, learning tools (Antonsen and Argese, 2018) and out of which 17 are endangered. The neu- documentation of endangered languages (Gersten- ral models follow the same tagset as the berger et al., 2017; Wilbur, 2018). As an ad- FSTs in order to make it possible to use ditional important application we can mention them as fallback systems together with the the wide use of FSTs in the creation of Uni- FSTs. The source code1, models2 and versal Dependencies treebanks for low-resource datasets3 have been released on Zenodo. languages, at least with Erzya (Rueter and Ty- 1 Introduction ers, 2018), Northern Saami (Tyers and Sheyanova, 2017) Karelian (Pirinen, 2019a) and Komi-Zyrian Morphology is a powerful tool for languages to (Partanen et al., 2018). form new words out of existing ones through in- Especially in the context of endangered lan- flection, derivation and compounding.
    [Show full text]
  • Natural Language Parsing with Graded Constraints
    Natural Language Parsing with Graded Constraints Dissertation zur Erlangung des Doktorgrades am Fachbereich Informatik der Universität Hamburg vorgelegt von Ingo Schröder aus Uelzen Hamburg im Jahr 2002 Genehmigt vom Fachbereich Informatik der Universität Hamburg auf Antrag von Betreuer: Prof. Dr.-Ing. Wolfgang Menzel Fachbereich Informatik Universität Hamburg 2. Gutachter: Prof. Dr. Christopher Habel Fachbereich Informatik Universität Hamburg Externe Gutachterin: Prof. Mary P. Harper, Ph.D. School of Electrical and Computer Engineering Purdue University, IN, USA Hamburg, den 15. April 2002 Dekan Prof. Dr. Siegfried Stiehl Dedicated to my mother Ursula Schröder Abstract Based on the working hypothesis that gradation is a central phenomenon in natural language, this thesis proposes the grammar formalism of weighted constraint dependency grammars (WCDG) as a unified framework for the treatment of gradation. Gradation can be found in different forms in natural language: as a preference for one outcome over another or as an extended notion of grammaticality which accepts not only `well-formed' sentences but also deviant structures if no other analysis is feasible. It also occurs in inherently uncertain information such as that from automatic recognition of speech or blurred hand-writing. WCDGs not only offer a well-defined formalism to concisely express what the underlying con- straints of natural language understanding are but additionally allow one to state which status a constraint has, be it a strict rule which describes what structures are possibly imaginable or be it a slight preference which only selects the preferred one among a set of ambiguous analyses for a sentence. The formalism of WCDGs is formally defined both syntactically by specifying the constraint language and semantically by providing a concise mapping from the WCDG parsing problem to the well-known class of constraint satisfaction optimization problems.
    [Show full text]
  • CG3 Beyond Classical Constraint Grammar
    CG-3 - Beyond Classical Constraint Grammar Eckhard Bick Tino Didriksen University of Southern Denmark GrammarSoft ApS [email protected] [email protected] Abstract genre, but in programming terms, it is implemented procedurally as a set of This paper discusses methodological consecutively iterated rules that add, remove or strengths and shortcomings of the select tag-encoded information. In its classical Constraint Grammar paradigm (CG), form (Karlsson, 1990; Karlsson et al., 1995), showing how the classical CG formalism Constraint Grammar relies on a morphological can be extended to achieve greater analyzer providing so-called cohorts of possible expressive power and how it can be readings for a given word, and uses constraints enhanced and hybridized with techniques that are largely topological1 in nature, for both from other parsing paradigms. We present part-of-speech disambiguation and the a new, largely theory-independent CG assignment of syntactic function tags. (a-c) framework and rule compiler (CG-3), that provide examples for close context (a) and wide allows the linguist to write CG rules context (b) POS rules, and syntactic mapping (c). incorporating different types of linguistic information and methodology from a wide (a) REMOVE VFIN IF (0 N) (-1 ART OR range of parsing approaches, covering not <poss> OR GEN); remove a finite verb reading only CG©s native topological technique, if self (0) can also be a noun (N), and if there is but also dependency grammar, phrase an article (ART), possessive (<poss>) or structure grammar and unification genitive (GEN) 1 position left (-1). grammar. In addition, we allow the (b) SELECT VFIN IF (NOT *1 VFIN) (*-1C integration of statistical-numerical CLB-WORD BARRIER VFIN); select a finite constraints and non-discrete tag and string verb reading, if there is no other finite verb sets.
    [Show full text]
  • Applying Constraint Grammar to Tibetan NLP Edward Garrett & Nathan Hill
    Applying Constraint Grammar to Tibetan NLP Edward Garrett & Nathan Hill Project website: http://larkpie.net/tibetancorpus/ Workflow – Some rules Workflow – Flagging the rule Workflow – Flagging the rule Workflow – Fixing the rule Workflow – Fixing the rule Workflow – Fixing the rule Workflow – Fixing the rule Workflow – Fixing the rule Regex rules The regex tagger consists of a sequence of rules, applied in order to a horizontal text. Each rule consists of two parts, the pattern (before the < symbol) and the replacement (after the < symbol). In horizontal format, a single space marks the boundary between words, and line breaks separate sentences. Each word consists of a word form followed by a tag, with the pipe character in between. Whitespace is not permitted within words. ར་|[case.term][cv.term][dunno][n.count][skt] བs་|[n.count][v.fut][v.fut.v.pres][v.imp][v.pres] ནས་|[case.ela] [cv.ela][dunno][n.mass] ཡབ་|[n.count][v.fut] kི་|[case.gen][cv.cont][cv.gen] ཞལ་ཆེམས་|[n.count] བཞིན་|[n.count] [n.rel] ཕ་uལ་|[n.count] b|[n.count] ས་|[case.agn][cv.agn][dunno][n.count][n.mass][n.rel][skt] འཛན་|[v.pres] d་| [case.term][cv.term] འjག་པ|[n.v.fut.n.v.pres][n.v.pres] ར་|[case.term][cv.term][dunno][n.count][skt] u་| [n.count][v.fut][v.fut.v.pres][v.imp][v.past][v.past.v.pres][v.pres] bས་པ|[n.v.past] ས|[case.agn][n.count][n.rel] །| [punc] Regex rules Regex rules Regex rules Regex rules – summary Within short order, it became evidence that updating and maintaining regex rules would require a regular expressions wizard with a keen eye for slashes.
    [Show full text]
  • Solving Translational Problems Through Constraint Grammar - a Practical Case Study of Possession Homographs
    Liv Molich Bachelor thesis (20 ECTS), January 10th 2019 Department of Language, Literature & Media Institute of Culture, Language & History Ilisimatusarfik, University of Greenland Solving translational problems through constraint grammar - a practical case study of possession homographs Supervisor: Karen Langgård Character count: 71,218 Liv Molich Department of Language, Literature & Media Institute of Culture, Language & History Ilisimatusarfik, University of Greenland Introduction 4 Hypothesis 6 Outline 6 Materials and methods 7 Corpora 7 The parser (GCG) 8 Methods 11 Part I: Disambiguation in theory 13 Possession in Greenlandic 13 Head and dependent marking, and implicit or explicit possessor 14 The inflectional system of Greenlandic 16 Syncretism 16 Semantics 18 Using context to unravel the syntax and disambiguate the possessives 19 How 1st, 2nd and 3rd persons differ 24 Coordination can clarify the meaning 26 NIQ is a special case 28 Summary of part I 28 Part II: Disambiguation in practice 30 Local level rules for the GCG based on the morphological tagging 30 Global level rules for the GCG based on the morphological tagging 36 Rules for the GCG based on the syntactic roles 38 Summary of part II 39 2 Liv Molich Department of Language, Literature & Media Institute of Culture, Language & History Ilisimatusarfik, University of Greenland Part III: Proof checking and discussion 41 Proof checking the rules on regression corpus 41 Proof checking on extended corpus 41 Discussion 43 Conclusion 45 Literature 47 Appendix I: The tag set 52 Word
    [Show full text]