Index of papers in Proc. ACL that mention
  • regular expressions
Chiticariu, Laura and Krishnamurthy, Rajasekar and Li, Yunyao and Raghavan, Sriram and Reiss, Frederick and Vaithyanathan, Shivakumar
Grammar vs. Algebra
Character-Level Regular Expression CPSL cannot specify character-level regular expressions that span multiple tokens.
Grammar vs. Algebra
(b) Example operations supported in AQL that cannot be expressed in expanded code-free CPSL grammars include (i) character-level regular expressions spanning multiple tokens, (ii) counting the number of annotations occurring within a given bounded window and (iii) deleting annotations if they overlap with other annotations starting later in the document.
Grammar-based Systems and CPSL
Figure 3: Regular Expression Extraction Operator
SystemT
3 illustrates the regular expression extraction operator in the algebra, which performs character-level regular expression matching.
SystemT
0 The Extract operator (5) performs character-level operations such as regular expression and dictionary matching over text, creating a tuple for each match.
regular expressions is mentioned in 5 sentences in this paper.
Topics mentioned in this paper:
Jiang, Long and Yang, Shiquan and Zhou, Ming and Liu, Xiaohua and Zhu, Qingsheng
Adaptive Pattern-based Bilingual Data Mining
Table 2 lists the three classes and the corresponding regular expressions in Microsoft .Net Framework6.
Adaptive Pattern-based Bilingual Data Mining
The matching process is actually quite simple, since we transform the learnt patterns into standard regular expressions and then make use of existing regular expression matching tools (e. g., Microsoft .Net Framework) to extract translation pairs.
Adaptive Pattern-based Bilingual Data Mining
However, to make our patterns more robust, when transforming the selected patterns into standard regular expressions , we allow each character class to match more than once.
regular expressions is mentioned in 3 sentences in this paper.
Topics mentioned in this paper:
Mintz, Mike and Bills, Steven and Snow, Rion and Jurafsky, Daniel
Previous work
For example, the DIPRE algorithm by Brin (1998) used string-based regular expressions in order to recognize relations such as author-book, while the SNOWBALL algorithm by Agichtein and Gravano (2000) learned similar regular expression patterns over words and named entity tags.
Previous work
Hearst (1992) used a small number of regular expressions over words and part-of-speech tags to find examples of the hypernym relation.
Previous work
such as Ravichandran and Hovy (2002) and Pantel and Pennacchiotti (2006) use the same formalism of learning regular expressions over words and part-of-speech tags to discover patterns indicating a variety of relations.
regular expressions is mentioned in 3 sentences in this paper.
Topics mentioned in this paper:
Oh, Jong-Hoon and Torisawa, Kentaro and Hashimoto, Chikara and Sano, Motoki and De Saeger, Stijn and Ohtake, Kiyonori
Causal Relations for Why-QA
We identify cue phrases for causality in answer candidates using the regular expressions in Table 2.
Causal Relations for Why-QA
Regular expressions Examples
Causal Relations for Why-QA
Table 2: Regular expressions for identifying cue phrases for causality.
regular expressions is mentioned in 3 sentences in this paper.
Topics mentioned in this paper:
Candito, Marie and Constant, Matthieu
Data: MWEs in Dependency Trees
MWEs are first classified as regular or irregular, using regular expressions over the sequence of parts-of-speech within the MWE.
Data: MWEs in Dependency Trees
To define the regular expressions, we grouped gold MWEs according to the pair [global POS of the MWE + sequence of POS of the MWE components], and designed regular expressions to match the most frequent patterns that looked regular according to our linguistic knowledge.
Data: MWEs in Dependency Trees
5 The six regular expressions that we obtained cover nominal, prepositional, adverbial and verbal compounds.
regular expressions is mentioned in 3 sentences in this paper.
Topics mentioned in this paper:
Huang, Minlie and Ye, Borui and Wang, Yichen and Chen, Haiqiang and Cheng, Junjun and Zhu, Xiaoyan
Methodology
In order to obtain lexical patterns, we can define regular expressions with POS tags 2 and apply the regular expressions on POS tagged texts.
Methodology
Algorithm 1: New word detection algorithm Input: D: a large set of POS tagged posts W5: a set of seed words kp: the number of patterns chosen at each iteration kc: the number of patterns in the candidate pattern set kw: the number of words added at each iteration K: the number of words returned Output: A list of ranked new words W 1 Obtain all lexical patterns using regular expressions on 1); Count the frequency of each lexical pattern and extract words matched by each pattern ; 3 Obtain top kc frequent patterns as candidate pattern set ’PC and top 5,000 frequent words as candidate word set We ;
Related Work
For example, Justeson and Katz (1995) extracted technical terminologies from documents using a regular expression .
regular expressions is mentioned in 3 sentences in this paper.
Topics mentioned in this paper:
Kulick, Seth and Bies, Ann and Mott, Justin and Kroch, Anthony and Santorini, Beatrice and Liberman, Mark
Abstract
This paper introduces a new technique for phrase-structure parser analysis, categorizing possible treebank structures by integrating regular expressions into derivation trees.
Framework for analyzing parsing performance
2.1 Use of regular expressions
Introduction
Second, we use a set of regular expressions (henceforth “regexes”) that categorize the possible structures in the treebank.
regular expressions is mentioned in 3 sentences in this paper.
Topics mentioned in this paper:
Salameh, Mohammad and Cherry, Colin and Kondrak, Grzegorz
Methods
We define a word using the following regular expression:
Methods
Equation 1 may need to be modified for other languages or segmentation schemes, but our techniques generalize to any definition that can be written as a regular expression .
Methods
A chain is valid if it emits the beginning of a word as defined by the regular expression in Equation 1.
regular expressions is mentioned in 3 sentences in this paper.
Topics mentioned in this paper: