When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Template:Regex - Wikipedia

    en.wikipedia.org/wiki/Template:Regex

    Search for an exact string using a simple regexp; pretest a small search domain. Hack out a highly refined set of page characteristics with concern only for an exact count of pages; refine in a sandbox and on the search results page.

  3. Regular expression - Wikipedia

    en.wikipedia.org/wiki/Regular_expression

    A regular expression (shortened as regex or regexp), [1] sometimes referred to as rational expression, [2] [3] is a sequence of characters that specifies a match pattern in text. Usually such patterns are used by string-searching algorithms for "find" or "find and replace" operations on strings , or for input validation .

  4. Help:Searching/Features - Wikipedia

    en.wikipedia.org/wiki/Help:Searching/Features

    Search for an exact string using a simple regexp; pretest a small search domain. Hack out a highly refined set of page characteristics with concern only for an exact count of pages; refine in a sandbox and on the search results page.

  5. Help:Searching - Wikipedia

    en.wikipedia.org/wiki/Help:Searching

    Search can also handle regular expressions, a sophisticated exact-string and string-pattern search tool that is not offered by most public search engines. Search can also filter results by template names used, category membership, or pages linking to a specific page.

  6. Help:Searching/Regex - Wikipedia

    en.wikipedia.org/wiki/Help:Searching/Regex

    A regex search scans the text of each page on Wikipedia in real time, character by character, to find pages that match a specific sequence or pattern of characters. Unlike keyword searching, regex searching is by default case-sensitive, does not ignore punctuation, and operates directly on the page source (MediaWiki markup) rather than on the ...

  7. Approximate string matching - Wikipedia

    en.wikipedia.org/wiki/Approximate_string_matching

    The closeness of a match is measured in terms of the number of primitive operations necessary to convert the string into an exact match. This number is called the edit distance between the string and the pattern. The usual primitive operations are: [1] insertion: cot → coat; deletion: coat → cot

  8. Pattern matching - Wikipedia

    en.wikipedia.org/wiki/Pattern_matching

    In many programming languages, a particular syntax of strings is used to represent regular expressions, which are patterns describing string characters. However, it is possible to perform some string pattern matching within the same framework that has been discussed throughout this article.

  9. findstr - Wikipedia

    en.wikipedia.org/wiki/Findstr

    /B Matches pattern if at the beginning of a line. /E Matches pattern if at the end of a line. /L Uses search strings literally. /R Uses search strings as regular expressions. /S Searches for matching files in the current directory and all subdirectories. /I Specifies that the search is not to be case-sensitive. /X Prints lines that match exactly.