[PDF] Top 20 A Parsing Algorithm for Unification Grammar

... So if a is a sentence, the parser with the ideal prediction table includes Start in drO,L, and so does the parser with the weak prediction table.[].. 7 DISCUSSION AND IMPLEMENTATION NOTE[r] ... See full document

... Natural language systems based on Categorial Unifica- tion Grammar CUG have mainly employed bottom- up parsing algorithms for processing.. Conventional prediction techniques to improve t[r] ... See full document

... The paper demonstrates that exponential complexities with respect to grammar size and input length have little impact on the performance of three unification-based parsing algorithms, us[r] ... See full document

... The new language processor proposed in this paper actually integrates the unification grammar and the Markov language model by a new preference-f'u-st parsing algorithm with various pref[r] ... See full document

... TAG, parsing with STUG can be conducted in a fully connected manner even for sentences like John sometimes laughs, as the derivation in Figure 2 can be read off from the left to the ... See full document

... before unification is attempted by a check on which rules can dominate which others, and the quick-check, as developed for unification-based parsing ...to unification failure in parsing ... See full document

... Although implementing DUG as DCG works acceptably, it makes no use of the rules' regular form: note how, w h e n parsing the sentence "Mark sleeps," the parser calls several rules before[r] ... See full document

... and unification-based syntactic parsing can be seen as two dif- ferent steps, where the robustness of the former remedies some of the deficiencies of the ...the unification-based approach is richer ... See full document

... 1965 International Conference on Computational Linguistics SOME COMMENTS ON ALGORITHM AND GRAMMAR IN THE AUTOMATIC PARSING OF NATURAL LANGUAGES 9 "1965 International Conference on Computational Lingui[.] ... See full document

... the algorithm does not succeed even in some cases for which such a binarization is ...their algorithm, but they do not give the fan-out or parsing complexity of the resulting ...be parsing in ... See full document

... For a common special case that was known to allow On 3 parsing Eisner, 1997, we present an On 3 algorithm with an improved grammar constant.. Lexicalized grammar formalisms are of both t[r] ... See full document

... of logic programming languages, define a fixpoint semantics for unification-based grammars by taking the least fixpoint of the parsing step operator as the denotation of a grammar... Fig[r] ... See full document

... V&W algorithm and the one presented in this article is the use of different decompositions for CCG ...our algorithm we allow the excess of a derivation context to be the empty list of arguments, ... See full document

... generateSign generates a sign Sign with phonology ~ , syntactic category K and semantics Z by creating a new sign SignO with phonology ~', syntactic category K' and semantics Z, unifying[r] ... See full document

... First, Mizutani's theory of honorific expression actl3] is introduced to define basic honorific attitude types used in specifying pragmatic constraints on the use of Japanese honorifics.[r] ... See full document

... In order to solve these anaphors we work on the output of a part-of-speech tagger, on which we automatically apply a partial parsing from the formalism: Slot Unification Grammar, which h[r] ... See full document

... It is shown that referring expressions can be gener- ated by a unification grammar provided that some phrase-structure rules are spe- cially tailored to express entities in the current k[r] ... See full document

... Such grammar entries specify what information is known about the phrase structure of the sentence given the presence of the word, and can be used Henderson, 1990 to simulate Lexicalized [r] ... See full document

... 1 For instance, in Joe gave Mary tea there are, at the clause level, four sister arcs arcs with the same source node, as shown in Figure h one arc labeled [HI with target gave, indicatin[r] ... See full document

... The known proofs that the equivalence and containment problems for regular expressions, regular grammars and nondeterministic finite automata are PSPACE-complete that depends upon consideration of highly unambiguous ... See full document