A derivational model of discontinuous parsing | 0 | 0.34 | 2021 |
Regular transductions with MCFG input syntax. | 0 | 0.34 | 2019 |
Calculating the Optimal Step in Shift-Reduce Dependency Parsing: From Cubic to Linear Time. | 0 | 0.34 | 2019 |
A Derivational Model of Discontinuous Parsing. | 1 | 0.35 | 2017 |
Hybrid Grammars for Parsing of Discontinuous Phrase Structures and Non-Projective Dependency Structures. | 0 | 0.34 | 2017 |
A Probabilistic Model of Ancient Egyptian Writing. | 0 | 0.34 | 2017 |
Non-Self-Embedding Linear Context-Free Tree Grammars Generate Regular Tree Languages. | 0 | 0.34 | 2016 |
A Short Proof That O-2 Is An Mcfl | 0 | 0.34 | 2016 |
Parsing and finite-state technologies, introduction to the special issue. | 0 | 0.34 | 2016 |
DTED: Evaluation of Machine Translation Structure Using Dependency Parsing and Tree Edit Distance. | 2 | 0.39 | 2016 |
A short proof that O_2 is an MCFL. | 0 | 0.34 | 2016 |
Count-based State Merging for Probabilistic Regular Tree Grammars. | 0 | 0.34 | 2015 |
Tree parsing for tree-adjoining machine translation. | 2 | 0.37 | 2014 |
Prefix probabilities for linear context-free rewriting systems | 1 | 0.37 | 2014 |
Deterministic Parsing using PCFGs. | 1 | 0.36 | 2014 |
On LR parsing with selective delays | 0 | 0.34 | 2013 |
Synchronous Context-Free Tree Grammars. | 0 | 0.34 | 2012 |
Formal Grammar - 15th and 16th International Conferences, FG 2010, Copenhagen, Denmark, August 2010, FG 2011, Ljubljana, Slovenia, August 2011, Revised Selected Papers | 19 | 1.50 | 2012 |
IDL-expressions: a formalism for representing and parsing finite languages in natural language processing | 9 | 0.73 | 2011 |
Computation of infix probabilities for probabilistic context-free grammars | 3 | 0.41 | 2011 |
Prefix probability for probabilistic synchronous context-free grammars | 3 | 0.41 | 2011 |
Splittability of bilexical context-free grammars is undecidable | 0 | 0.34 | 2011 |
Intersection for weighted formalisms | 0 | 0.34 | 2011 |
Parsing of partially bracketed structures for parse selection | 0 | 0.34 | 2011 |
Tree parsing with synchronous tree-adjoining grammars | 3 | 0.37 | 2011 |
Transforming lexica as trees | 0 | 0.34 | 2010 |
Weighted parsing of trees | 4 | 0.41 | 2009 |
Automatic Creation Of Interlinear Text For Philological Purposes | 0 | 0.34 | 2009 |
Computation of distances for regular and context-free probabilistic languages | 9 | 0.63 | 2008 |
LEXUS, a web-based tool for manipulating lexical resources lexicon. | 0 | 0.34 | 2006 |
Estimation of consistent probabilistic context-free grammars | 6 | 0.50 | 2006 |
Gap Parsing with LL(1) Grammars | 2 | 0.36 | 2005 |
Parsing Partially Bracketed Input | 2 | 0.48 | 2005 |
A General Technique to Train Language Models on Language Models | 11 | 0.83 | 2005 |
Fast parallel recognition of LR language suffixes | 0 | 0.34 | 2004 |
An alternative method of training probabilistic LR parsers | 3 | 0.39 | 2004 |
The language intersection problem for non-recursive context-free grammars | 8 | 0.68 | 2004 |
Kullback-Leibler distance between probabilistic context-free grammars and probabilistic finite automata | 7 | 0.55 | 2004 |
Tabular Parsing | 1 | 0.36 | 2004 |
Effective dimensions of hierarchical latent class models | 7 | 0.65 | 2004 |
Weighted deductive parsing and Knuth's algorithm | 36 | 1.90 | 2003 |
PARTIALLY ORDERED MULTISET CONTEXT-FREE GRAMMARS AND FREE-WORD-ORDER PARSING | 3 | 0.45 | 2003 |
Parsing non-recursive CFGs | 2 | 0.53 | 2002 |
Probabilistic parsing strategies | 6 | 0.53 | 2002 |
Size/lookahead tradeoff for LL(k)-grammars | 6 | 0.62 | 2001 |
On the Complexity of Some Extensions of RCG Parsing | 13 | 1.09 | 2001 |
Approximating context-free by rational transduction for example-based MT | 0 | 0.34 | 2001 |
Left-to-right parsing and bilexical context-free grammars | 1 | 0.36 | 2000 |
Preprocessing for Unification Parsing of Spoken Language | 0 | 0.34 | 2000 |
Practical experiments with regular approximation of context-free languages | 44 | 3.76 | 2000 |