Contextually-related Entities - UW Faculty Web Server上下文相关的实体-威斯康星大学教师的Web服务器.pptVIP

Integrating Finite-state Morphologies with Deep LFG Grammars Tracy Holloway King FST and deep grammars Finite state tokenizers and morphologies can be integrated into deep processing systems Integrated tokenizers eliminate the need for preprocessing allow the grammar writer more control over the input Morphologies eliminate the need to list (multiple) surface forms in the lexicon eliminate the need for lexical entries for words with predictable subcategorization frames Talk outline Basic integrated system Integrating morphology FSTs Interaction of tokenization and morphology Basic Architecture Example steps through the system Input string: Boys appeared. Tokenizing: boys TB appeared TB . TB Morphology: boy + Noun +Pl appear +Verb +PastBoth +123SP . +Punct C-structure/F-structure: next slides C-structure tree F-structure AVM The wider system: XLE Handwritten grammars for various languages Substantial for English, German, Japanese, Norwegian Also: Arabic, Chinese, Urdu, Korean, Welsh, Malagasy, Turkish Robustness mechanisms Fragment grammar rules Morphological guessers Skimming when resource limits approached Ambiguity management (packing) Compute all analyses (no “aggressive pruning”) Propagate packed ambiguities across processing modules Stochastic disambiguation MaxEnt models to select from packed (f-)structures Other processing available: generation, semantics, transfer/rewriting Comparisons to other systems/tasks Parsing WSJ (Riezler et al, ACL 2002) Comparison to Collins model 3 (Riezler et al, NAACL 2004) FST Morphologies Associate surface form with a lemma (stem/canonical form) a set of tags Process is non-deterministic can have many analyses for one surface form grammar has to be able to deal with multiple analyses (morphological ambiguity) Issue: can the grammar control rampant morphological ambiguity? Arabic vowelless representations Example Morphology Output turnips = turnip +Noun +Pl Mary = Mary +Prop +Giv +Fem +Sg falls = fall +Noun +Pl