An Entity of Type: library, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

TRE is an open-source library for pattern matching in text, which works like a regular expression engine with the ability to do approximate string matching. It was developed by Ville Laurikari and is distributed under a 2-clause BSD-like license. The library is written in C and provides functions which allow using regular expressions for searching over input text lines. The main difference from other regular expression engines is that TRE can match text fragments in an approximate way, that is, supposing that text could have some number of typos.

Property Value
dbo:abstract
  • TRE is an open-source library for pattern matching in text, which works like a regular expression engine with the ability to do approximate string matching. It was developed by Ville Laurikari and is distributed under a 2-clause BSD-like license. The library is written in C and provides functions which allow using regular expressions for searching over input text lines. The main difference from other regular expression engines is that TRE can match text fragments in an approximate way, that is, supposing that text could have some number of typos. (en)
dbo:genre
dbo:license
dbo:programmingLanguage
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 32279357 (xsd:integer)
dbo:wikiPageLength
  • 8116 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1010396167 (xsd:integer)
dbo:wikiPageWikiLink
dbp:author
  • Ville Laurikari (en)
dbp:genre
dbp:license
  • 2 (xsd:integer)
dbp:name
  • TRE (en)
dbp:programmingLanguage
dbp:website
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • TRE is an open-source library for pattern matching in text, which works like a regular expression engine with the ability to do approximate string matching. It was developed by Ville Laurikari and is distributed under a 2-clause BSD-like license. The library is written in C and provides functions which allow using regular expressions for searching over input text lines. The main difference from other regular expression engines is that TRE can match text fragments in an approximate way, that is, supposing that text could have some number of typos. (en)
rdfs:label
  • TRE (computing) (en)
owl:sameAs
prov:wasDerivedFrom
foaf:homepage
foaf:isPrimaryTopicOf
foaf:name
  • TRE (en)
is dbo:wikiPageDisambiguates of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License