context-free grammar parsing
Parsing Chinese With an Almost Context Free Grammar
... 2For this and all subsequent examples, a is the Chinese written form, b is its pronuncia- tion, c is its word gloss ' - - ' means there is no directly corresponding word in Engfish, and[r] ...
10
Data Recombination for Neural Semantic Parsing
... semantic parsing, we construct a genera- tive model by inducing a synchronous context-free grammar (SCFG), creating new examples such as those shown in Figure 1; our domain-general model is a ...
11
A Practical Algorithm for Intersecting Weighted Context free Grammars with Finite State Automata
... defined parsing as the intersection of a context-free language (given by a grammar) with a regular language (the “input”, which can be seen as a simple finite-state automaton) the importance ...
8
Issues Concerning Decoding with Synchronous Context free Grammar
... ) time parsing. However, bina- rization creates a large number of virtual nontermi- nals. We discuss the challenges of, and possible so- lutions to, issues arising from having a large num- ber of virtual ...
5
Response Generation in Dialogue Using a Tailored PCFG Parser
... a parsing paradigm for natural language generation task, which learns a tailored probabilistic context-free grammar for encoding meaning represen- tation (MR) and its corresponding natural ...
5
Compound Probabilistic Context Free Grammars for Grammar Induction
... to grammar induction. In particular, the constituent-context model (CCM) of Klein and Manning (2002), which explicitly models both constituents and dis- tituents, was the basis for much subsequent work ...
17
LCFRS binarization and debinarization for directional parsing
... data-driven parsing with Linear Context-Free Rewriting System (LCFRS), markovized gram- mars are obtained through the annotation of bi- narization non-terminals during grammar bina- rization, ...
7
Deep Context Free Grammar for Chinese with Broad Coverage
... Such inferior performances can be the result of several factors. One of them being that Chinese is an isolating language. Verbs and nouns of Chinese have little morphological paradigms so that the surface syntactic ...
9
An Efficient Probabilistic Context Free Parsing Algorithm that Computes Prefix Probabilities
... We describe an extension of Earley's parser for stochastic context-free grammars that computes the following quantities given a stochastic context-free grammar and an input string: a pro[r] ...
38
Left To Right Parsing and Bilexical Context Free Grammars
... Abstract We compare the asymptotic time complexity of left-to-right and bidirectional parsing techniques for bilexical context-free grammars, a grammar formalism that is an abstraction o[r] ...
8
Unary Constraints for Efficient Context Free Parsing
... While there have been great advances in the statis- tical modeling of hierarchical syntactic structure in the past 15 years, exact inference with such models remains very costly and most rich syntactic mod- eling ...
6
Automatic Learning of Context-Free Grammar
... The top-20 rules learned from ASBC are listed in Table 3. In this table, we also in- clude examples of words and sentences from ASBC. In addition, the definition and more examples of the part-of-speech tags are listed in ...
10
A Probabilistic Context free Grammar for Disambiguation in Morphological Parsing
... Since the pronunciation of a word does not always consists of the concatenation of the pronunciation of the morphemes, because the pronunciation of mor- phemes can be modified in certain[r] ...
10
Algebraic Parsing of Context Free Languages
... A grammar is used to characterize a parsing homomorphism which maps terminal strings to a.. The image of a string under an.[r] ...
23
Context Free Grammar Analysis for Arabic Sentences
... Parsing (syntactic analysis) is the process of mapping the sen- tence (string of words) to its parse tree. To do that, an efficient Context-Free Grammar (CFG), which defines the language, is ...
5
Improving Semantic Parsing with Enriched Synchronous Context Free Grammar
... tic parsing (Papineni et ...semantic parsing with SCFGs, which form the ba- sis of most existing statistical syntax-based trans- lation models (Yamada and Knight, 2001; Chiang, 2007), achieves favorable ...
11
1. Natural language parsing using fuzzy canonical lr (1) parser
... Fuzzy context-free grammar itself consists of a finite set of rules called ...Fuzzy Context-Free Grammar (FCFG), as a straightforward extension of ...
5
A Wide-Coverage Context-Free Grammar for Icelandic and an Accompanying Parsing System
... general parsing algorithms that can handle am- biguous grammars, being of worst-case cubic or- der (Younger, 1967; Scott, 2008), have also been seen as ...Beyond parsing, hand-crafted CFGs can be used inter ...
8
Accurate Context Free Parsing with Combinatory Categorial Grammar
... If we assume that type-raising is restricted to those instances occurring in CCGbank 4 , then a CCG consisting of schema classes (1-3), (6-7) and (10-11) can generate all the derivations in CCG- bank. By proposition 3, ...
10
Discontinuous Data Oriented Parsing: A mildly context sensitive all fragments grammar
... In the present paper we do not deal with evaluation methods, but we take up another, related point. A precondition for a cognitively viable model of exemplar-based syntactic processing, is a cognitively viable definition ...
11