The paper describes an example-based parser for Chinese: Tree structure whose size is equal or smaller than the sentence to be parsed are retrieved from a treebank and aligned with the sentence. Subsequent structural adaptations handle unknown words, type shifting and metaphorical extensions of words. Derivational adaptations reanalyze awkward subtrees in order to auto-correct badly matched trees and insert unmatched, previously deleted words. This strategy is crucial for parsing long sentences. We try to illustrate the function of the parser through the analysis of one example sentence in different parsing models. The main concern is to find an optimal strategy for the retrieval of appropriate tree structures and to demonstrate the advantages of fuzzy matches. 1. Introduction The Academia Sinica possesses rich linguistic resources of modern Mandarin Chinese; among them, a manually tagged corpus of about 10 million characters [1] and a lexicon containing about 80,000 words which des...