Approximate string matching
In computer science, approximate string matching (often colloquially referred to as fuzzy string searching) is the technique of finding strings that match a pattern approximately (rather than exactly). The problem of approximate string matching is typically divided into two sub-problems: finding approximate substring matches inside a given string and finding dictionary strings that match the pattern approximately.
- Comment
- enIn computer science, approximate string matching (often colloquially referred to as fuzzy string searching) is the technique of finding strings that match a pattern approximately (rather than exactly). The problem of approximate string matching is typically divided into two sub-problems: finding approximate substring matches inside a given string and finding dictionary strings that match the pattern approximately.
- Depiction
- Has abstract
- enIn computer science, approximate string matching (often colloquially referred to as fuzzy string searching) is the technique of finding strings that match a pattern approximately (rather than exactly). The problem of approximate string matching is typically divided into two sub-problems: finding approximate substring matches inside a given string and finding dictionary strings that match the pattern approximately.
- Hypernym
- Technique
- Is primary topic of
- Approximate string matching
- Label
- enApproximate string matching
- Link from a Wikipage to an external page
- www.dcc.uchile.cl/~gnavarro/ps/deb01.pdf
- flamingo.ics.uci.edu
- rockymadden.com/stringmetric/
- www.gersteinlab.org/courses/452/09-spring/pdf/Myers.pdf
- github.com/NaturalNode/natural
- web.archive.org/web/20160319053237/http:/www.cse.unsw.edu.au/~weiw/project/simjoin.html
- www.dcc.uchile.cl/~gnavarro/ps/spire98.2.pdf
- Link from a Wikipage to another Wikipage
- Acoustic fingerprint
- Agrep
- Big O notation
- Bitap algorithm
- Category:Dynamic programming
- Category:Pattern matching
- Category:String matching algorithms
- Computer science
- Concept search
- Dynamic programming
- Edit distance
- File:Did you mean andré emotions.png
- Index (search engine)
- Jaro–Winkler distance
- JavaScript
- Levenshtein distance
- Locality-sensitive hashing
- Metaphone
- Metric tree
- Needleman–Wunsch algorithm
- N-gram
- Nucleotide
- Online algorithm
- Pattern
- Plagiarism detection
- Programming tool
- Record linkage
- Regular expressions
- Scala programming language
- Smith–Waterman algorithm
- Soundex
- Spam filtering
- Spell checking
- String (computing)
- String metric
- Substring
- Suffix tree
- Trie
- Unix
- SameAs
- kAiE
- m.09k60p
- Pencarian string samar
- Q1798621
- Recherche approximative
- Unscharfe Suche
- Wasige stringpassing
- Наближена відповідність рядків
- Приближенное соответствие строк
- Приближно поклапање ниске
- 字符串近似匹配
- Subject
- Category:Dynamic programming
- Category:Pattern matching
- Category:String matching algorithms
- Thumbnail
- WasDerivedFrom
- Approximate string matching?oldid=1117200444&ns=0
- WikiPageLength
- 13816
- Wikipage page ID
- 3537993
- Wikipage revision ID
- 1117200444
- WikiPageUsesTemplate
- Template:Cite book
- Template:Cite conference
- Template:Cite journal
- Template:Div col
- Template:Div col end
- Template:Note
- Template:Ref
- Template:Refbegin
- Template:Refend
- Template:Reflist
- Template:Short description
- Template:Strings
