[PDF] Top 20 Unification based Multimodal Parsing

... A broad range of multimodal utterances are supported including combination of speech with multiple gestures and visual parsing of collections of gestures into complex unimodal commands..[r] ... See full document

... Unification based Multimodal Parsing Unification based Multimodal Parsing Michael Johnston Center for Human Computer Communication D e p a r t m e n t o f C o m p u t e r S c i e n c e a n d E n g i n[.] ... See full document

... 13 The first point of using the morphological analyzer in the parser is to get as much linguistic information about a single word form as possible.. The second point is using the basic p[r] ... See full document

... effective parsing and understanding of utterances whose content is dis- tributed across multiple input ...a unification-based grammar that is used by a multi- dimensional chart parser to compose ... See full document

... is based on the idea that every stage of analysis must be treated with the most robust and efficient strategy, and that the results obtained at each stage must be the input of the next ... 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

... In an actual parsing application a SUBG might be used to identify the correct parse from the set of grammatical parses, so our first evaluation measure counts the number Co~test of sente[r] ... See full document

... Unification grammars on typed directed acyclic graphs have been explored previously in MMI, but typically extend existing mechanisms not designed for multi-dimensional input. For example, both (Holzapfel et al., ... See full document

... Studies of robust parsing within unification-based grammars have been explored by many researchers (Douglas and Dale, 1992; Imaichi and Matsumoto, 1995). They classified the errors found in analyzing ... See full document

... Semi-automatic parsing of the training corpus yields a set of LR parse histories that are used to construct the probabilistic version of the LALR1 parse table.. Each row of the parse tab[r] ... See full document

... 1990, 'Reversible Unification Based Machine ~l~anslation', in Proceedings of the 13th In- ternational Conference on Computational Linguis- tics, Helsinki... Warren 1983, 'Parsing as dedu[r] ... See full document

... a parsing state as the product of the probabilities of selecting actions that have been taken to reach the ...hence, parsing is very slow or cannot be processed in a reasonable ... See full document

... An Empirical Study on Rule Granularity and Unification Interleaving Toward an Efficient Unification Based Parsing System A n E m p i r i c a l S t u d y on R u l e G r a n u l a r i t y and U n i f i[.] ... See full document

... underlying unification gram- ...underlying unification grammar to produce a certain “diacritic” feature in a parse just in case the parse ac- tually contains the appropriate reduced relative con- ... 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

... 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

... We describe the sources of the nonminimal derivation problem, and propose a precise definition of minimal parse tree, as well as a modification to Shieber's algorithm which ensures minim[r] ... See full document

... For example, if a given speech input can be integrated with a line gesture, it can be assigned a feature structure with an underspecified location feature whose value is required to be o[r] ... See full document

... Abstract. Several calculi for quantified Boolean formulas (QBFs) ex- ist, but relations between them are not yet fully understood. This paper defines a novel calculus, which is resolution-based and enables ... See full document