This HTML5 document contains 34 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

Prefix	IRI
dct	http://purl.org/dc/terms/
yago-res	http://yago-knowledge.org/resource/
dbo	http://dbpedia.org/ontology/
foaf	http://xmlns.com/foaf/0.1/
dbt	http://dbpedia.org/resource/Template:
rdfs	http://www.w3.org/2000/01/rdf-schema#
freebase	http://rdf.freebase.com/ns/
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
owl	http://www.w3.org/2002/07/owl#
n13	http://en.wikipedia.org/wiki/
dbc	http://dbpedia.org/resource/Category:
dbp	http://dbpedia.org/property/
prov	http://www.w3.org/ns/prov#
xsdh	http://www.w3.org/2001/XMLSchema#
gold	http://purl.org/linguistics/gold/
dbr	http://dbpedia.org/resource/

Statements

Subject Item

dbr:Pattern_matching

rdf:type

dbo:MusicGenre dbo:Band owl:Thing

rdfs:label

Pattern matching

rdfs:comment

In computer science, pattern matching is the act of checking a given sequence of tokens for the presence of the constituents of some pattern. In contrast to pattern recognition, the match usually has to be exact: "either it will or will not be a match." The patterns generally have the form of either sequences or tree structures. Uses of pattern matching include outputting the locations (if any) of a pattern within a token sequence, to output some component of the matched pattern, and to substitute the matching pattern with some other token sequence (i.e., search and replace).

rdfs:seeAlso

dbr:Regular_expression

owl:sameAs

freebase:m.01pn1k yago-res:Pattern_matching

dbp:wikiPageUsesTemplate

dbt:Citation_needed dbt:Commons_category dbt:See_also dbt:Refbegin dbt:Expand_section dbt:About dbt:Refend dbt:For dbt:Main dbt:Short_description dbt:Reflist dbt:More_citations_needed dbt:Strings dbt:Authority_control dbt:Wikibooks

dct:subject

dbc:Pattern_matching dbc:Conditional_constructs dbc:Functional_programming dbc:Articles_with_example_Haskell_code

gold:hypernym

dbr:Act

prov:wasDerivedFrom

n13:Pattern_matching?oldid=1072126706&ns=0

dbo:wikiPageID

279688

dbo:wikiPageLength

21710

dbo:wikiPageRevisionID

1072126706

dbo:abstract

In computer science, pattern matching is the act of checking a given sequence of tokens for the presence of the constituents of some pattern. In contrast to pattern recognition, the match usually has to be exact: "either it will or will not be a match." The patterns generally have the form of either sequences or tree structures. Uses of pattern matching include outputting the locations (if any) of a pattern within a token sequence, to output some component of the matched pattern, and to substitute the matching pattern with some other token sequence (i.e., search and replace). Sequence patterns (e.g., a text string) are often described using regular expressions and matched using techniques such as backtracking. Tree patterns are used in some programming languages as a general tool to process data based on its structure, e.g. C#, F#, Haskell, ML, Python, Ruby, Rust, Scala, Swift and the symbolic mathematics language Mathematica have special syntax for expressing tree patterns and a language construct for conditional execution and value retrieval based on it. Often it is possible to give alternative patterns that are tried one by one, which yields a powerful conditional programming construct. Pattern matching sometimes includes support for guards. Parsing algorithms often rely on pattern matching to transform strings into syntax trees.

foaf:isPrimaryTopicOf

n13:Pattern_matching