Unreferenced stub auto yes date December 2009 Shallow parsing also chunking , light parsing is an analysis of a Sentence linguistics sentence which identifies the constituents noun groups, verb s, verb groups, etc. , but does not specify their internal structure, nor their role in the main sentence. It is a technique widely used in natural language processing . It is similar to the concept of lexical analysis for computer languages. External links http l2r.cs.uiuc.edu cogcomp asoftware.php?skey FLBJCHUNK Illinois Shallow Parser Shallow Parser http l2r.cs.uiuc.edu cogcomp demo.php?dkey SP Demo http incubator.apache.org opennlp index.html Apache OpenNLP includes a chunker. References Citation last1 Abney first1 Steven title Parsing By Chunks booktitle Principle Based Parsing year 1991 pages 257 278 publisher Kluwer Academic Publishers url http www.vinartus.net spa 90e.pdf . See also Parser DEFAULTSORT Shallow Parsing Category Natural language parsing Category Tasks of Natural language processing Ling stub ca An lisi sint ctica superficial es An lisis sint ctico superficial fr Analyse syntaxique de surface ja pl P ytki parsing ... more details
In natural language processing , deterministic parsing refers to parsing algorithm s that do not Backtracking back up . LR parser LR parsers are an example. This meaning of the words deterministic and non deterministic differs from that used to describe nondeterministic algorithm s. The deterministic behavior is desired and expected in Compiler compiling programming language s. In natural language processing, it was thought for a long time that deterministic parsing is impossible due to ambiguity inherent in natural languages many sentences have more than one plausible parse . Thus, non deterministic approaches such as the chart parser had to be applied. However, Mitch Marcus proposed in 1978 the Parsifal parser that was able to deal with ambiguities while still keeping the deterministic behavior. See also Deterministic context free grammar References Alfred V. Aho , Stephen C. Johnson , Jeffrey D. Ullman 1975 Deterministic parsing of ambiguous grammars. Comm. ACM 18 8 441 452. Mitchell Marcus 1978 A Theory of Syntactic Recognition for Natural Language. PhD Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology. Comp sci stub Category Parsing ... more details
Multiple issues unreferenced May 2011 context May 2011 expert Linguistics date May 2011 Merge from Orthographic rules Morphological rules date May 2011 Morphological parsing , in natural language processing , is the process of determining the morphemes from which a given word is constructed. It must be able to distinguish between orthographic rules and morphological rules . For example, the word foxes can be decomposed into fox the stem , and es a suffix indicating plurality . The generally accepted approach to morphological parsing is through the use of a finite state transducer FST , which inputs words and outputs their stem and modifiers. The FST is initially created through algorithmic parsing of some word source, such as a dictionary, complete with modifier markups. Another approach is through the use of an indexed lookup method, which uses a constructed radix tree . This is not an often taken route because it breaks down for morphologically complex languages. Category Grammar Category Linguistic morphology Category Natural language parsing Linguistics stub ... more details
In computer science , scannerless parsing also called lexerless parsing refers to the use of a single formalism to express both the lexical and context free syntax used to parse a language. This parsing strategy is suitable when a clear lexer parser distinction is unneeded. Examples of when this is appropriate include TeX , most wiki grammars, makefiles, and simple per application control languages. Advantages Only one metasyntax is needed Non regular lexical structure is handled easily Token classification is unneeded which removes the need for design accommodations such as the lexer hack and language keywords such as while in C programming language C Grammars can be compositional can be merged without human intervention ref compositional Disadvantages Since the lexical scanning and syntactic parsing processing is combined, the resulting parser tends to be harder to understand and debug for more complex languages Most parsers of character level grammars are nondeterministic There is no guarantee that the language being parsed is unambiguous Required extensions Unfortunately, when parsed at the character level, most popular programming language s are no longer strictly context free. Visser identified five key extensions to classical context free syntax which handle almost all common non context free constructs arising in practice Follow restrictions , a limited form of longest match Reject productions , a limited form of negative matching as found in boolean grammar s Preference ... based on Syntax Definition Formalism SDF . TXL programming language TXL supports character level parsing ... Parser Framework Spirit allows for both scannerless and scanner based parsing. Scannerless Boolean ... This is because parsing at the character level makes the language recognized by the parser ... summary?doi 10.1.1.37.7828 Visser, E. 1997b . Scannerless generalized LR parsing. Technical Report P9707, Programming Research Group, University of Amsterdam Category Parsing algorithms pt An lise ... more details
merge to LR parser date December 2011 This page is about LR parsing tables, there are also LL Parsing table LL parsing tables which are substantially different. In computer science , a parsing table is the part of a parser that makes decisions about how to treat input tokens in compiler development. Overview A parsing table is a table describing what action its parser should take when a given input comes while it is in a given state. It is a tabular representation of a pushdown automaton that is generated from the context free grammar of the language to be parsed. This is possible because the set of viable prefix es that is, the sequence of input that can be set aside before a parser needs to either perform a reduction or return an error of a context free language is a regular language , so the parser can use a simple parse state table to recognize each viable prefix and determine what needs to be done next. A parsing table is used with a stack and an input buffer. The stack starts out empty, and symbols are shifted onto it one by one from the input buffer with associated states in each step, the parsing table is consulted to decide what action to take. More simply, an Action table defines what to do when a terminal symbol is encountered, and a goto table defines what to do when a nonterminal is encountered. The parsing table consists of two parts, the action table and the goto table. The action table takes the state at the top of the stack and the next symbol in the input buffer ... finite automaton of the Action table to a pushdown automaton . For example, a parsing table might ... 1 The parser sees that there are no more tokens in the input stream and looks up the empty token in the parsing ... table, the parser terminates, and may report success in parsing the input. The input in question is valid ... References http www.inf.unibz.it artale Compiler slide4.pdf Lecture slides about generating parsing ... from page 41 . Category Parsing algorithms pl Tabela parsingu zh ... more details
Statistical parsing is a group of parsing methods within natural language processing . The methods have in common that they associate grammar rules with a probability. Grammar rules are traditionally viewed in computational linguistics as defining the valid sentences in a language. Within this mindset, the idea of associating each rule with a probability then provides the relative frequency of any given grammar rule and, by deduction, the probability of a complete parse for a sentence. The probability associated with a grammar rule may be induced, but the application of that grammar rule within a parse tree and the computation of the probability of the parse tree based on its component rules is a form of deduction. Using this concept, statistical parsers make use of a procedure to search over a space of all candidate parses, and the computation of each candidate s probability, to derive the most probable parse of a sentence. The expectation maximization algorithm is one popular method of searching for the most probable parse. Search in this context is an application of the very useful search algorithm in artificial intelligence . By way of example, think about the sentence The can can hold water . A reader would instantly see that there is an object called the can and that this object is performing the action can i.e. is able to and the thing the object is able to do is hold and the thing ... of methods that statistical parsing algorithms frequently use. While few algorithms will use all of these they give a good overview of the general field. Most statistical parsing algorithms are based on a modified form of chart parsing . The modifications are necessary to support an extremely ... separately Viterbi algorithm . Notable people in statistical parsing Eugene Charniak Author of http www.cs.brown.edu people ec home.html Statistical techniques for natural language parsing ... parsing Category Statistical natural language processing ... more details
In computer science , top down parsing is a parsing strategy where one first looks at the highest level ... . LL parser s are a type of parser that uses a top down parsing strategy. Top down parsing is a strategy ... in the analysis of both natural language s and computer language s. Top down parsing can be viewed as an attempt ... Simple implementations of top down parsing do not terminate for left recursion left recursive grammars, and top down parsing with backtracking may have Exponential time exponential time complexity with respect ... Aho, A.V and Ullman, J. D. 1972 The Theory of Parsing, Translation, and Compiling, Volume 1 Parsing ..., P. 2007 Modular and Efficient Top Down Parsing for Ambiguous Left Recursive Grammars . 10th International Workshop on Parsing Technologies IWPT , ACL SIGPARSE , Pages 109 120, June 2007, Prague .... ref which do Accommodating left recursion in top down parsing accommodate ambiguity and left recursion ... to Backus Naur form production rules. An LL parser , is a type of parser that does top down parsing .... In this way the parsing starts on the Left of the result side right side of the production ... parser , which is a type of shift reduce parser, and does bottom up parsing . Accommodating left recursion in top down parsing A formal grammar that contains left recursion cannot be parsing parsed .... ref name FrostHafiz2006 Frost, R. and Hafiz, R. 2006 A New Top Down Parsing Algorithm to Accommodate ... 46 54. ref That algorithm was extended to a complete parsing algorithm to accommodate indirect by comparing ... down parsing When top down parser tries to parse an ambiguous input with respect to an ambiguous CFG .... 1991 Techniques for automatic memoisation with applications to context free parsing. Journal Computational ... left recursive grammars . Their top down parsing algorithm also requires polynomial space for potentially ... representation is comparable with Tomita s compact representation of bottom up parsing . ref name Tomita1985 Tomita, M. 1985 Efficient Parsing for Natural Language. Kluwer, Boston, MA . ref ... more details
Data oriented parsing DOP , also data oriented processing is a probabilistic parsing probabilistic grammar formalism in computational linguistics . DOP was conceived by Remko Scha in 1990 with the aim of developing a Linguistic performance performance oriented grammar framework. Unlike other probabilistic formalisms, DOP takes into account all subtrees contained in a treebank rather than being restricted to, for example, 2 level subtrees like stochastic context free grammar PCFGs . Several variants of DOP have been developed. The initial version was based on tree substitution grammar , while more recently, DOP has been combined with lexical functional grammar LFG . The resulting DOP LFG finds an application in machine translation . References http www.iaaa.nl rs DOP.html Remko Scha Research on DOP http staff.science.uva.nl rens dop.html DOP Homepage Andy Way 1999 . A hybrid architecture for robust MT using LFG DOP. Journal of Experimental & Theoretical Artificial Intelligence 11 3 441 471. references ling stub Category Grammar frameworks Category Natural language parsing ... more details
In computer science , bottom up parsing is a strategy for analyzing unknown information that attempts ... a single unit, or start symbol , comprises all of the information being analyzed. Bottom up parsing ... down parsing , in which complex units are divided into simpler parts until all of the information is parsed. Linguistics In linguistics , an example of bottom up parsing would be analyzing a sentence ... by bottom up parsing. In this case, the most fundamental units ignoring Grammatical conjugation conjugation ... own. However, no other parsing can lead to a complete sentence using these simplified rules, as once ... can be used to find all possible parsings of the sentence if more than one parsing is possible ... language compilers, bottom up parsing is a parsing method that works by identifying terminal symbol ... to assembly language or pseudocode . Different computer languages require different parsing techniques, although it is not uncommon to use a parsing technique that is more powerful than that actually required. It is common for bottom up parsers to take the form of general parsing engines, which ... 12 , the fundamental units are a , , x , , and 12 . A parsing strategy might look like this class ... some input remaining, so the parsing had to continue. As with the linguistics example above, other parsings ... as a sum. This would have also resulted in a successfully completed parsing thus, the grammar given is ambiguous. Unlike natural languages, computer languages cannot be ambiguous, so bottom up parsing ... The common classes of bottom up parsers are LR parser LR parser Constructing LR 0 parsing tables LR ... precedence parser Bottom up parsing can also be done by backtracking . Shift reduce parsers ... of LR parsing, the parse stack contains states, rather than grammar symbols. However, since each state ... mentioned earlier. Algorithm Shift reduce parsing Start with the sentence to be parsed as the initial ... ... Noun dog cat ... pre And the input the dog jumps Then the bottom up parsing is pre Stack Input ... more details
In computer science , a parsing expression grammar , or PEG , is a type of formal grammar Analytic grammars ... in 2004 ref cite conference name pegs first Bryan p last Ford title Parsing Expression Grammars ... 729 X accessdate 2010 07 30 ref and is closely related to the family of top down parsing language ... PEGs well suited to parsing computer languages, but not natural language s. Definition Syntax Formally, a parsing expression grammar consists of A finite set N of nonterminal symbol s . A finite set of terminal symbol s that is disjoint from N . A finite set P of parsing rules . An expression e sub S sub termed the starting expression . Each parsing rule in P has the form A e , where A is a nonterminal symbol and e is a parsing expression . A parsing expression is a hierarchical expression ... fashion An atomic parsing expression consists of any terminal symbol, any nonterminal symbol, or the empty string . Given any existing parsing expressions e , e sub 1 sub , and e sub 2 sub , a new parsing expression can be constructed using the following operators Sequence e sub 1 sub e sub 2 sub ... Not predicate e Semantics The fundamental difference between context free grammars and parsing expression ... tree is selected. Like Boolean grammar boolean context free grammars , parsing expression grammars ... cannot specify the exact parse tree desired. Operational interpretation of parsing expressions Each nonterminal in a parsing expression grammar essentially represents a parsing function mathematics function in a recursive descent parser , and the corresponding parsing expression represents the code comprising the function. Each parsing function conceptually takes an input string as its ... an outcome distinct from failure. An atomic parsing expression consisting of a single ... consumes the input character otherwise the expression yields a failure result. An atomic parsing ... parsing expression consisting of a nonterminal A represents a recursion recursive call to the nonterminal ... more details
Top Down Parsing Language TDPL is a type of analytic grammar analytic formal grammar developed by Alexander Birman in the early 1970s in order to study formally the behavior of a common class of practical top down parsing top down parsers that support a limited form of backtracking . Birman originally named his formalism the TMG Schema TS , after TMG, an early parser generator , but the formalism was later given the name TDPL by Alfred V. Aho Aho and Jeffrey D. Ullman Ullman in their classic anthology The Theory of Parsing, Translation and Compiling . Definition of a TDPL grammar Formally, a TDPL grammar G is a tuple consisting of the following components A finite set N of nonterminal symbols . A finite set of terminal symbols that is disjoint from N . A finite set P of production rules , where a rule has one of the following forms A , where A is a nonterminal and is the empty string. A f , where f is a distinguished symbol representing unconditional failure . A a , where a is any terminal symbol. A BC D , where B , C , and D are nonterminals. Interpretation of a grammar A TDPL grammar can be viewed as an extremely minimalistic formal representation of a recursive descent parser , in which each of the nonterminals schematically represents a parsing function programming function . Each of these nonterminal functions takes as its input argument a string to be recognized, and yields one of two possible outcomes success , in which case the function may optionally move forward or consume one or more characters of the input string supplied to it, or failure , in which case no input ... but much more succinctly in parsing expression grammar notation as S a b and S S , respectively ... pdos.csail.mit.edu baford packrat popl04 peg popl04.pdf Parsing Expression Grammars A Recognition Based Syntactic Foundation ref Also, both TDPL and GTDPL can be viewed as very restricted forms of parsing ... Reflist 2 External links http www.pdos.lcs.mit.edu baford packrat The Packrat Parsing and Parsing Expression ... more details
Merge to command line argument date May 2010 Different Command line argument parsing methods are used by different programming languages to parse command line argument s. Programming languages C Main C syntax Command line arguments C uses code argv code to process command line arguments. ref cite web url http publications.gbdirect.co.uk c book chapter10 arguments to main.html title The C Book Arguments to main publisher Publications.gbdirect.co.uk date accessdate 2010 05 31 ref Java An example of Java programming language Java argument parsing would be source lang java public class Echo public static void main String args for String s args System.out.println s source Perl Perl uses code ARGV code . PHP PHP uses code argc code as a count of arguments and code argv code as an array computing array containing the values of the arguments. ref cite web url http php.net manual en reserved.variables.argv.php title PHP Manual publisher PHP date accessdate 2010 05 31 ref ref wikibooks PHP Programming CLI ref To create an array from command line arguments in the code foo bar code format, the following might be used source lang php args parseArgs argv echo getArg args, foo function parseArgs args foreach args as arg tmp explode , arg, 2 if arg 0 args substr tmp 0 , 1 tmp 1 return args function getArg args, arg if isset args arg return args arg return false source PHP can also use code getopt code . ref http php.net getopt ref Python Python programming language Python uses code sys.argv code , e.g. source lang python import sys for arg in sys.argv print arg source Python also has a module called code argparse code in the standard library for parsing command line arguments. ref cite web title argparse Parser for command line options, arguments and sub commands url http docs.python.org library argparse.html work Python v2.7.2 documentation accessdate 7 March 2012 ref Racket Racket programming ... reference manual, Command Line Parsing ref library for parsing these arguments. Example source lang ... more details
The Message Parsing Interpreter MPI for short, not to be confused with the Message Passing Interface is a Lisp programming language Lisp like programming language based on Cut, copy, and paste text replacement that is used on Fuzzball MUCK Fuzzball MUCK Server computing server s, starting with version 2.2fb5.00. It is generally considered easier to learn and use than MUF programming language MUF , and enjoys a large popularity among Fuzzball MUCK users. Amusingly, MPI originally stood for My Personal Insanity &mdash a temporary project name used by the programmer when it was first implemented during a 3 week coding binge. It was later backronym ed to Message Parsing Interpreter to keep the acronym, yet sound more respectable. When online, the command MPI CATEGORY provides a listing of the available MPI topics arranged by function. The most common use for MPI is for report generation and formatting text strings, however it does support the creation of macros, conditional logic, and looping for a limited number of iterations. Command Structure MPI could be viewed as a form of markup language as instructions are encapsulated within bracket marks to differentiate them from regular text. The MPI command is specified first, followed by a colon, and then command arguments, separated by commas. If one of the arguments is a string that contains a comma, it is escaped by using a backslash or the tt lit tt for literal command. pre command argument1, argument2 pre Commands can be nested, taking the place of one or more arguments within the parent command to form more complex code pre tell name me just looked at name this ., owner this pre Hello World The standard Hello World program would look like this pre tell Hello World, me pre More complex substitution More complex code in MPI may become difficult to read. Some examples This sequence informs the user of the next database save pre Next scheduled save will occur at convsecs add prop sys dumpinterval, 0 , prop sys lastdumptime ... more details
orphan date October 2009 In computer science , a left corner parser is a type of chart parser used for parsing context free grammars . It combines the top down and bottom up approaches of parsing. The name derives from the use of the left corner of the grammar s production rules. References http cs.union.edu striegnk courses nlp with prolog html node53.html Left Corner Parsing Category Parsing algorithms comp sci stub ... more details
Refimprove date December 2009 In computer science , a chart parser is a type of parsing parser suitable for ambiguous grammars including grammars of natural language s . It uses the dynamic programming approach partial hypothesized results are stored in a structure called a chart data structure chart and can be re used. This eliminates backtracking and prevents a combinatorial explosion . Chart parsing was developed by Martin Kay . ref cite web url http webdocs.cs.ualberta.ca lindek 650 papers chartParsing.pdf title Chart Parsing accessdate 20 November 2011 ref Types of chart parsers A common approach is to use a variant of the Viterbi algorithm . The Earley parser is a type of chart parser mainly used for parsing in computational linguistics , named for its inventor. Another chart parsing algorithm is the Cocke Younger Kasami algorithm Cocke Younger Kasami CYK algorithm. Chart parsers can also be used for parsing computer languages. Earley parsers in particular have been used in compiler compiler s where their ability to parse using arbitrary Context free grammars eases the task of writing the grammar for a particular language. However their lower efficiency has led to people avoiding them for most compiler work. In bidirectional chart parsing , edges of the chart are marked with a direction, either forwards or backwards, and rules are enforced on the direction in which edges must point in order to be combined into further edges. In incremental chart parsing , the chart is constructed incrementally as the text is edited by the user, with each change to the text resulting in the minimal possible corresponding change to the chart. We can distinguish Top down parsing top down and bottom up parser bottom up chart parsers, and active chart parser active and passive chart parser passive chart parsers. Parsing ambiguity in natural languages The most serious problem faced by parsers ... reflist DEFAULTSORT Chart Parser Category Natural language parsing Category Parsing algorithms ... more details
XPP may refer to Poplar River Airport , the IATA code for the airport in Canada XML Professional Publisher , a standards based, high performance, content formatting and publishing application XML Pull Parsing , a method of parsing an XML document, StAX parsers are an implementation of a pull parser. eXtreme Processing Platform , a processor architecture XPP AUT , a tool for solving stochastic, differential, and difference equations, amongst others. Microsoft Dynamics AX MorphX and X X , the programming language behind Microsoft Dynamics AX . disambig it XPP de XPP ... more details
Orphan date February 2009 In Linux , the library popt parsing parses Command line option options in command line s. References http directory.fsf.org project popt linux stub Category Linux process and task management related software ... more details
unreferenced date October 2011 Card Verifiable Certificates CVC are digital certificate s that are designed to be processed by devices with limited computing power such as smart cards . This is achieved by using simple TLV Tag Length Value encoding with fixed fields. Fixed fields means that each field in the certificate is of fixed, or maximum, length and each field comes in a well defined order. This makes parsing easy, in contrast to asn.1 parsing which requires more processing and has to keep fields in memory while parsing nested content. CVC is used by the third generation ePassports implementing Extended Access Control EAC . There are open source implementations for processing EAC CVC certificates EJBCA JMRTD, http www.jmrtd.org Category Asymmetric key cryptosystems ... more details
Unreferenced stub auto yes date December 2009 S Attributed Grammars are a class of attribute grammar s characterized by having no Attribute grammar Inherited Attributes inherited attribute s, but only Attribute grammar Synthesized attributes synthesized attribute s. Inherited attributes, which must be passed down from parent nodes to children nodes of the abstract syntax tree during the Semantic analysis computer science semantic analysis of the parsing process, are a problem for bottom up parsing because in bottom up parsing, the parent nodes of the abstract syntax tree are created after creation of all of their children. Attribute evaluation in S attributed grammars can be incorporated conveniently in both top down parsing and bottom up parsing . Specifications for parser generators in the Yacc family can be broadly considered S attributed grammars. However, these parser generators usually include the capacity to reference global variables and or fields from within any given grammar rule, meaning that this is not a pure S attributed approach. Any S attributed grammar is also an L attributed grammar . See also Attribute grammar DEFAULTSORT S Attributed Grammar Category Formal languages Category Compiler construction Prog lang stub fr Grammaire S attribu e ... more details
for information about parsing in general Parsing Refimprove date August 2007 In adventure game s, a text parser takes typed input a command from the player and simplifies it to something the game can understand. Usually, words with the same meaning are turned into the same word e.g. take and get and certain filler words are dropped e.g. articles, or the at in look at rock . The parser makes it easier for the game s author to react on input. The author does not have to write special code to process the commands get the gem , take the gem , get gem , take gem , take the precious gem , etc separately, as the parser will have stripped the input down to something like take gem . For the player, the game is more flexible, as the game has a larger vocabulary, and there are fewer guess the verb and guess the noun problems. Parsers are used in early interactive fiction games like the Zork series, and more recently in games created by systems like Inform and TADS . External links http www.inform fiction.org manual download dm4.html Inform Designers Manual in particular, see chapter 4, Describing and Parsing , and chapter 5, Natural Language Category Parsing Category Interactive fiction PAGENAME ... more details
Xerces can refer to Xerces , a family of software packages for parsing and manipulating XML. Xerces Blue , an extinct butterfly. The Xerces Society , an environmental organization that focuses on invertebrates. Xerces, a song by the Deftones . Xerces was the original French spelling of Xerxes I of Persia Xerxes the Great . See also Xerxes , the English spelling of this name disambig ... more details
Unreferenced date December 2011 In computer science , string generation is the process of creating a set of String computer science strings from a collection of rules. This is an opposite process to that of parsing , which recognises a string based on some collection of rules. Applications of string generation include test data generation, Captchas and random essay generation. Generation methods Methods for generating strings include While a deterministic finite automaton is often used to recognize strings it can easily be changed to generate strings. Unsolved problems 0Expand section date December 2011 Unsolved problems in string generation include Note It is an undecidable problem to decide whether a given string can be generated by a given Van Wijngaarden grammar W grammar . Doesn t this mean parsing as opposed to string genreation is undeciadable? See also Pretty printing &ndash another process often considered the dual of parsing. Citation needed date February 2012 External links http regldg.com Generate strings matching a regular expression http search.cpan.org dcoppit yagg 1.4001 yagg Generate strings from a yacc grammar http compilers.iecc.com comparch article 91 04 069 comp.compilers discussion http www.elsewhere.org pomo random essay random essay http embed.cs.utah.edu csmith Generate random C programs Category Algorithms on strings Category Parsing Comp sci stub ... more details
A pack rat is a small rodent in the genus Neotoma . Pack rat can also refer to A person who engages in compulsive hoarding Peter Pack Rat , a 1984 arcade game A packrat parser for parsing expression grammar Packrat Transformers , a fictional character in the Transformers universe disambiguation ... more details
wikitionary parse Parse may refer to Parsing , in computer science and linguistics, the process of analyzing text P rse or P rsa , the Persian word for Persepolis Scott Parse born 1984 , an American professional ice hockey player Pars Semiconductor Co. , an Iranian company See also Parsee disambiguation ... more details
Multiple issues unreferenced May 2011 orphan May 2011 context May 2011 expert Linguistics date May 2011 Merge to Morphological parsing date May 2011 Orthographic rules are general rules used when breaking a word into its stem and modifiers. An example would be singular English words ending with y, when pluralized, end with ies. Contrast this to Morphological rules which contain corner cases to these general rules. Both of these types of rules are used to construct systems that can do morphological parsing . linguistics stub Category Orthography Rules Category Rules ... more details
Encyclopedia
top
