More Publications (33)

1A Robust Parser Based on Syntactic Information1: SCAN processing deletion, and mutation errors of terminal symbols. The objective of this algorithm is to parse input...

2Chinese Numbers, MIX, Scrambling, and Concatenation Grammars Range1999  Pierre Boullipredicate names, T and V are finite, disjoint sets of terminal symbols and variable symbols respectively, S E N is the start...

3Fast Full Parsing by LinearChain Conditional Random Fieldsphrases, and converts the identified phrases to nonterminal symbols. It then performs chunking for the updated sequence...

4Manually constructed contextfree grammar for Myanmar syllable structure2012  Tin Htay Hlaingtopmost row represents terminal symbols whereas the leftmost column represents the non terminal symbols. The entries in the...

5The Recognition Capacity Of Local Syntactic Constraints1991  Mori Rimonthe tag set T  the set of wordclass tags used as terminal symbols in a given grammar G. Typically, M=N, but in a more...

6Parsing the Wall Street Journal with the InsideOutside Algorithm(X i ~ tin) with very low • probability for all nonterminal symbols. This case will not happen if the training is repr...

7Stochastic HPSG1995  Chris Brew> , where W is a Set of terminal symbols {wl, . . . , w~}, N is a set of nonterminal symbols {N1, . . . ,N~}, N1 is...

8Talking About Treesthe set of nonterminal symbols, is {S, NP, VP, N, V, DET, CONJ }; where T, the set of terminal symbols, is {the, a, man...

9Making Tree Kernels Practical for Natural Language Learning2006  Alessandro Moschittirighthand side are associated with its children. The terminal symbols of the grammar are always associated with the leaves...

10XMG  An Expressive Formalism for Describing TreeBased Grammarsa Definite Clause Grammar (or DCG). In this DCG, the terminal symbols are descriptions. To extend the approach to the re...

11Machine Translation, Linguistics, And Interlingua1987  Petr Sgall,Jarmila Panevovaoperational criteria, and it ensures both economy \[no nonterminal symbols are present in the representations although as man N...

12The Use of Shared Forests in Tree Adjoining Grammar Parsing1993  K. VijayShankerset of nonterminals symbols, VT is a finite set of terminal symbols, S E V/v is the start symbol, I is a finite set of...

13Inheritance and the CCG Lexicon2006  Mark McConvilleits most basic conception, a CCG over alphabet Σ of terminal symbols is an ordered triple 〈A,S, L〉, where A is an alphabet...

14Bidirectional Parsing Of Lexicalized Tree Adjoining Grammars1991  Alberto Lavelli,Giorgio Sattawhere VN is a finite set of nonterminal symbols, Vy is a finite set of terminal symbols, Se VN is the start symbol, 1 and...

15ReRanking Models for Spoken Language UnderstandingAn STF is a general subtree whose leaves can be nonterminal symbols. For example, Figure 1(a) shows 10 STFs (out of 17)...

16Enhancing Unlexicalized Parsing Performance Using a Wide Coverage Lexicon, Fuzzy TagSet Mapping, and EMHMMBased Lexical Probabilitiestag(s) (tKC). The KC tag then ultimately generates the terminal symbols (w). We assume that a morphological analyzer assigns...

17Dependency Trees and the Strong Generative Capacity of CCG2009  Alexander Koller,Marco Kuhlmannan alphabet of nonterminal symbols, Σ is an alphabet of ranked term constructors called terminal symbols, S ∈ N is a distinguished...

18Syntactic and Semantic Kernels for Short Text Pair Categorization2009  Alessandro Moschittin1 and n2 have only leaf children (i.e. they are preterminal symbols) then ∆(n1, n2) = λ; 3. if the productions at n1 and...

19Literal Movement Grammars1995  Annius V. GroeninkWe fix disjoint sets N, T, V of nonterminal symbols, terminal symbols and variables. We will write A, B, C . . . to denote...

20The Problem of Computing the Most Probable Tree in DataOriented Parsing and Stochastic Tree Grammars1995  Rens Badfinite set of nonterminal symbols. Vr is a finite set of terminal symbols. S ~ VN is the distinguished symbol. R is a finite...

21Tabular Algorithms for TAG Parsingwhere VN is a finite set of nonterminal symbols, VT a finite set of terminal symbols, S the axiom of the grammar, I a...

22A Morphological Processor For Modern Greek1987  Angela Ralli,Eleni GaliotouGV=(VTv , SV, gV, E), where, VTV = a vocabulary of terminal symbols. E=a subset of the set of in tegers . SV @ ~(E)...

23An Extension of Earley's Algorithm for SAttributed Grammars1991  Nelson Correafinite set of string categories; T a finite set of terminal symbols; P a finite set of productions or rewriting rules of...

24Deterministic Parsing And Unbounded Dependencies1987  Ted Briseoedomain in the left context and two (not neccssafily terminal) symbols in the right context (eg. Berwick, 1985:313f). However...

25A Modular Approach To Story Generation1989  Lyn Pembertonfacts stored in the Story World database, until the terminal symbols are reached. Recursion allows for repeated attempts...

26Processing Language with Logical Types and Active Constraints1991  Patrick SaintDiziersuccessfully ends when all subtypes corresponding to terminal symbols are in a final state and it fails if a terminal type...

27StructureDriven Generation From Separate Semantic Representations1991  Stephan BusemannEnglish fragments mainly differ with regard to their terminal symbols. 3This interface does not correspond to the common...

28Using an Annotated Corpus as a Stochastic Grammar1993  Rens BodTreebank uses a relatively rich partofspeech system (48 terminal symbols), there are only 15 nonterwinal symbols. Especially...

29A Comparison of Syntactically Motivated Word Alignment Spaces2006  Colin Cherry,Dekang Linalignment. ITGs are transduction grammars because their terminal symbols can produce tokens in both the English and Foreign sentences...

30Incremental Parsing with Parallel Multiple ContextFree Grammars2009  Krasimir Angelovdimension is given for each A ∈ N . • T is a finite set of terminal symbols which is disjoint with N . • F is a finite set of functions...

31Treebank Grammar Techniques for NonProjective Dependency Parsing2009  Marco Kuhlmann,Giorgio Sattathe lefthand side of the equation and the alphabet of terminal symbols in which each variable appears exactly once. The production...

32Deterministic ShiftReduce Parsing for UnificationBased Grammars by Using Default Unificationselects the most probable shift/reduce actions and nonterminal symbols without assuming explicit CFG rules. Therefore, his...

33Tree Representations in Probabilistic Models for Extended Named Entities Detection2012  Marco Dinarelli,Sophie RossetXi ⇒ w where X are nonterminal entities and w are terminal symbols (words in our case).1 The probability associated to...