Quick Grammar Type Recognition: Concepts and Techniques
|
|
- Adela Simpson
- 6 years ago
- Views:
Transcription
1 Quick Grammar Type Recognition: Concepts and Techniques Amin Milani Fard +, Arash Deldari *, and Hossein Deldari + + Department of Computer Engineering, Ferdowsi University, Mashhad, Iran * Department of Computer Engineering, Sadjad University, Mashhad, Iran milanifard@stu-mail.um.ac.ir Abstract. This paper intends to give an overview to grammar classification in terms of language specification and parsing methods; an important and always fashionable topic in computer science, compilers and language processing area. It is known that when a conflict happens in constructing the parsing table, the grammar is not acceptable by that parsing method, however we are interested in quick ways to determine a given grammar type. Although so many papers and books have been published containing useful information about this matter, none of them covers all the recognition aspects of grammars especially quick methods. We finalized the work with our quick grammar recognizer algorithm to detect grammar type. 1 Introduction In computer science, parsing is the process of analyzing a sequence of tokens in order to determine its grammatical structure with respect to a given formal grammar. Parsing process, formally known as syntax analysis, transforms input text into a data structure, usually a tree, which is suitable for later processing. Generally, parsers operate in two stages, first identifying the meaningful tokens in the input, and then building a parse tree from those tokens. The task of the parser is essentially to determine if and how the input can be derived from the start symbol within the rules of the formal grammar. 2 Language Specifications The concepts and terminology for describing the syntax of languages is taken from Noam Chomsky s works on linguistic structure [1], [2]. His classification of grammars and the related theory was the basis of further work on formal language theory, theory of computation, and efficient methods of parsing in compiler design, [3], [4], [5] and [6]. Various restrictions on the productions define different types of grammars and corresponding languages in the Chomsky hierarchy: Type-0 grammars (unrestricted grammars), also known as recursively enumerable languages, include all formal grammars and do not have any restrictions. They generate all languages that can be recognized by a Turing machine.
2 Type-1 grammars (context-sensitive grammars) generate the context-sensitive languages: L R, exception: s ε is allowed if s never occurs on any right hand side. In normal form these grammars rules have the form αaβ αγβ with A a non-terminal andα,β and γ strings of terminals and non-terminals. The strings α and β may be empty, but γ must be nonempty. It can also include the rule s ε. All these languages can be recognized by linear-bounded automata. Type-2 grammars (context-free grammars) generate the context-free languages. L N. These are defined by rules of the form A γ with A a non-terminal and γ a string of terminals and non-terminals. These languages can be recognized by a pushdown automaton. Context-free languages are the theoretical basis for the syntax of most programming languages. Type-3 grammars (regular grammars) generate the regular languages. L N, R = a or R = ax, where a A and X N. Such a grammar restricts its rules to a single nonterminal on the left-hand side and a right-hand side consisting of a single terminal, possibly followed by a single non-terminal. The rule s ε is also allowed if s does not appear on the right side of any rule. These languages can be decided by a finite state automaton and can be obtained by regular expressions. Regular languages are commonly used to define search patterns and the lexical structure of programming languages. Chomsky hierarchy depicted in Fig. 1., indicates every regular language is contextfree, every context-free language is context-sensitive and every context-sensitive language is recursively enumerable. Type 0 Grammars Type 1 Grammars Type 2 Grammars Type 3 Grammars Finite Languages Fig. 1. Chomsky hierarchy From a practical point of view, grammars may be used to solve membership problem given a string over A, does it belong to language L(G) or not. Another problem is the so-called parsing problem which is finding a sequence of rewriting steps from the grammar's start symbol to the given sentence. Parsing can be seen as structuring the input according the given grammar. The algorithm that makes structuring is called a parser [7].
3 3 Parsing algorithms The most commonly known context-free parsing algorithms are top-down and bottom-up parsing. In top-down parsing, parser begins with the start symbol of the grammar and attempts to generate the same sentence that it is attempting to parse. The most commonly known top-down parsing algorithms are LL [3]. In bottom-up parsing, parser matches the input of the right-hand side of the productions and builds a derivation tree in reverse. The bottom-up parsing uses traditionally one symbol look ahead to guide the choice of action. The most commonly known bottom-up parsing algorithms are LR, SLR and LALR [3], [4], [8], [9]. Commonly these parsing algorithms are limited to working on subclasses of context-free grammars [9]. Hierarchies of subclasses [4] are shown in the Fig. 2. A grammar is said to be LL(k) if a parser can be written for that grammar that can make a decision of which production to apply at any stage simply by looking at most at the next k symbols of the input. LL(1) grammars are a simple but important category, where one symbol lookahead is adequate for the implementation of a top-down predictive parser [7]. A grammar is said to be LR(k) if a parser can be written for that grammar which makes a single left to right pass over the input with a lookahead of at most k symbols. These grammars can be parsed with bottom-up parsers, requiring no backtracking. LL(k) and LR(k) parsers do not backtrack and they operate efficiently. Available parser generator tools commonly support only some subclasses. Yacc [10], SableCC [11], CUP [12] and most of the other supports LALR(1). ANTLR [13], PCCTS [14] and some others support LL(k) parsing. Unambiguous Grammars Ambiguous Grammars LR(K) LR(1) LALR(1) LL(K) LL(1) SLR LR(0) LL(0) Fig. 2. Hierarchy of Context-free grammar classes No matter using top-down or bottom up, an ambiguous grammar is not able to be parsed with the known parsers. This is due to the ambiguity which happens in constructing the derivation tree. Detecting whether a grammar is ambiguous or not is not always an easy rule-based approach, however, one simple strategy is the following:
4 Ambiguous grammars mainly contain productions of the form A AαA β, in which both left recursion and right recursion, occurs simultaneously either direct or indirect after some non-terminal replacement. 3.1 Unger parsing An Unger parser [15] is the simplest known method to parse any context-free grammar. The exponential time complexity of this parser made it inapplicable as long as grammar is not ambiguous. In Unger parser algorithm, for each right-hand side production of grammar we must first generate all possible partitions of the input sentence. Generating partitions is not difficult: if we have m productions in right-hand side, numbered from 1 to m, and n is length of input, numbered from 1 to n, we have to find all possible partitions such that the numbers of the characters for each production are consecutive, and any production does not contain lower-numbered characters than any character in a lower-numbered production. Partition fails if a terminal symbol in a right-hand side does not match the corresponding part of the partition. The non-failed partition results will all lead to similar split-ups as sub-problems. These sub-problems must all be answered in the affirmative, or the partition is not the right one. For an ambiguous grammar that contains loops, there are infinitely many derivations to be found. So, the process needs to avoid the problem by cutting off the search in these cases. Maintaining a list of partitions that we are currently investigating can do this. If a new partitioning already appears in the list, we do not investigate that and proceed as if the partition was answered negatively. Fortunately, if the grammar does not contain such a loop, a cut-off will not do any harm either, because the search is doomed to fail anyway [7]. 3.2 Top-down parsing Although it is possible to program a backtracking top-down parser, the resulting parser will be complex and slow. Predictive parsers (sometimes called recursive descent parsers) do no backtracking they can always determine which production to use. Clearly, predictive parsers can be written for grammars in which all production alternatives start with different terminal symbols. Production of the form A Aα β γ, is called left recursive. When one of the productions in a grammar is left recursive then a predictive parser may loop forever. To overcome this problem, the left recursive rule can be replaced with the followings: A β A γ A A α A ε Left Factoring is also another problem in top-down parsing. When a non-terminal has two or more productions whose right-hand sides start with the same grammar symbols, the grammar is not LL(1) and cannot be used for predictive parsing. Considering the productions A α β1 α β2 α βn γ in which contains left factor (α), the following replacement solve the problem: A α A γ A β1 β2 βn
5 A CFG is LL(1) if for each collections of productions A α1 α2 αn, the following holds: 1. has no left recursion 1. First(αi) First(αj) = for all i j (No left factoring) 2. if αi * ε then 2.a. αj * ε for all i j 2.b. First(αj) Follow(A) = for all i j A CFG is it LL(k), whenever there are two leftmost derivations, 1. S * ωaα ωβα * ωx lm lm lm 2. S * ωaα ωγα * ωy lm lm lm, such that First k (x) = First k (y), it follows that β = γ. [20] 3.3 Bottom-up parsing Bottom-up parsers start with the tokens in the input string rather than with the starting symbol of the grammar. A bottom-up parser produces the rightmost derivation in reverse. Shift-reduce parsers are based on two operations the shift operation reads and stores an input symbol and the reduce operation matches groups of adjacent stored symbols with the right hand side of a production and replaces them by the corresponding left hand side Precedence parsing There is a certain class of grammars called precedence grammars for which it is possible to write relatively simple parsers. Here, precedence relationships between adjacent symbols determine the actions of the parser. Details of the techniques were given in the Languages and Compilers course books [3]. At first sight, precedence parsing looks like a good technique it is simple and implementations can be very efficient. However, it is a technique that is now rarely used in practice because it is difficult, if not impossible, to transform an average programming language grammar into a precedence form. A CFG is precedence grammar if the following conditions meet: 1. No two non-terminal exist next to each other 2. No epsilon (empty) production occur LR parsing LR parsers are efficient bottom-up parsers that can be constructed for a large class of context-free grammars. An LR(k) grammar is one that generates strings each of which can be parsed during a single deterministic scan from left to right without looking ahead more than k symbols. These parsers are generally very efficient and good at
6 error reporting, but unfortunately they are very difficult to write without the help of special parser-generating programs. Even top-down parsers have their problems: left recursion has to be removed and further restrictions have to be imposed to ensure a deterministic and efficient parser. Parsing technique for LR(k) grammars was first described by Knuth [17] and has since been widely used and much developed. A convenient way of implementing an LR(1) parser is via a parsing table [16]. Each entry (indexed by the current input symbol and the state number at the top of the stack) contains a description of the next action the parser should perform. The possible actions are shift, reduce, accept and error. It is known that when a conflict happens in constructing the parsing table, the grammar is not acceptable by that parsing method. For example a grammar is not LR(1) if has either shift-reduce conflict for any item [A α.xβ, t] in s with x a terminal, there is no item in s of the from [B α., x] or reduce-reduce conflict there are no two items in s of the form [A α., t] and [B β., t]. Our concentration, however, is on the matter weather there exist quick ways to determine a given grammar type or not. Three methods, in order of increasing power are simple LR (SLR), lookahead LR (LALR), and canonical LR (CLR). SLR and LALR approaches reduce the size of the parsing table, but they cannot handle all the grammars that can be parsed by the canonical LR method. The SLR(1) parser is based on a LR(0) parsing table, but onesymbol lookahead is added after the table has been built [7]. A grammar is LR (0) if you can take a valid token sequence, chop it in two, and still make sense of the left part. The LR grammar hierarchy is as follows: LR(0) SLR(1) LR(1) LR(k) A CFG is LR(0) if it is LL(1) and do not have epsilon product. Almost every LL grammar is LR(0) and thus LALR. The exceptions being grammars with empty rules, some of them may be LL without being LR(0) [18]. A "null" non-terminal symbol is defined as a non-terminal that only derives or produces the null string (epsilon). A "p-reduced" grammar is a reduced grammar in which all nonterminal symbols are not "null". If First(A)=ε then A is null else A is not null. A CFG is LALR(1) if it is LL(1) and is p-reduced [18]. A CFG is SLR(1) if 1) For any item {A α.xβ: x T there is no {B γ. : x Follow(B) 2) For any item {A α. and {B β. Follow(A) Follow(B) = A CFG is SLR(k) if and only if the following two statements are true for all states q in the LR(0) machine for the S-augmented grammar [19], [21]. 1. Whenever q contains a pair of distinct items [A 1 ω 1 ] and [A 2 ω 2 ], then Follow k (A 1 ) Follow k (A 2 ) = 0 2. Whenever q contains a pair of items [A α.aβ] and [B ω.], where a is a terminal, then First k (aβ Follow k (A)) Follow k (B) = 0
7 A CFG is LR(1) if: 1) For any item [A α.xβ,a] with x T there is no [B γ.,x] 2) For any two complete items [A γ.,a] and [B β.,b] it follows a and a!=b. A CFG is LR(k), k 0, if the three conditions bellow imply that αaω =γbx. (That is, α=γ, A=B, and x=y.) [19], [20] Let G = (N,,P,S) be a CFG and let G =(N,,P,S ) be its augmented grammar. A grammar is LR if it is LR(k) for some k. 1. S * αaω αβω, rm rm 2. S * γbx αβy, rm rm 3. First k (ω) = First k (y) Main Theorem for LR detection A CFG is in first normal form (1NF) - Chomsky normal form - if and only if all production rules are of the form: A BC or A α or S ε, where A, B and C are non-terminal symbols, α is a terminal symbol (a symbol that represents a constant value), S is the start symbol, and ε is the empty string. Also, neither B nor C may be the start symbol. Every grammar in Chomsky normal form is context-free, and conversely, every context-free grammar can be efficiently transformed into an equivalent one which is in Chomsky normal form. With the exception of the optional rule S ε (included when the grammar may generate the empty string), all rules of a grammar in Chomsky normal form are expansive; thus, throughout the derivation of a string, each string of terminals and non-terminals is always either the same length or one element longer than the previous such string [22]. A CFG is in second normal form (2NF) - Greibach normal form - means that all production rules are of the form: A αx or S ε, where A is a nonterminal symbol, α is a terminal symbol, X is a (possibly empty) sequence of nonterminal symbols not including the start symbol, S is the start symbol, and ε is the null string. Observe that the grammar must be without left recursions [22]. Let G be a grammar in 1NF. Then do the following as often as possible: Pick some non-terminal, 1. If A is left-recursive, apply full left-recursion elimination". 2. Unfold all occurrences of A in the grammar. 3. Eliminate productions for A from the grammar (as it become unreachable). A grammar G is said to be in third normal form (3NF), if it is in 2NF and there are no two productions the right-hand sides of which start with the same symbol, such as in Z x u x v. Except for the aforementioned rare termination problem this normal form can obviously be obtained by apply left factoring wherever possible. How-
8 ever, we can improve the efficiency by delaying the left factorings as long as possible. This may be called "lazy left factoring" [23]. Main Theorem: Pepper in [23] proved that if G is a grammar and its transformed 3NF version is G' then original grammar G would be LR(k) if and only if the transformed grammar G' is LL(k). 4 Proposed mechanism Regarding detection methods proposed in previous section, a procedural approach is needed to determine a given grammar type. To meet so, we propose the following recognition steps, shown in Fig. 3, such that in the most efficient way the context free grammar type will be found. In this approach if an ambiguity sign is detected, parsing is not possible but with the Unger backtracking method. Otherwise detection framework would continue with LL test. TryX(n) functions return false in case unable to parse with the correspondence parsing method and return true if possible. Therefore if parsing could not be handled, a more powerful approach would be evaluated. When LL rejects parsing, the LR evaluation starts and in case LR rejects, backtracking would be obtained. Fig. 4, shows a simple method to detect whether a grammar is ambiguous or not by checking left and right recursion. Other detection algorithms are proposed as discussed earlier. if(!isambiguous()) if(!tryll(0)) if(!tryll(1)) if(!tryll(k)) if(!trylr(0)) if(!tryslr(1)) if(!trylalr(1)) if(!trylr(1)) if(!trylr(k)) TryBackTrack(); else TryBackTrack(); Fig. 3. The proposed quick grammar recognizer algorithm if(canreplacenonterminals()) if(isleftrecursive() && IsRightRecursive()) else Fig. 4. IsAmbiguous algorithm
9 if(isleftrecursive() HasLeftFactoring())) if(twoproductsreachepsilon()) if(first_followintersect()!=0) else Fig. 5. TryLL(1) algorithm if(hastwolmd() && EqualFirstk()) if(!equallm()) else Fig. 6. TryLL(k) algorithm if(hasepsilonproduct()) if(isleftrecursive() HasLeftFactoring())) if(twoproductsreachepsilon()) if(first_followintersect()!=0) else Fig. 7. TryLR(0) algorithm if(existsameproduct()) if(followsetsintersect()!=0) else Fig. 8. TrySLR(1) algorithm
10 if(existnullnonterminal()) if(isleftrecursive() HasLeftFactoring())) if(twoproductsreachepsilon()) if(first_followintersect()!=0) else Fig. 9. TryLALR(1) algorithm if(existsunchecked_lr1item()){ if(hasthesamelookahead()) else Fig. 10. TryLR(1) algorithm if(hastwormd() && EqualFirstk()) if(!equalrm()) else Fig. 11. TryLR(k) algorithm 5 Conclusion and future work In this paper we investigated grammar classification techniques in terms of language specification and parsing method specifications in a systematic framework. The work concerned with a very important and always fashionable topic in computer science and compilers and language processing area: grammar specification and parsing. It is known that when a conflict happens in constructing the parsing table, the grammar is not acceptable by that parsing method, however we built a framework to quickly determine a given grammar type. We finalized the work with our quick grammar recognizer algorithm to detect grammar type. Our future work is based on a mathematical approach in order to formulize grammars and perform an interpolation curvefitting method and compare with the proposed approach.
11 References 1. Chomsky, N., Three Models for the Description of Language, IRE Transactions on Information Theory, 2 (1956), pp , Chomsky, N., On Certain Formal Properties of Grammars, Information and Control, 1 (1956), pp , A. V. Aho, R. Sethi, and J. D. Ullman, Compilers. Principles, techniques, and Tools, Addison-Wesley, A. W. Appel, Modern Compiler Implementation in Java, Cambridge Univ. Press, T. W. Parsons, "Introduction to Compiler Construction", Computer Science Press, New York, K. Slonneger, B. L. Kurtz, Formal Syntax and Semantics of Programming Languages: A Laboratory Based Approach, Addison-Wesley, 1995, Available at: 7. Jokipii Antic ''Grammar-based Data Extraction Language (GDEL)'', Master of Science Thesis in Information Technology, University of Jyväskylä Department of Mathematical Information Technology, 10th October A. V. Aho, J. D. Ullman, The Theory of Parsing, Translation, and Compiling, Volume 1: Parsing, Prentice-Hall, D. Grune, C. J. H. Jacobs, "Parsing Techniques: A Practical Guide", Ellis Horwood, S. C. Johnson, YACC - Yet Another Compiler-Compiler, Technical Report Computer Science 32, Bell Laboratories, Murray Hill, New Jersey, 1975, Available at: E, Gagnon, SableCC, an Object-Oriented Compiler Framework, PhD thesis, School of Computer Science, McGill University, Montreal, March 1998, Available at: S. E. Hudson, CUP parser generator for Java, Available at: appel/modern/java/cup/ 13. T. J. Parr and R. W. Quong, ANTLR: A predicated-ll(k) parser generator, Software Practice and Experience, 25(7): , July 1995, Available at: T. J. Parr, Language Translation Using PCCTS & C++, Automata Publishing Company, ISBN: S.H. Unger, "A global parser for context-free phrase structure grammars", Commun. ACM, vol. 11, no. 4, p , April Des Watson. High-Level Languages and their Compilers. International Computer Science Series. Addison-Wesley Publishing Company, Wokingham, England, D. E. Knuth. On the translation of languages from left to right. Information and Control, 8(6): , John C. Beatty J, "On the relationship Betwen the LL(1) and LR(1) Grammars". ACM Vol. 29, Žemlička, M.: "Principles of Kind Parsing - An Introduction". [Technical report KSI MFF UK No. 2002/1], MFF UK, Praha, December Alfred V. Aho, Jeffrey D. Ullman: The Theory of Parsing, Translation, and Compiling, Vol. I: Parsing, Prentice Hall, ISBN Seppo Sippu, Eljas Soisalon-Soininen: Parsing Theory. Volume II: LR(k) and LL(k) Parsing. Springer Verlag. EATCS 20. ISBN John Martin (2003). Introduction to Languages and the Theory of Computation. McGraw Hill. ISBN Pages section 6.6: simplified forms and normal forms. 23. Peter Pepper, "LR Parsing = Grammar Transformation + LL Parsing - Making LR Parsing More Understandable And More Efficient", No 99-5, April
COMPUTATIONAL COMPLEXITY OF LEFT-ASSOCIATIVE GRAMMAR
COMPUTATIONAL COMPLEXITY OF LEFT-ASSOCIATIVE GRAMMAR ROLAND HAUSSER Institut für Deutsche Philologie Ludwig-Maximilians Universität München München, West Germany 1. CHOICE OF A PRIMITIVE OPERATION The
More informationSyntax Parsing 1. Grammars and parsing 2. Top-down and bottom-up parsing 3. Chart parsers 4. Bottom-up chart parsing 5. The Earley Algorithm
Syntax Parsing 1. Grammars and parsing 2. Top-down and bottom-up parsing 3. Chart parsers 4. Bottom-up chart parsing 5. The Earley Algorithm syntax: from the Greek syntaxis, meaning setting out together
More informationParsing of part-of-speech tagged Assamese Texts
IJCSI International Journal of Computer Science Issues, Vol. 6, No. 1, 2009 ISSN (Online): 1694-0784 ISSN (Print): 1694-0814 28 Parsing of part-of-speech tagged Assamese Texts Mirzanur Rahman 1, Sufal
More informationErkki Mäkinen State change languages as homomorphic images of Szilard languages
Erkki Mäkinen State change languages as homomorphic images of Szilard languages UNIVERSITY OF TAMPERE SCHOOL OF INFORMATION SCIENCES REPORTS IN INFORMATION SCIENCES 48 TAMPERE 2016 UNIVERSITY OF TAMPERE
More informationA General Class of Noncontext Free Grammars Generating Context Free Languages
INFORMATION AND CONTROL 43, 187-194 (1979) A General Class of Noncontext Free Grammars Generating Context Free Languages SARWAN K. AGGARWAL Boeing Wichita Company, Wichita, Kansas 67210 AND JAMES A. HEINEN
More informationInformatics 2A: Language Complexity and the. Inf2A: Chomsky Hierarchy
Informatics 2A: Language Complexity and the Chomsky Hierarchy September 28, 2010 Starter 1 Is there a finite state machine that recognises all those strings s from the alphabet {a, b} where the difference
More informationRANKING AND UNRANKING LEFT SZILARD LANGUAGES. Erkki Mäkinen DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF TAMPERE REPORT A ER E P S I M S
N S ER E P S I M TA S UN A I S I T VER RANKING AND UNRANKING LEFT SZILARD LANGUAGES Erkki Mäkinen DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF TAMPERE REPORT A-1997-2 UNIVERSITY OF TAMPERE DEPARTMENT OF
More informationProof Theory for Syntacticians
Department of Linguistics Ohio State University Syntax 2 (Linguistics 602.02) January 5, 2012 Logics for Linguistics Many different kinds of logic are directly applicable to formalizing theories in syntax
More informationLanguage properties and Grammar of Parallel and Series Parallel Languages
arxiv:1711.01799v1 [cs.fl] 6 Nov 2017 Language properties and Grammar of Parallel and Series Parallel Languages Mohana.N 1, Kalyani Desikan 2 and V.Rajkumar Dare 3 1 Division of Mathematics, School of
More informationBasic Parsing with Context-Free Grammars. Some slides adapted from Julia Hirschberg and Dan Jurafsky 1
Basic Parsing with Context-Free Grammars Some slides adapted from Julia Hirschberg and Dan Jurafsky 1 Announcements HW 2 to go out today. Next Tuesday most important for background to assignment Sign up
More informationA Version Space Approach to Learning Context-free Grammars
Machine Learning 2: 39~74, 1987 1987 Kluwer Academic Publishers, Boston - Manufactured in The Netherlands A Version Space Approach to Learning Context-free Grammars KURT VANLEHN (VANLEHN@A.PSY.CMU.EDU)
More informationGrammars & Parsing, Part 1:
Grammars & Parsing, Part 1: Rules, representations, and transformations- oh my! Sentence VP The teacher Verb gave the lecture 2015-02-12 CS 562/662: Natural Language Processing Game plan for today: Review
More informationA R "! I,,, !~ii ii! A ow ' r.-ii ' i ' JA' V5, 9. MiN, ;
A R "! I,,, r.-ii ' i '!~ii ii! A ow ' I % i o,... V. 4..... JA' i,.. Al V5, 9 MiN, ; Logic and Language Models for Computer Science Logic and Language Models for Computer Science HENRY HAMBURGER George
More informationCS 598 Natural Language Processing
CS 598 Natural Language Processing Natural language is everywhere Natural language is everywhere Natural language is everywhere Natural language is everywhere!"#$%&'&()*+,-./012 34*5665756638/9:;< =>?@ABCDEFGHIJ5KL@
More informationDeveloping a TT-MCTAG for German with an RCG-based Parser
Developing a TT-MCTAG for German with an RCG-based Parser Laura Kallmeyer, Timm Lichte, Wolfgang Maier, Yannick Parmentier, Johannes Dellert University of Tübingen, Germany CNRS-LORIA, France LREC 2008,
More informationAn Interactive Intelligent Language Tutor Over The Internet
An Interactive Intelligent Language Tutor Over The Internet Trude Heift Linguistics Department and Language Learning Centre Simon Fraser University, B.C. Canada V5A1S6 E-mail: heift@sfu.ca Abstract: This
More informationChinese Language Parsing with Maximum-Entropy-Inspired Parser
Chinese Language Parsing with Maximum-Entropy-Inspired Parser Heng Lian Brown University Abstract The Chinese language has many special characteristics that make parsing difficult. The performance of state-of-the-art
More informationThe Strong Minimalist Thesis and Bounded Optimality
The Strong Minimalist Thesis and Bounded Optimality DRAFT-IN-PROGRESS; SEND COMMENTS TO RICKL@UMICH.EDU Richard L. Lewis Department of Psychology University of Michigan 27 March 2010 1 Purpose of this
More informationAbstractions and the Brain
Abstractions and the Brain Brian D. Josephson Department of Physics, University of Cambridge Cavendish Lab. Madingley Road Cambridge, UK. CB3 OHE bdj10@cam.ac.uk http://www.tcm.phy.cam.ac.uk/~bdj10 ABSTRACT
More informationCompositional Semantics
Compositional Semantics CMSC 723 / LING 723 / INST 725 MARINE CARPUAT marine@cs.umd.edu Words, bag of words Sequences Trees Meaning Representing Meaning An important goal of NLP/AI: convert natural language
More informationAxiom 2013 Team Description Paper
Axiom 2013 Team Description Paper Mohammad Ghazanfari, S Omid Shirkhorshidi, Farbod Samsamipour, Hossein Rahmatizadeh Zagheli, Mohammad Mahdavi, Payam Mohajeri, S Abbas Alamolhoda Robotics Scientific Association
More informationSome Principles of Automated Natural Language Information Extraction
Some Principles of Automated Natural Language Information Extraction Gregers Koch Department of Computer Science, Copenhagen University DIKU, Universitetsparken 1, DK-2100 Copenhagen, Denmark Abstract
More information11/29/2010. Statistical Parsing. Statistical Parsing. Simple PCFG for ATIS English. Syntactic Disambiguation
tatistical Parsing (Following slides are modified from Prof. Raymond Mooney s slides.) tatistical Parsing tatistical parsing uses a probabilistic model of syntax in order to assign probabilities to each
More informationThe Interface between Phrasal and Functional Constraints
The Interface between Phrasal and Functional Constraints John T. Maxwell III* Xerox Palo Alto Research Center Ronald M. Kaplan t Xerox Palo Alto Research Center Many modern grammatical formalisms divide
More informationMultimedia Application Effective Support of Education
Multimedia Application Effective Support of Education Eva Milková Faculty of Science, University od Hradec Králové, Hradec Králové, Czech Republic eva.mikova@uhk.cz Abstract Multimedia applications have
More informationIntroduction to HPSG. Introduction. Historical Overview. The HPSG architecture. Signature. Linguistic Objects. Descriptions.
to as a linguistic theory to to a member of the family of linguistic frameworks that are called generative grammars a grammar which is formalized to a high degree and thus makes exact predictions about
More informationA Minimalist Approach to Code-Switching. In the field of linguistics, the topic of bilingualism is a broad one. There are many
Schmidt 1 Eric Schmidt Prof. Suzanne Flynn Linguistic Study of Bilingualism December 13, 2013 A Minimalist Approach to Code-Switching In the field of linguistics, the topic of bilingualism is a broad one.
More informationNatural Language Processing. George Konidaris
Natural Language Processing George Konidaris gdk@cs.brown.edu Fall 2017 Natural Language Processing Understanding spoken/written sentences in a natural language. Major area of research in AI. Why? Humans
More information"f TOPIC =T COMP COMP... OBJ
TREATMENT OF LONG DISTANCE DEPENDENCIES IN LFG AND TAG: FUNCTIONAL UNCERTAINTY IN LFG IS A COROLLARY IN TAG" Aravind K. Joshi Dept. of Computer & Information Science University of Pennsylvania Philadelphia,
More informationEfficient Normal-Form Parsing for Combinatory Categorial Grammar
Proceedings of the 34th Annual Meeting of the ACL, Santa Cruz, June 1996, pp. 79-86. Efficient Normal-Form Parsing for Combinatory Categorial Grammar Jason Eisner Dept. of Computer and Information Science
More informationPH.D. IN COMPUTER SCIENCE PROGRAM (POST M.S.)
PH.D. IN COMPUTER SCIENCE PROGRAM (POST M.S.) OVERVIEW ADMISSION REQUIREMENTS PROGRAM REQUIREMENTS OVERVIEW FOR THE PH.D. IN COMPUTER SCIENCE Overview The doctoral program is designed for those students
More informationReinforcement Learning by Comparing Immediate Reward
Reinforcement Learning by Comparing Immediate Reward Punit Pandey DeepshikhaPandey Dr. Shishir Kumar Abstract This paper introduces an approach to Reinforcement Learning Algorithm by comparing their immediate
More informationDetecting English-French Cognates Using Orthographic Edit Distance
Detecting English-French Cognates Using Orthographic Edit Distance Qiongkai Xu 1,2, Albert Chen 1, Chang i 1 1 The Australian National University, College of Engineering and Computer Science 2 National
More informationEnsemble Technique Utilization for Indonesian Dependency Parser
Ensemble Technique Utilization for Indonesian Dependency Parser Arief Rahman Institut Teknologi Bandung Indonesia 23516008@std.stei.itb.ac.id Ayu Purwarianti Institut Teknologi Bandung Indonesia ayu@stei.itb.ac.id
More informationLecture 10: Reinforcement Learning
Lecture 1: Reinforcement Learning Cognitive Systems II - Machine Learning SS 25 Part III: Learning Programs and Strategies Q Learning, Dynamic Programming Lecture 1: Reinforcement Learning p. Motivation
More informationThink A F R I C A when assessing speaking. C.E.F.R. Oral Assessment Criteria. Think A F R I C A - 1 -
C.E.F.R. Oral Assessment Criteria Think A F R I C A - 1 - 1. The extracts in the left hand column are taken from the official descriptors of the CEFR levels. How would you grade them on a scale of low,
More informationContext Free Grammars. Many slides from Michael Collins
Context Free Grammars Many slides from Michael Collins Overview I An introduction to the parsing problem I Context free grammars I A brief(!) sketch of the syntax of English I Examples of ambiguous structures
More informationPRODUCT PLATFORM DESIGN: A GRAPH GRAMMAR APPROACH
Proceedings of DETC 99: 1999 ASME Design Engineering Technical Conferences September 12-16, 1999, Las Vegas, Nevada DETC99/DTM-8762 PRODUCT PLATFORM DESIGN: A GRAPH GRAMMAR APPROACH Zahed Siddique Graduate
More informationLinking Task: Identifying authors and book titles in verbose queries
Linking Task: Identifying authors and book titles in verbose queries Anaïs Ollagnier, Sébastien Fournier, and Patrice Bellot Aix-Marseille University, CNRS, ENSAM, University of Toulon, LSIS UMR 7296,
More informationA Grammar for Battle Management Language
Bastian Haarmann 1 Dr. Ulrich Schade 1 Dr. Michael R. Hieb 2 1 Fraunhofer Institute for Communication, Information Processing and Ergonomics 2 George Mason University bastian.haarmann@fkie.fraunhofer.de
More informationCONCEPT MAPS AS A DEVICE FOR LEARNING DATABASE CONCEPTS
CONCEPT MAPS AS A DEVICE FOR LEARNING DATABASE CONCEPTS Pirjo Moen Department of Computer Science P.O. Box 68 FI-00014 University of Helsinki pirjo.moen@cs.helsinki.fi http://www.cs.helsinki.fi/pirjo.moen
More informationPowerTeacher Gradebook User Guide PowerSchool Student Information System
PowerSchool Student Information System Document Properties Copyright Owner Copyright 2007 Pearson Education, Inc. or its affiliates. All rights reserved. This document is the property of Pearson Education,
More informationRefining the Design of a Contracting Finite-State Dependency Parser
Refining the Design of a Contracting Finite-State Dependency Parser Anssi Yli-Jyrä and Jussi Piitulainen and Atro Voutilainen The Department of Modern Languages PO Box 3 00014 University of Helsinki {anssi.yli-jyra,jussi.piitulainen,atro.voutilainen}@helsinki.fi
More information(Sub)Gradient Descent
(Sub)Gradient Descent CMSC 422 MARINE CARPUAT marine@cs.umd.edu Figures credit: Piyush Rai Logistics Midterm is on Thursday 3/24 during class time closed book/internet/etc, one page of notes. will include
More informationAQUA: An Ontology-Driven Question Answering System
AQUA: An Ontology-Driven Question Answering System Maria Vargas-Vera, Enrico Motta and John Domingue Knowledge Media Institute (KMI) The Open University, Walton Hall, Milton Keynes, MK7 6AA, United Kingdom.
More informationIT Students Workshop within Strategic Partnership of Leibniz University and Peter the Great St. Petersburg Polytechnic University
IT Students Workshop within Strategic Partnership of Leibniz University and Peter the Great St. Petersburg Polytechnic University 06.11.16 13.11.16 Hannover Our group from Peter the Great St. Petersburg
More informationUsing dialogue context to improve parsing performance in dialogue systems
Using dialogue context to improve parsing performance in dialogue systems Ivan Meza-Ruiz and Oliver Lemon School of Informatics, Edinburgh University 2 Buccleuch Place, Edinburgh I.V.Meza-Ruiz@sms.ed.ac.uk,
More informationISFA2008U_120 A SCHEDULING REINFORCEMENT LEARNING ALGORITHM
Proceedings of 28 ISFA 28 International Symposium on Flexible Automation Atlanta, GA, USA June 23-26, 28 ISFA28U_12 A SCHEDULING REINFORCEMENT LEARNING ALGORITHM Amit Gil, Helman Stern, Yael Edan, and
More informationLecture 1: Machine Learning Basics
1/69 Lecture 1: Machine Learning Basics Ali Harakeh University of Waterloo WAVE Lab ali.harakeh@uwaterloo.ca May 1, 2017 2/69 Overview 1 Learning Algorithms 2 Capacity, Overfitting, and Underfitting 3
More informationImplementing a tool to Support KAOS-Beta Process Model Using EPF
Implementing a tool to Support KAOS-Beta Process Model Using EPF Malihe Tabatabaie Malihe.Tabatabaie@cs.york.ac.uk Department of Computer Science The University of York United Kingdom Eclipse Process Framework
More informationImproved Effects of Word-Retrieval Treatments Subsequent to Addition of the Orthographic Form
Orthographic Form 1 Improved Effects of Word-Retrieval Treatments Subsequent to Addition of the Orthographic Form The development and testing of word-retrieval treatments for aphasia has generally focused
More informationEnumeration of Context-Free Languages and Related Structures
Enumeration of Context-Free Languages and Related Structures Michael Domaratzki Jodrey School of Computer Science, Acadia University Wolfville, NS B4P 2R6 Canada Alexander Okhotin Department of Mathematics,
More informationENGBG1 ENGBL1 Campus Linguistics. Meeting 2. Chapter 7 (Morphology) and chapter 9 (Syntax) Pia Sundqvist
Meeting 2 Chapter 7 (Morphology) and chapter 9 (Syntax) Today s agenda Repetition of meeting 1 Mini-lecture on morphology Seminar on chapter 7, worksheet Mini-lecture on syntax Seminar on chapter 9, worksheet
More informationGRAMMAR IN CONTEXT 2 PDF
GRAMMAR IN CONTEXT 2 PDF ==> Download: GRAMMAR IN CONTEXT 2 PDF GRAMMAR IN CONTEXT 2 PDF - Are you searching for Grammar In Context 2 Books? Now, you will be happy that at this time Grammar In Context
More informationMultiple case assignment and the English pseudo-passive *
Multiple case assignment and the English pseudo-passive * Norvin Richards Massachusetts Institute of Technology Previous literature on pseudo-passives (see van Riemsdijk 1978, Chomsky 1981, Hornstein &
More informationReinForest: Multi-Domain Dialogue Management Using Hierarchical Policies and Knowledge Ontology
ReinForest: Multi-Domain Dialogue Management Using Hierarchical Policies and Knowledge Ontology Tiancheng Zhao CMU-LTI-16-006 Language Technologies Institute School of Computer Science Carnegie Mellon
More informationSchool of Innovative Technologies and Engineering
School of Innovative Technologies and Engineering Department of Applied Mathematical Sciences Proficiency Course in MATLAB COURSE DOCUMENT VERSION 1.0 PCMv1.0 July 2012 University of Technology, Mauritius
More informationThe presence of interpretable but ungrammatical sentences corresponds to mismatches between interpretive and productive parsing.
Lecture 4: OT Syntax Sources: Kager 1999, Section 8; Legendre et al. 1998; Grimshaw 1997; Barbosa et al. 1998, Introduction; Bresnan 1998; Fanselow et al. 1999; Gibson & Broihier 1998. OT is not a theory
More informationLearning Structural Correspondences Across Different Linguistic Domains with Synchronous Neural Language Models
Learning Structural Correspondences Across Different Linguistic Domains with Synchronous Neural Language Models Stephan Gouws and GJ van Rooyen MIH Medialab, Stellenbosch University SOUTH AFRICA {stephan,gvrooyen}@ml.sun.ac.za
More informationObjectives. Chapter 2: The Representation of Knowledge. Expert Systems: Principles and Programming, Fourth Edition
Chapter 2: The Representation of Knowledge Expert Systems: Principles and Programming, Fourth Edition Objectives Introduce the study of logic Learn the difference between formal logic and informal logic
More informationMachine Learning from Garden Path Sentences: The Application of Computational Linguistics
Machine Learning from Garden Path Sentences: The Application of Computational Linguistics http://dx.doi.org/10.3991/ijet.v9i6.4109 J.L. Du 1, P.F. Yu 1 and M.L. Li 2 1 Guangdong University of Foreign Studies,
More informationPrediction of Maximal Projection for Semantic Role Labeling
Prediction of Maximal Projection for Semantic Role Labeling Weiwei Sun, Zhifang Sui Institute of Computational Linguistics Peking University Beijing, 100871, China {ws, szf}@pku.edu.cn Haifeng Wang Toshiba
More informationSpecifying Logic Programs in Controlled Natural Language
TECHNICAL REPORT 94.17, DEPARTMENT OF COMPUTER SCIENCE, UNIVERSITY OF ZURICH, NOVEMBER 1994 Specifying Logic Programs in Controlled Natural Language Norbert E. Fuchs, Hubert F. Hofmann, Rolf Schwitter
More informationData Integration through Clustering and Finding Statistical Relations - Validation of Approach
Data Integration through Clustering and Finding Statistical Relations - Validation of Approach Marek Jaszuk, Teresa Mroczek, and Barbara Fryc University of Information Technology and Management, ul. Sucharskiego
More informationHyperedge Replacement and Nonprojective Dependency Structures
Hyperedge Replacement and Nonprojective Dependency Structures Daniel Bauer and Owen Rambow Columbia University New York, NY 10027, USA {bauer,rambow}@cs.columbia.edu Abstract Synchronous Hyperedge Replacement
More informationCS 1103 Computer Science I Honors. Fall Instructor Muller. Syllabus
CS 1103 Computer Science I Honors Fall 2016 Instructor Muller Syllabus Welcome to CS1103. This course is an introduction to the art and science of computer programming and to some of the fundamental concepts
More informationApproaches to control phenomena handout Obligatory control and morphological case: Icelandic and Basque
Approaches to control phenomena handout 6 5.4 Obligatory control and morphological case: Icelandic and Basque Icelandinc quirky case (displaying properties of both structural and inherent case: lexically
More informationParsing natural language
Rochester Institute of Technology RIT Scholar Works Theses Thesis/Dissertation Collections 1983 Parsing natural language Leonard E. Wilcox Follow this and additional works at: http://scholarworks.rit.edu/theses
More informationTowards a MWE-driven A* parsing with LTAGs [WG2,WG3]
Towards a MWE-driven A* parsing with LTAGs [WG2,WG3] Jakub Waszczuk, Agata Savary To cite this version: Jakub Waszczuk, Agata Savary. Towards a MWE-driven A* parsing with LTAGs [WG2,WG3]. PARSEME 6th general
More informationGACE Computer Science Assessment Test at a Glance
GACE Computer Science Assessment Test at a Glance Updated May 2017 See the GACE Computer Science Assessment Study Companion for practice questions and preparation resources. Assessment Name Computer Science
More informationInleiding Taalkunde. Docent: Paola Monachesi. Blok 4, 2001/ Syntax 2. 2 Phrases and constituent structure 2. 3 A minigrammar of Italian 3
Inleiding Taalkunde Docent: Paola Monachesi Blok 4, 2001/2002 Contents 1 Syntax 2 2 Phrases and constituent structure 2 3 A minigrammar of Italian 3 4 Trees 3 5 Developing an Italian lexicon 4 6 S(emantic)-selection
More informationSoftware Maintenance
1 What is Software Maintenance? Software Maintenance is a very broad activity that includes error corrections, enhancements of capabilities, deletion of obsolete capabilities, and optimization. 2 Categories
More informationExperiments with SMS Translation and Stochastic Gradient Descent in Spanish Text Author Profiling
Experiments with SMS Translation and Stochastic Gradient Descent in Spanish Text Author Profiling Notebook for PAN at CLEF 2013 Andrés Alfonso Caurcel Díaz 1 and José María Gómez Hidalgo 2 1 Universidad
More informationChunk Parsing for Base Noun Phrases using Regular Expressions. Let s first let the variable s0 be the sentence tree of the first sentence.
NLP Lab Session Week 8 October 15, 2014 Noun Phrase Chunking and WordNet in NLTK Getting Started In this lab session, we will work together through a series of small examples using the IDLE window and
More informationA Neural Network GUI Tested on Text-To-Phoneme Mapping
A Neural Network GUI Tested on Text-To-Phoneme Mapping MAARTEN TROMPPER Universiteit Utrecht m.f.a.trompper@students.uu.nl Abstract Text-to-phoneme (T2P) mapping is a necessary step in any speech synthesis
More informationWriting Research Articles
Marek J. Druzdzel with minor additions from Peter Brusilovsky University of Pittsburgh School of Information Sciences and Intelligent Systems Program marek@sis.pitt.edu http://www.pitt.edu/~druzdzel Overview
More informationHans-Ulrich Block, Hans Haugeneder Siemens AG, MOnchen ZT ZTI INF W. Germany. (2) [S' [NP who][s does he try to find [NP e]]s IS' $=~
The Treatment of Movement-Rules in a LFG-Parser Hans-Ulrich Block, Hans Haugeneder Siemens AG, MOnchen ZT ZT NF W. Germany n this paper we propose a way of how to treat longdistance movement phenomena
More informationAre You Ready? Simplify Fractions
SKILL 10 Simplify Fractions Teaching Skill 10 Objective Write a fraction in simplest form. Review the definition of simplest form with students. Ask: Is 3 written in simplest form? Why 7 or why not? (Yes,
More informationDiscriminative Learning of Beam-Search Heuristics for Planning
Discriminative Learning of Beam-Search Heuristics for Planning Yuehua Xu School of EECS Oregon State University Corvallis,OR 97331 xuyu@eecs.oregonstate.edu Alan Fern School of EECS Oregon State University
More informationA Context-Driven Use Case Creation Process for Specifying Automotive Driver Assistance Systems
A Context-Driven Use Case Creation Process for Specifying Automotive Driver Assistance Systems Hannes Omasreiter, Eduard Metzker DaimlerChrysler AG Research Information and Communication Postfach 23 60
More informationMatching Similarity for Keyword-Based Clustering
Matching Similarity for Keyword-Based Clustering Mohammad Rezaei and Pasi Fränti University of Eastern Finland {rezaei,franti}@cs.uef.fi Abstract. Semantic clustering of objects such as documents, web
More informationClickthrough-Based Translation Models for Web Search: from Word Models to Phrase Models
Clickthrough-Based Translation Models for Web Search: from Word Models to Phrase Models Jianfeng Gao Microsoft Research One Microsoft Way Redmond, WA 98052 USA jfgao@microsoft.com Xiaodong He Microsoft
More informationRule discovery in Web-based educational systems using Grammar-Based Genetic Programming
Data Mining VI 205 Rule discovery in Web-based educational systems using Grammar-Based Genetic Programming C. Romero, S. Ventura, C. Hervás & P. González Universidad de Córdoba, Campus Universitario de
More informationEvolutive Neural Net Fuzzy Filtering: Basic Description
Journal of Intelligent Learning Systems and Applications, 2010, 2: 12-18 doi:10.4236/jilsa.2010.21002 Published Online February 2010 (http://www.scirp.org/journal/jilsa) Evolutive Neural Net Fuzzy Filtering:
More informationUNIVERSITY OF OSLO Department of Informatics. Dialog Act Recognition using Dependency Features. Master s thesis. Sindre Wetjen
UNIVERSITY OF OSLO Department of Informatics Dialog Act Recognition using Dependency Features Master s thesis Sindre Wetjen November 15, 2013 Acknowledgments First I want to thank my supervisors Lilja
More informationDisambiguation of Thai Personal Name from Online News Articles
Disambiguation of Thai Personal Name from Online News Articles Phaisarn Sutheebanjard Graduate School of Information Technology Siam University Bangkok, Thailand mr.phaisarn@gmail.com Abstract Since online
More informationOCR for Arabic using SIFT Descriptors With Online Failure Prediction
OCR for Arabic using SIFT Descriptors With Online Failure Prediction Andrey Stolyarenko, Nachum Dershowitz The Blavatnik School of Computer Science Tel Aviv University Tel Aviv, Israel Email: stloyare@tau.ac.il,
More informationCPS122 Lecture: Identifying Responsibilities; CRC Cards. 1. To show how to use CRC cards to identify objects and find responsibilities
Objectives: CPS122 Lecture: Identifying Responsibilities; CRC Cards last revised March 16, 2015 1. To show how to use CRC cards to identify objects and find responsibilities Materials: 1. ATM System example
More informationA Case Study: News Classification Based on Term Frequency
A Case Study: News Classification Based on Term Frequency Petr Kroha Faculty of Computer Science University of Technology 09107 Chemnitz Germany kroha@informatik.tu-chemnitz.de Ricardo Baeza-Yates Center
More informationCEFR Overall Illustrative English Proficiency Scales
CEFR Overall Illustrative English Proficiency s CEFR CEFR OVERALL ORAL PRODUCTION Has a good command of idiomatic expressions and colloquialisms with awareness of connotative levels of meaning. Can convey
More informationSpecification and Evaluation of Machine Translation Toy Systems - Criteria for laboratory assignments
Specification and Evaluation of Machine Translation Toy Systems - Criteria for laboratory assignments Cristina Vertan, Walther v. Hahn University of Hamburg, Natural Language Systems Division Hamburg,
More informationMaximizing Learning Through Course Alignment and Experience with Different Types of Knowledge
Innov High Educ (2009) 34:93 103 DOI 10.1007/s10755-009-9095-2 Maximizing Learning Through Course Alignment and Experience with Different Types of Knowledge Phyllis Blumberg Published online: 3 February
More informationThe 9 th International Scientific Conference elearning and software for Education Bucharest, April 25-26, / X
The 9 th International Scientific Conference elearning and software for Education Bucharest, April 25-26, 2013 10.12753/2066-026X-13-154 DATA MINING SOLUTIONS FOR DETERMINING STUDENT'S PROFILE Adela BÂRA,
More informationA GENERIC SPLIT PROCESS MODEL FOR ASSET MANAGEMENT DECISION-MAKING
A GENERIC SPLIT PROCESS MODEL FOR ASSET MANAGEMENT DECISION-MAKING Yong Sun, a * Colin Fidge b and Lin Ma a a CRC for Integrated Engineering Asset Management, School of Engineering Systems, Queensland
More informationOntologies vs. classification systems
Ontologies vs. classification systems Bodil Nistrup Madsen Copenhagen Business School Copenhagen, Denmark bnm.isv@cbs.dk Hanne Erdman Thomsen Copenhagen Business School Copenhagen, Denmark het.isv@cbs.dk
More informationModule 12. Machine Learning. Version 2 CSE IIT, Kharagpur
Module 12 Machine Learning 12.1 Instructional Objective The students should understand the concept of learning systems Students should learn about different aspects of a learning system Students should
More informationConstraining X-Bar: Theta Theory
Constraining X-Bar: Theta Theory Carnie, 2013, chapter 8 Kofi K. Saah 1 Learning objectives Distinguish between thematic relation and theta role. Identify the thematic relations agent, theme, goal, source,
More informationBANGLA TO ENGLISH TEXT CONVERSION USING OPENNLP TOOLS
Daffodil International University Institutional Repository DIU Journal of Science and Technology Volume 8, Issue 1, January 2013 2013-01 BANGLA TO ENGLISH TEXT CONVERSION USING OPENNLP TOOLS Uddin, Sk.
More informationQuickStroke: An Incremental On-line Chinese Handwriting Recognition System
QuickStroke: An Incremental On-line Chinese Handwriting Recognition System Nada P. Matić John C. Platt Λ Tony Wang y Synaptics, Inc. 2381 Bering Drive San Jose, CA 95131, USA Abstract This paper presents
More informationOn the Polynomial Degree of Minterm-Cyclic Functions
On the Polynomial Degree of Minterm-Cyclic Functions Edward L. Talmage Advisor: Amit Chakrabarti May 31, 2012 ABSTRACT When evaluating Boolean functions, each bit of input that must be checked is costly,
More information