SUFFIX TREE: Related Papers in ACL Anthology

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

• (ACL ID: C96-2130) learning part-of-speech guessing rules from lexicon
• (ACL ID: C96-2151) handling sparse data by successive abstraction
• (ACL ID: J00-3004) a compression-based algorithm for chinese word segmentation
• (ACL ID: J01-2002) improving accuracy in word class tagging through the combination of machine learning systems
• (ACL ID: J97-3003) automatic rule induction for unknown-word guessing
• (ACL ID: N03-2029) automatic derivation of surface text patterns for a maximum entropy based question answering system
• (ACL ID: P02-1006) learning surface text patterns for a question answering system
• (ACL ID: P03-1038) self-organizing markov models and their application to part-of-speech tagging
• (ACL ID: P06-1124) a hierarchical bayesian language model based on pitman-yor processes
• (ACL ID: P06-2002) a rote extractor with edit distance-based generalisation and multi-corpora precision calculation
• (ACL ID: P94-1025) part-of-speech tagging using a variable memory markov model
• (ACL ID: P95-1030) new techniques for context modeling
• (ACL ID: P96-1043) unsupervised learning of word-category guessing rules
• (ACL ID: P97-1057) string transformation learning
• (ACL ID: P98-1010) a memory-based approach to learning shallow natural language patterns
• (ACL ID: W05-0810) nukti
• (ACL ID: W05-0824) rali
• (ACL ID: W06-0507) towards large-scale non-taxonomic relation extraction
• (ACL ID: W95-0108) beyond word n-grams
• (ACL ID: W98-1238) learning feature-value grammars from plain text