BINARY SEARCH: Related Papers in ACL Anthology

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

• (ACL ID: C04-1024) efficient parsing of highly ambiguous context-free grammars with bit vectors
• (ACL ID: C04-1147) fast computation of lexical affinity models
• (ACL ID: C69-5101) a search algorithm and data structure for an efficient information system
• (ACL ID: C94-2169) thesaurus-based efficient example retrieval by generating retrieval queries from similarities
• (ACL ID: H89-2049) speech recognition in parallel
• (ACL ID: J00-1006) multitiered nonlinear morphology using multitape finite automata
• (ACL ID: J01-1001) using suffix arrays to compute term frequency and document frequency for all substrings in a corpus
• (ACL ID: J95-2001) automatic stochastic tagging of natural language texts
• (ACL ID: P05-1032) scaling phrase-based statistical machine translation to larger corpora and longer phrases
• (ACL ID: P06-2026) chinese-english term translation mining based on semantic prediction
• (ACL ID: P90-1039) a hardware algorithm for high speed morpheme extraction and its implementation
• (ACL ID: P98-1038) pat-trees with the deletion function as the learning device for linguistic patterns
• (ACL ID: W00-1315) empirical term weighting and expansion frequency
• (ACL ID: W03-1020) a fast algorithm for feature selection in conditional maximum entropy modeling
• (ACL ID: W03-1113) dynamic programming matching for large scale information retrieval
• (ACL ID: W06-1658) entity annotation based on inverse index operations
• (ACL ID: W06-3601) a syntax-directed translator with extended domain of locality
• (ACL ID: W98-1104) using suffix arrays to compute term frequency and document frequency for all substrings in a corpus