About: String metric

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: String metric Goto Sponge NotDistinct Permalink

An Entity of Type : yago:YagoPermanentlyLocatedEntity, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FString_metric

In mathematics and computer science, a string metric (also known as a string similarity metric or string distance function) is a metric that measures distance ("inverse similarity") between two text strings for approximate string matching or comparison and in fuzzy string searching. A requirement for a string metric (e.g. in contrast to string matching) is fulfillment of the triangle inequality. For example, the strings "Sam" and "Samuel" can be considered to be close. A string metric provides a number indicating an algorithm-specific indication of distance.

Attributes	Values
rdf:type	software yago:WikicatStringSimilarityMeasures yago:Abstraction100002137 yago:Act100030358 yago:Action100037396 yago:Choice100161243 yago:Decision100162632 yago:Event100029378 yago:Maneuver100168237 yago:Measure100174412 yago:Move100165942 yago:PsychologicalFeature100023100 yago:YagoPermanentlyLocatedEntity
rdfs:label	Mesure de similarité (fr) String metric (en)
rdfs:comment	En mathématiques et en informatique théorique, une mesure de similarité, plus exactement une mesure de distance entre mots, est une façon de représenter par un nombre la différence entre deux mots, ou plus généralement deux chaînes de caractères. Cela permet de comparer des mots ou chaines de façon simple et pratique. C'est donc une forme de distance mathématique et de métrique pour les chaînes de caractères. (fr) In mathematics and computer science, a string metric (also known as a string similarity metric or string distance function) is a metric that measures distance ("inverse similarity") between two text strings for approximate string matching or comparison and in fuzzy string searching. A requirement for a string metric (e.g. in contrast to string matching) is fulfillment of the triangle inequality. For example, the strings "Sam" and "Samuel" can be considered to be close. A string metric provides a number indicating an algorithm-specific indication of distance. (en)
dcterms:subject	String metrics Metrics
Wikipage page ID	9809306 (xsd:integer)
Wikipage revision ID	1100393000 (xsd:integer)
Link from a Wikipage to another Wikipage	Simple matching coefficient Approximate string matching Bhattacharyya distance Incremental search Information integration Levenshtein distance Mathematics String metrics Machine learning Computer science Hellinger distance Overlap coefficient String (computer science) Triangle inequality Data analysis techniques for fraud detection Data deduplication Data integration Data mining Distance Damerau–Levenshtein distance Database Kendall tau distance Knowledge integration Hamming distance Jaro–Winkler distance JavaScript Jensen–Shannon divergence Tversky index Metrics Edit distance Plagiarism detection DNA analysis Kullback–Leibler divergence Tf–idf Image analysis Metric (mathematics) Token (parser) dbr:Most_frequent_k_characters Ontology merging Scala programming language Sørensen–Dice coefficient L1 distance Tanimoto coefficient Fingerprint analysis City block distance Block distance Information radius Jaccard coefficient Jaccard similarity String matching dbr:Confusion_probability dbr:Fellegi_and_Sunters_metric dbr:Grammar-based_distance dbr:Maximal_matches dbr:Skew_divergence dbr:Variational_distance
Link from a Wikipage to an external page	http://rockymadden.com/stringmetric/ https://github.com/NaturalNode/natural https://web.archive.org/web/*/http:/www.dcs.shef.ac.uk/~sam/stringmetrics.html%23ukkonen https://web.archive.org/web/20070304092115/http:/www.dcs.shef.ac.uk/~sam/stringmetrics.html%23qgram http://www.speech.cs.cmu.edu/
sameAs	String metric String metric String metric String metric String metric String metric
dbp:wikiPageUsesTemplate	dbt:Mono dbt:Redirect dbt:Reflist dbt:Webarchive dbt:Strings
date	* (en)
url	https://web.archive.org/web/*/http:/www.dcs.shef.ac.uk/~sam/stringmetrics.html%23ukkonen
has abstract	En mathématiques et en informatique théorique, une mesure de similarité, plus exactement une mesure de distance entre mots, est une façon de représenter par un nombre la différence entre deux mots, ou plus généralement deux chaînes de caractères. Cela permet de comparer des mots ou chaines de façon simple et pratique. C'est donc une forme de distance mathématique et de métrique pour les chaînes de caractères. En programmation, la mesure la plus simple et la plus courante est la distance de Levenshtein : elle est obtenue en comptant le nombre de modification de caractères individuels (ajout, retrait, ou changement) pour passer d'une chaîne à l'autre. Elle est utilisée dans la recherche approximative ou la comparaison de chaînes, aussi appelée en anglais fuzzy string searching. (fr) In mathematics and computer science, a string metric (also known as a string similarity metric or string distance function) is a metric that measures distance ("inverse similarity") between two text strings for approximate string matching or comparison and in fuzzy string searching. A requirement for a string metric (e.g. in contrast to string matching) is fulfillment of the triangle inequality. For example, the strings "Sam" and "Samuel" can be considered to be close. A string metric provides a number indicating an algorithm-specific indication of distance. The most widely known string metric is a rudimentary one called the Levenshtein distance (also known as edit distance). It operates between two input strings, returning a number equivalent to the number of substitutions and deletions needed in order to transform one input string into another. Simplistic string metrics such as Levenshtein distance have expanded to include phonetic, token, grammatical and character-based methods of statistical comparisons. String metrics are used heavily in information integration and are currently used in areas including fraud detection, fingerprint analysis, plagiarism detection, ontology merging, DNA analysis, RNA analysis, image analysis, evidence-based machine learning, database data deduplication, data mining, incremental search, data integration, Malware Detection, and semantic knowledge integration. (en)
gold:hypernym	Metric
prov:wasDerivedFrom	wikipedia-en:String_metric?oldid=1100393000&ns=0
page length (characters) of wiki page	7312 (xsd:nonNegativeInteger)

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 51 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software