A88-1030 1987 ) , was the following . The regular expression output had 6 errors in 185 noun
A88-1030 the program that processed the regular expressions for clauses . A stochastic program
A00-2040 . The part of FSA 's built-in regular expression syntax relevant to this paper
A00-2039 prototyping . Figure 2 displays the regular expression operators that will be used (
A00-3005 composition , intersection and union of regular expressions and relations . PP ( in the nice
A00-2004 from each sentence using a simple regular expression pattern matcher and a stopword
A00-1035 analysis grammar , which is a set of regular expressions covering the most common types
A00-2040 . By extending the language of regular expressions with operators which capture
A00-1019 be noun phrases , using simple regular expressions over the associated part-of-speech
A00-2012 The ` if part of a clause is a regular expression pattern , which is matched against
A00-2035 are usually encoded in terms of regular expression grammars supplemented with lists
A88-1030 has a clear advantage over the regular expression method . Basic noun phrases can
A00-1028 expressed as alternatives in the regular expression on its RHS . We can define a
A00-1028 grammar rules to consist of a regular expression over grammar sym - bols . This
A88-1030 different methods of parsing , a regular expression method and a stochastic method
A00-2040 extension of the basic syntax of regular expressions is the replace-operator . Karttunen
A00-2039 finite-state toolkit and extendible regular expression compiler . It is freely available
A00-2040 possibilities for defining new regular expression oper - . , R -RSB- IF11 , , Riil
A00-3004 allow LHIP to simply formulate regular expressions . In the query rule we have specified
A00-3005 components . On the other hand , regular expressions in the form of automata and transducers
hide detail