C90-2042 algorithms . They are pattern matching algorithms which take the concept types
C92-1019 data supports that the maximal matching algorithm is the most effective heuristics
C69-7602 This would require a more complex matching algorithm than I have yet worked out .
A83-1012 to by a question . The pattern matching algorithm assures that the constants in
A00-1005 have not evaluated this substring matching algorithm independently , a brief evaluation
A00-1005 next section ) . The sub-string matching algorithm greatly enhances the performance
C69-6301 question . Since the particular matching algorithm applies recnrsively from left
C92-2104 called " association database " . Matching algorithm for dependency selection is shown
C92-4188 combination of general pattern matching algorithms and linguistically defined procedures
A83-1031 recognizes speech by means of pattern matching algorithms . A subject is introduced to
A00-1005 from the user using a sub-string matching algorithm that uses character-based unigram
C04-1132 senses ( 98.7 % ) by our pattern matching algorithm . Furthermore , we chose 100
C92-1019 above difficulties . We adopt a matching algorithm with 6 different heuristic rules
C00-2090 In short , if the basis of this matching algorithm is the W&F algorithm , other
A00-1005 context-based parser uses a sub-string matching algorithm that uses character-based unigram
C04-1137 Similarity : ALINE The ALINE cognate matching algorithm ( Kon - drak , 2000 ) assigns
A97-1039 nodes . This reduces the tree matching algorithm to polynomial in n. Fur - thermore
C04-1150 the area of syntactic pattern matching algorithms ( Bunke and Sanfeliu , 1990 )
C00-2090 <title> Multi-level Similar Segment Matching Algorithm for Translation Memories and
C04-1175 characteristic of the longest matching algorithm by generating all possible segmentations
hide detail