MATRIX MULTIPLICATION: Related Papers in ACL Anthology

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

• (ACL ID: E06-1013) generalized hebbian algorithm for incremental singular value decomposition in natural language processing
• (ACL ID: J84-3001) on the mathematical properties of linguistic theories
• (ACL ID: J86-1002) the correction of ill-formed input using history-based expectation with applications to speech understanding
• (ACL ID: J91-3003) the generative power of categorial grammars and head-driven phrase structure grammars with lexical rules
• (ACL ID: J94-2002) tree-adjoining grammar parsing and boolean matrix multiplication
• (ACL ID: J95-2002) an efficient probabilistic context-free parsing algorithm that computes prefix probabilities
• (ACL ID: P05-1047) a semantic approach to ie pattern induction
• (ACL ID: P83-1014) a finite-state parser for use in speech recognition
• (ACL ID: P95-1023) tal recognition in o(m(n2)) time
• (ACL ID: P97-1002) fast context-free parsing requires fast boolean matrix multiplication
• (ACL ID: W03-0613) learning word meanings and descriptive parameter spaces from music
• (ACL ID: W04-1305) grammatical inference and first language acquisition
• (ACL ID: W04-2902) analysis and processing of lecture audio data
• (ACL ID: W05-0206) automatic essay grading with probabilistic latent semantic analysis
• (ACL ID: W05-1502) parsing linear context-free rewriting systems
• (ACL ID: W06-3801) a graphical framework for contextual search and name disambiguation in email
• (ACL ID: W06-3812) chinese whispers - an efficient graph clustering algorithm and its application to natural language processing problems