generating with unification grammars

Ngày tải lên: 24/03/2014, 02:20

... complex unification- based gram- mars: in particular, with grammars admitting less ambiguity parse time will tend to increase more slowly with increasing input length, and also with smaller grammars ... given point with rules with the same number of daughters, the packed sequences can be formed into higher-level constituents as they stand without further processing. However, in the unification ... parsing of natural language (corpora) with unification- based grammars. " Computational Linguistics, 19(1): 25-59. Carroll, J. (1993) Practical unification- based pars- ing of natural...

Ngày tải lên: 20/02/2014, 21:20

... indices. Specifically, an active edge with category A( )/C(c ) (with c the se- mantics index of the missing component) is re- stricted to combine with inactive edges with cate- gory C(c ), and vice ... to generate with DGs. In Section 5, we compare our generator with top-down and bottom-up generators, Section 6 reports on a proof-of-concept implementation and Section 7 concludes with pointers ... variable is identified with exactly one positive node variable, each positive node vari- able with exactly one negative node variable and neutral node variables are not identified with any other node...

Ngày tải lên: 20/02/2014, 18:20

... Algebraic Properties = V + U = V # [4] unification of constants: Cl + C2 = Cl, if C1 = C2 [5] unification of lists: [UI:U2] + [VI:V2] = [UI+VI:U2+V2] [6] unification of trees: U0(UI, ,Un) ... plunder his work for German examples. - 189 - A rich environment for experimentation with unification grammars R. Johnson & M. Rosner IDSIA, Lugano ABSTRACT This paper describes some ... this result set is empty, the unification fails immedi- ately, i.e. I0 is inconsistent with K0. Otherwise, we allow the process to continue, breadth first, only with those <Ji,Li> pairs...

Ngày tải lên: 22/02/2014, 10:20

... to- gether in a same formalism by synchronization of the grammars, as we show with our translation of LFG. Thus PUGs extend unification grammars based on feature structures by allowing a greatest ... rewriting grammars, TAG, HPSG and LFG. We hope that these translations shed light on some common features of these formalisms. 2 Polarities and unification 2.1 Polarized Unification Grammars ... allows translating the parsing with PUG into a problem of constraint resolution (Duchier & Thater, 1999). 3 Examples of PUGs 3.1 Tree grammars The first tree grammars belonging to the para- digm...

Ngày tải lên: 08/03/2014, 02:21

... For list grammars, this number is the sum of the lengths of all rules in the grammar. For trie grammars, it is the number of unique rule prefixes (including the LHS) in the grammar. For minimized grammars, ... left-corner chart parsing for large context-free grammars. In Pro- ceedings of the Sixth International Workshop on Parsing Technologies. Parsing with Treebank Grammars: Empirical Bounds, Theoretical Models, ... signature and a span . If we align the tags in with words in and align the categories in with spans of words in , then pro- vided the categories align with a non-empty span (for NOEMPTIES) or any...

Ngày tải lên: 17/03/2014, 07:20

Ngày tải lên: 17/03/2014, 20:20

Ngày tải lên: 24/03/2014, 02:20

Ngày tải lên: 24/03/2014, 03:20

... paper proposes a method for generating a logical- constraint-based internal representation from a unifica- tion grammar formalism with disjunctive information. Unification grammar formalisms ... to understand. Parsing with term-based internal representations is more efficient than parsing with graph-based representations. Therefore, it is effective to translate unification grammar formalism ... represents a disjunct. 3.2 Unification by Logical Constraint Transformation Unification of DFSs corresponds to logical constraint satisfaction. For example, the unification of DFSs p(X) and...

Ngày tải lên: 20/02/2014, 18:20

... generation grammars are written with the GF grammar formalism. GF is being further developed in the project to adapt it to the use in spoken dialogue systems. This adaptation includes the facility of generating ... includes the facility of generating Nu- ance recognition grammars from the interpretation grammar and the possibility of generating corpora from the grammars. The interpretation grammar for the domain, ... models interpolated with the GSLC corpus and the domain news corpus in different ways which at best gives a relative reduction in WER of 8% in comparison with MP3GFLM and 43% compared with the base- line....

Ngày tải lên: 22/02/2014, 02:20

... shift-reduce parsing for unification- based grammars. Sections 2 and 3 explain unification- based grammars and default unification, respectively. Shift-reduce parsing for unification- based gram- mars ... without default unification achieved high accuracy, with an LF of around 87.0%, but is still worse than deterministic parsing with default unification. However, with default unification, it ... parsing without default unification, how- ever, seems to have saturated around 83.3%. Table 1 also shows that deterministic parsing with default unification achieved higher accuracy, with an...

Ngày tải lên: 22/02/2014, 02:20

... there is a highly tractable algorithm for the unification of HoXF's. 1. PRELIMINARY CONCEPTS 1.1 Unification- based grammar formalisms Unification- based grammar formalisms constitute ... not yet actually part of it. The root node is denoted by ®, and nodes with value T are denoted with a Note that paths with common virtual end labels (e.g., AA and B) are not coalesced; virtual ... queue. In other words, we perform a unification to match common in- formation, and then continue with the inference pro- cess. 4.6 The complexity of the unification algo- rithm Define the...

Ngày tải lên: 22/02/2014, 10:20

... proba- bilistic context-free grammars. Association for Com- putational Linguistics. Sangati, Federico and Zuidema, Willem 2011. Accurate Parsing with Compact Tree-Substitution Grammars: Double-DOP. ... native language detection has been mainly associated with the ICLE, published in 2002. Koppel et al (2005) first constructed such a system with a feature set consisting of function words, POS ... dimensionality, but failed to outperform baseline systems with this approach. 193 References Mohit Bansal and Dan Klein 2010. Simple, accurate parsing with an all-fragments grammar. Association for Computational...

Ngày tải lên: 07/03/2014, 18:20

... 01, Om, with diagonal covariance, and with standard deviation aj for 0j equal to 7 times the maximum value of fj found in any parse in the training corpus. (We experimented with other ... quality of solutions de- grade) rapidly with the number of features. 5 Empirical evaluation Ron Kaplan and Hadar Shemtov at Xerox PArtC provided us with two LFG parsed corpora. The Verbmobil ... (Maxwell III and Ka- plan, 1995) of the grammatical parses of each sentence with respect to Lexical-Functional grammars. The corpora also indicate which of these parses is in fact the correct...

Ngày tải lên: 08/03/2014, 06:20

... interpretations and scope ambiguities, which may occur in connection with nested postnominal modifiers or relative clauses that depend on an NP with a postnominal modi- fier. Examining these structures ... identified uniquely> then <exit with an identifying description> if <the complexity limit of the expression is reached> then <exit with a non-identifying description> ... algorithm for generating referential descriptions which exhibits some extraordinary capabilities: • Descriptors can be selected in a goal-driven and incre- mental fashion, with contributions...

Ngày tải lên: 08/03/2014, 21:20

... Models without QG with QG O2 79.67 81.04 (+1.37) O2sib 79.25 80.45 (+1.20) O1 76.73 79.04 (+2.31) Li11 joint 80.79 — Li11 pipeline 79.29 — Table 5: Parsing accuracy (UAS) comparison on CTB5- test with ... Parser-O2 with AUTO-POS We then try to gain more insights into the effect of the QG features through detailed analysis. We se- lect the state-of-the-art O2 parser and focus on the realistic scenario with ... with 21 sibling TPs and 22 grand TPs. Based on these TPs, we propose the QG fea- tures for enhancing the baseline parsing models, which are shown in Table 2. The type of the TP is conjoined with...

Ngày tải lên: 16/03/2014, 19:20

... First, we compared the performance of λ-WASP with and without conjunct regrouping (Section 4). Second, we compared the performance of λ-WASP with and without language modeling for the MRL (Section ... linked to the MRL production, with non-terminals A 1 , . . . , A n showing the posi- tions of the argument strings; (2) β ′ is β with each non-terminal A j replaced with A j (x j 1 , . . . , x j k j ), where ... syntax-based translation models between natural languages (NL). In generating multiple parse trees in a single deriva- tion, synchronous grammars are ideal for model- ing syntax-based translation because...

Ngày tải lên: 17/03/2014, 04:20

... Parsing preferences with Lexicalized Tree Adjoining Grammars : exploiting the derivation tree Alexandra KINYON TALANA Universite ... attachment" (MA) are often formulated with respect to constituent trees. We present 3 preference principles based on "derivation trees" within the framework of LTAGs. We argue ... of natural language 1. Large coverage grammars were developed for English (Xtag group (95)) and French (Abeille (91)). Unfortunately, "large" grammars yield high ambiguity rates :...

Ngày tải lên: 17/03/2014, 07:20

Ngày tải lên: 17/03/2014, 08:20