| tech,12-5-H01-1041,ak | knowledge-based automated acquisition of | grammars | </term> . Having been trained on <term> Korean | #513 (iii) Rapid system development and porting to new domains via knowledge-based automated acquisition of grammars. | |
| other,5-1-P01-1007,ak | theoretical study of the <term> range concatenation | grammar | [ RCG ] formalism </term> has revealed many | #1604 The theoretical study of the range concatenation grammar [RCG] formalism has revealed many attractive properties which may be used in NLP. | |
| lr,11-3-P01-1007,ak | <term> RCG </term> , any <term> tree adjoining | grammar | </term> can be parsed in O ( n6 ) <term> time | #1668 For example, after translation into an equivalent RCG, any tree adjoining grammar can be parsed in O(n6) time. | |
| lr,11-6-P01-1007,ak | this method on a <term> wide coverage English | grammar | </term> are given . While <term> paraphrasing | #1750 The results of a practical evaluation of this method on a wide coverage English grammar are given. | |
| other,6-1-P01-1047,ak | logical definition </term> of <term> Minimalist | grammars | </term> , that are <term> Stabler 's formalization | #1934 We provide a logical definition of Minimalist grammars, that are Stabler's formalization of Chomsky's minimalist program. | |
| other,9-2-P01-1047,ak | leads to a neat relation to <term> categorial | grammar | </term> , ( yielding a treatment of <term> | #1957 Our logical definition leads to a neat relation to categorial grammar, (yielding a treatment of Montague semantics), a parsing-as-deduction in a resource sensitive logic, and a learning algorithm from structured data (based on a typing-algorithm and type-unification). | |
| lr,12-1-N03-1026,ak | techniques </term> for <term> Lexical-Functional | Grammars | ( LFG ) </term> to the domain of <term> sentence | #2798 We present an application of ambiguity packing and stochastic disambiguation techniques for Lexical-Functional Grammars (LFG) to the domain of sentence condensation. | |
| lr,8-2-H05-1101,ak | pairs of <term> probabilistic context-free | grammars | </term> working in a ' synchronous ' way | #5711 These models can be viewed as pairs of probabilistic context-free grammars working in a 'synchronous' way. | |
| other,18-3-I05-6010,ak | some kind of information other than <term> | grammar | </term> sensu stricto into the <term> treebank | #7843 Moreover, some examples are given that underline the necessity of integrating some kind of information other thangrammar sensu stricto into the treebank. | |
| lr,26-4-I05-6010,ak | on the <term> treebank </term> and on <term> | grammars | </term> induced from the <term> treebank </term> | #7876 We argue that a more sophisticated and fine-grained annotation in the treebank would have very positve effects on stochastic parsers trained on the treebank and ongrammars induced from the treebank, and it would make the treebank more valuable as a source of data for theoretical linguistic investigations. | |
| lr,15-2-P05-1067,ak | probabilistic synchronous dependency insertion | grammar | </term> . <term> Synchronous dependency insertion | #9823 In this paper, we present a syntax-based statistical machine translation system based on a probabilistic synchronous dependency insertion grammar. | |
| lr,0-3-P05-1067,ak | </term> . <term> Synchronous dependency insertion | grammars | </term> are a version of <term> synchronous | #9828 Synchronous dependency insertion grammars are a version of synchronous grammars defined on dependency trees. | |
| lr,8-3-P05-1067,ak | </term> are a version of <term> synchronous | grammars | </term> defined on <term> dependency trees </term> | #9834 Synchronous dependency insertion grammars are a version of synchronous grammars defined on dependency trees. | |
| lr,9-4-P05-1067,ak | introduce our approach to inducing such a <term> | grammar | </term> from <term> parallel corpora </term> | #9849 We first introduce our approach to inducing such agrammar from parallel corpora. | |
| lr,9-1-P05-2013,ak | automatically inducing a <term> Combinatory Categorial | Grammar | ( CCG ) lexicon </term> from a <term> Turkish | #10509 This paper presents the results of automatically inducing a Combinatory Categorial Grammar (CCG) lexicon from a Turkish dependency treebank. | |
| other,12-3-P06-1018,ak | powerful enough to strongly simulate many <term> | grammar | formalisms </term> , such as <term> rewriting | #12038 This formalism is both elementary and powerful enough to strongly simulate manygrammar formalisms, such as rewriting systems, dependency grammars, TAG, HPSG and LFG. | |
| other,20-3-P06-1018,ak | rewriting systems </term> , <term> dependency | grammars | </term> , <term> TAG </term> , <term> HPSG </term> | #12047 This formalism is both elementary and powerful enough to strongly simulate many grammar formalisms, such as rewriting systems, dependency grammars, TAG, HPSG and LFG. | |
| lr,23-2-P06-1052,ak | <term> USRs </term> computed by <term> large-scale | grammars | </term> . We evaluate the <term> algorithm </term> | #12112 The algorithm operates on underspecified chart representations which are derived from dominance graphs; it can be applied to the USRs computed by large-scale grammars. | |
| tech,22-1-P06-2001,ak | checker </term> to be integrated in a <term> | grammar | checker </term> for <term> Basque </term> . After | #12159 In this paper, we describe the research using machine learning techniques to build a comma checker to be integrated in agrammar checker for Basque. | |
| lr,11-1-P81-1033,ak | input </term> that deviates from its <term> | grammar | </term> , in addition to <term> input </term> | #13880 A flexible parser can deal with input that deviates from itsgrammar, in addition to input that conforms to it. |
