COMPLEXITY ANALYSIS: Related Papers in ACL Anthology

COMPLEXITY ANALYSIS can be found in the following ACL ARC 1.0 documents (click to explore):

• (ACL ID: C90-3013) efficient disjunctive unification for bottom-up parsing
• (ACL ID: C94-1076) minimal change and bounded incremental parsing
• (ACL ID: E91-1012) non-deterministic recursive ascent parsing
• (ACL ID: E91-1037) computational aspects of m-grammars
• (ACL ID: E93-1041) a tradeoff between compositionality and complexity in the semantics of dimensional adjectives
• (ACL ID: J03-1005) word reordering and a dynamic programming beam search algorithm for statistical machine translation
• (ACL ID: J82-3001) computational complexity and lexical-functional grammar
• (ACL ID: J85-4001) on the complexity of id/lp parsing
• (ACL ID: J86-2002) summarizing natural language database responses
• (ACL ID: J90-4003) technical correspondence
• (ACL ID: J95-2002) an efficient probabilistic context-free parsing algorithm that computes prefix probabilities
• (ACL ID: J95-2004) deterministic part-of-speech tagging with finite-state transducers
• (ACL ID: P01-1007) guided parsing of range concatenation languages
• (ACL ID: P01-1065) a generic approach to parallel chart parsing with an application to lingo
• (ACL ID: P83-1021) parsing as deduction
• (ACL ID: P84-1055) a computational theory of the function of clue words in argijment understanding
• (ACL ID: P86-1006) computational complexity of current gpsg theory
• (ACL ID: P87-1034) revised generalized phrase structure grammar
• (ACL ID: P94-1040) relating complexity to practical performance in parsing with wide-coverage unification grammars
• (ACL ID: P97-1057) string transformation learning
• (ACL ID: W00-0107) a measure of semantic complexity for natural language systems
• (ACL ID: W00-0739) learning from a substructural perspective
• (ACL ID: W04-0306) an efficient algorithm to induce minimum average lookahead grammars for incremental lr parsing
• (ACL ID: W04-2805) scalable construction-based parsing and semantic analysis
• (ACL ID: W05-1506) better k-best parsing
• (ACL ID: W05-1604) real-time stochastic language generation for dialogue systems
• (ACL ID: W06-1658) entity annotation based on inverse index operations
• (ACL ID: W06-3602) efficient dynamic programming search algorithms for phrase-based smt
• (ACL ID: W94-0204) default finite state machines and finite state phonology
• (ACL ID: W98-0507) integration of syntactic and lexical information in a hierarchical dependency grammar
• (ACL ID: W99-0701) unsupervised learning of word boundary with description length gain